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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K 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 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K 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-PT-32-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679691405039

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-PT-32
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 20:56:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 20:56:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 20:56:46] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-24 20:56:46] [INFO ] Transformed 3806 places.
[2023-03-24 20:56:46] [INFO ] Transformed 506 transitions.
[2023-03-24 20:56:46] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 3710 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 240 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 20:56:47] [INFO ] Computed 3232 place invariants in 120 ms
[2023-03-24 20:56:47] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-03-24 20:56:47] [INFO ] Invariant cache hit.
[2023-03-24 20:56:49] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-24 20:56:49] [INFO ] Invariant cache hit.
[2023-03-24 20:56:50] [INFO ] Dead Transitions using invariants and state equation in 1421 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 3869 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3710 out of 3736 places after structural reductions.
[2023-03-24 20:56:51] [INFO ] Flatten gal took : 320 ms
[2023-03-24 20:56:51] [INFO ] Flatten gal took : 165 ms
[2023-03-24 20:56:52] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 94) seen :27
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 67) 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 67) 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 67) 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 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 67) 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 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) seen :0
Running SMT prover for 67 properties.
[2023-03-24 20:56:53] [INFO ] Invariant cache hit.
[2023-03-24 20:56:58] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 717 ms returned sat
[2023-03-24 20:56:59] [INFO ] After 5078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:67
[2023-03-24 20:57:03] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 753 ms returned sat
[2023-03-24 20:57:24] [INFO ] After 16389ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :65
[2023-03-24 20:57:24] [INFO ] After 16395ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :65
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 20:57:24] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :65
Fused 67 Parikh solutions to 17 different solutions.
Parikh walk visited 63 properties in 89 ms.
Support contains 77 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 2613 are kept as prefixes of interest. Removing 1123 places using SCC suffix rule.18 ms
Discarding 1123 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 2613 transition count 435
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 70 place count 2613 transition count 433
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 2611 transition count 433
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 138 place count 2547 transition count 369
Iterating global reduction 1 with 64 rules applied. Total rules applied 202 place count 2547 transition count 369
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 1 with 31 rules applied. Total rules applied 233 place count 2547 transition count 338
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 264 place count 2516 transition count 338
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 295 place count 2516 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 2515 transition count 337
Applied a total of 296 rules in 2277 ms. Remains 2515 /3736 variables (removed 1221) and now considering 337/506 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2277 ms. Remains : 2515/3736 places, 337/506 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1025620 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1025620 steps, saw 130745 distinct states, run finished after 3002 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 337 rows 2515 cols
[2023-03-24 20:57:29] [INFO ] Computed 2178 place invariants in 23 ms
[2023-03-24 20:57:30] [INFO ] [Real]Absence check using 0 positive and 2178 generalized place invariants in 454 ms returned sat
[2023-03-24 20:57:31] [INFO ] After 1671ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-24 20:57:31] [INFO ] Flatten gal took : 100 ms
[2023-03-24 20:57:31] [INFO ] Flatten gal took : 104 ms
[2023-03-24 20:57:32] [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).
AF dead knowledge conclusive for 1 formulas.
FORMULA QuasiCertifProtocol-PT-32-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 133 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 134 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:32] [INFO ] Flatten gal took : 79 ms
[2023-03-24 20:57:32] [INFO ] Flatten gal took : 84 ms
[2023-03-24 20:57:32] [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 231 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 232 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:32] [INFO ] Flatten gal took : 75 ms
[2023-03-24 20:57:32] [INFO ] Flatten gal took : 75 ms
[2023-03-24 20:57:33] [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 3670 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.28 ms
Discarding 66 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3668 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3668 transition count 503
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3668 transition count 503
Applied a total of 5 rules in 994 ms. Remains 3668 /3736 variables (removed 68) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 995 ms. Remains : 3668/3736 places, 503/506 transitions.
[2023-03-24 20:57:34] [INFO ] Flatten gal took : 70 ms
[2023-03-24 20:57:34] [INFO ] Flatten gal took : 72 ms
[2023-03-24 20:57:34] [INFO ] Input system was already deterministic with 503 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.13 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 582 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 582 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 20:57:34] [INFO ] Flatten gal took : 74 ms
[2023-03-24 20:57:35] [INFO ] Flatten gal took : 71 ms
[2023-03-24 20:57:35] [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 575 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 575 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:35] [INFO ] Flatten gal took : 75 ms
[2023-03-24 20:57:35] [INFO ] Flatten gal took : 77 ms
[2023-03-24 20:57:35] [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 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 114 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:36] [INFO ] Flatten gal took : 71 ms
[2023-03-24 20:57:36] [INFO ] Flatten gal took : 76 ms
[2023-03-24 20:57:36] [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 230 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 230 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:36] [INFO ] Flatten gal took : 70 ms
[2023-03-24 20:57:36] [INFO ] Flatten gal took : 72 ms
[2023-03-24 20:57:36] [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 256 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 257 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:37] [INFO ] Flatten gal took : 69 ms
[2023-03-24 20:57:37] [INFO ] Flatten gal took : 70 ms
[2023-03-24 20:57:37] [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 234 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 237 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:37] [INFO ] Flatten gal took : 68 ms
[2023-03-24 20:57:37] [INFO ] Flatten gal took : 69 ms
[2023-03-24 20:57:37] [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
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3702 transition count 504
Applied a total of 3 rules in 560 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 560 ms. Remains : 3702/3736 places, 504/506 transitions.
[2023-03-24 20:57:38] [INFO ] Flatten gal took : 68 ms
[2023-03-24 20:57:38] [INFO ] Flatten gal took : 70 ms
[2023-03-24 20:57:38] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 225 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 227 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:38] [INFO ] Flatten gal took : 69 ms
[2023-03-24 20:57:39] [INFO ] Flatten gal took : 70 ms
[2023-03-24 20:57:39] [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 223 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 224 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:39] [INFO ] Flatten gal took : 68 ms
[2023-03-24 20:57:39] [INFO ] Flatten gal took : 70 ms
[2023-03-24 20:57:39] [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 222 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 223 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:39] [INFO ] Flatten gal took : 69 ms
[2023-03-24 20:57:39] [INFO ] Flatten gal took : 84 ms
[2023-03-24 20:57:40] [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.
Applied a total of 1 rules in 253 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 254 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 20:57:40] [INFO ] Flatten gal took : 68 ms
[2023-03-24 20:57:40] [INFO ] Flatten gal took : 78 ms
[2023-03-24 20:57:40] [INFO ] Input system was already deterministic with 503 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1338099 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338099 steps, saw 161485 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 503 rows 3701 cols
[2023-03-24 20:57:43] [INFO ] Computed 3200 place invariants in 48 ms
[2023-03-24 20:57:44] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 725 ms returned sat
[2023-03-24 20:57:46] [INFO ] After 1277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 20:57:46] [INFO ] After 1410ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-24 20:57:46] [INFO ] After 2670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
FORMULA QuasiCertifProtocol-PT-32-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 226 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 227 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 20:57:46] [INFO ] Flatten gal took : 75 ms
[2023-03-24 20:57:46] [INFO ] Flatten gal took : 69 ms
[2023-03-24 20:57:46] [INFO ] Input system was already deterministic with 506 transitions.
[2023-03-24 20:57:46] [INFO ] Flatten gal took : 82 ms
[2023-03-24 20:57:47] [INFO ] Flatten gal took : 81 ms
[2023-03-24 20:57:47] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2023-03-24 20:57:47] [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 60794 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.788sec

net check time: 0m 0.001sec

init dd package: 0m 2.625sec


before gc: list nodes free: 1411644

after gc: idd nodes used:31730612, unused:32269388; list nodes free:144642777

before gc: list nodes free: 1587593

after gc: idd nodes used:63452339, unused:547661; list nodes free:4122092

RS generation: 14m 0.138sec


-> last computed set: #nodes 63448636 (6.3e+07) #states 8,388,609 (6)


CANNOT_COMPUTE


BK_STOP 1679692355027

--------------------
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-PT-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-PT-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-167873952400906"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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