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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K 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 749K 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-28-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679690819812

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-28
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 20:47:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 20:47:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 20:47:01] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-24 20:47:01] [INFO ] Transformed 2998 places.
[2023-03-24 20:47:01] [INFO ] Transformed 446 transitions.
[2023-03-24 20:47:01] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 2936 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 40 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 20:47:01] [INFO ] Computed 2492 place invariants in 116 ms
[2023-03-24 20:47:02] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-24 20:47:02] [INFO ] Invariant cache hit.
[2023-03-24 20:47:02] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-24 20:47:02] [INFO ] Invariant cache hit.
[2023-03-24 20:47:03] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2301 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2936 out of 2936 places after structural reductions.
[2023-03-24 20:47:04] [INFO ] Flatten gal took : 228 ms
[2023-03-24 20:47:04] [INFO ] Flatten gal took : 132 ms
[2023-03-24 20:47:04] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 76) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 56) 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 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) seen :0
Running SMT prover for 56 properties.
[2023-03-24 20:47:05] [INFO ] Invariant cache hit.
[2023-03-24 20:47:09] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 499 ms returned sat
[2023-03-24 20:47:10] [INFO ] After 3710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:56
[2023-03-24 20:47:13] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 488 ms returned sat
[2023-03-24 20:47:33] [INFO ] After 17540ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :50
[2023-03-24 20:47:35] [INFO ] After 19290ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :50
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 20:47:35] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :50
Fused 56 Parikh solutions to 47 different solutions.
Finished Parikh walk after 208 steps, including 0 resets, run visited all 38 properties in 17 ms. (steps per millisecond=12 )
Parikh walk visited 50 properties in 24 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2023-03-24 20:47:35] [INFO ] Flatten gal took : 88 ms
[2023-03-24 20:47:35] [INFO ] Flatten gal took : 90 ms
[2023-03-24 20:47:35] [INFO ] Input system was already deterministic with 446 transitions.
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 5 formulas.
FORMULA QuasiCertifProtocol-PT-28-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 336 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:36] [INFO ] Flatten gal took : 63 ms
[2023-03-24 20:47:36] [INFO ] Flatten gal took : 64 ms
[2023-03-24 20:47:36] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 27 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:36] [INFO ] Flatten gal took : 62 ms
[2023-03-24 20:47:36] [INFO ] Flatten gal took : 67 ms
[2023-03-24 20:47:36] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 222 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-24 20:47:37] [INFO ] Flatten gal took : 58 ms
FORMULA QuasiCertifProtocol-PT-28-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 20:47:37] [INFO ] Flatten gal took : 59 ms
[2023-03-24 20:47:37] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 0 out of 2936 places (down from 31) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.34 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2007 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2007 transition count 329
Applied a total of 115 rules in 179 ms. Remains 2007 /2936 variables (removed 929) and now considering 329/446 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 180 ms. Remains : 2007/2936 places, 329/446 transitions.
[2023-03-24 20:47:37] [INFO ] Flatten gal took : 41 ms
[2023-03-24 20:47:37] [INFO ] Flatten gal took : 41 ms
[2023-03-24 20:47:37] [INFO ] Input system was already deterministic with 329 transitions.
Incomplete random walk after 10000 steps, including 281 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1434509 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :{}
Probabilistic random walk after 1434509 steps, saw 184840 distinct states, run finished after 3002 ms. (steps per millisecond=477 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 329 rows 2007 cols
[2023-03-24 20:47:40] [INFO ] Computed 1680 place invariants in 35 ms
[2023-03-24 20:47:41] [INFO ] [Real]Absence check using 0 positive and 1680 generalized place invariants in 317 ms returned sat
[2023-03-24 20:47:41] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 20:47:42] [INFO ] [Nat]Absence check using 0 positive and 1680 generalized place invariants in 312 ms returned sat
[2023-03-24 20:47:43] [INFO ] After 1671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 20:47:44] [INFO ] After 2184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 780 ms.
[2023-03-24 20:47:45] [INFO ] After 3509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 159 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=26 )
FORMULA QuasiCertifProtocol-PT-28-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 134 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:45] [INFO ] Flatten gal took : 54 ms
[2023-03-24 20:47:45] [INFO ] Flatten gal took : 56 ms
[2023-03-24 20:47:45] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 133 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:45] [INFO ] Flatten gal took : 52 ms
[2023-03-24 20:47:45] [INFO ] Flatten gal took : 53 ms
[2023-03-24 20:47:45] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.11 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2008 transition count 330
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2008 transition count 330
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 2008 transition count 330
Applied a total of 116 rules in 287 ms. Remains 2008 /2936 variables (removed 928) and now considering 330/446 (removed 116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 287 ms. Remains : 2008/2936 places, 330/446 transitions.
[2023-03-24 20:47:46] [INFO ] Flatten gal took : 37 ms
[2023-03-24 20:47:46] [INFO ] Flatten gal took : 39 ms
[2023-03-24 20:47:46] [INFO ] Input system was already deterministic with 330 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 175 ms. Remains 2906 /2936 variables (removed 30) and now considering 444/446 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 175 ms. Remains : 2906/2936 places, 444/446 transitions.
[2023-03-24 20:47:46] [INFO ] Flatten gal took : 53 ms
[2023-03-24 20:47:46] [INFO ] Flatten gal took : 55 ms
[2023-03-24 20:47:46] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 150 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:46] [INFO ] Flatten gal took : 53 ms
[2023-03-24 20:47:46] [INFO ] Flatten gal took : 54 ms
[2023-03-24 20:47:46] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 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 184 ms. Remains 2905 /2936 variables (removed 31) and now considering 443/446 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 185 ms. Remains : 2905/2936 places, 443/446 transitions.
[2023-03-24 20:47:47] [INFO ] Flatten gal took : 55 ms
[2023-03-24 20:47:47] [INFO ] Flatten gal took : 57 ms
[2023-03-24 20:47:47] [INFO ] Input system was already deterministic with 443 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 134 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:47] [INFO ] Flatten gal took : 52 ms
[2023-03-24 20:47:47] [INFO ] Flatten gal took : 53 ms
[2023-03-24 20:47:47] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 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 2905 transition count 443
Applied a total of 2 rules in 339 ms. Remains 2905 /2936 variables (removed 31) and now considering 443/446 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 340 ms. Remains : 2905/2936 places, 443/446 transitions.
[2023-03-24 20:47:48] [INFO ] Flatten gal took : 51 ms
[2023-03-24 20:47:48] [INFO ] Flatten gal took : 53 ms
[2023-03-24 20:47:48] [INFO ] Input system was already deterministic with 443 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 139 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:48] [INFO ] Flatten gal took : 53 ms
[2023-03-24 20:47:48] [INFO ] Flatten gal took : 54 ms
[2023-03-24 20:47:48] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 150 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 2936/2936 places, 446/446 transitions.
[2023-03-24 20:47:48] [INFO ] Flatten gal took : 53 ms
[2023-03-24 20:47:48] [INFO ] Flatten gal took : 54 ms
[2023-03-24 20:47:48] [INFO ] Input system was already deterministic with 446 transitions.
[2023-03-24 20:47:48] [INFO ] Flatten gal took : 64 ms
[2023-03-24 20:47:49] [INFO ] Flatten gal took : 63 ms
[2023-03-24 20:47:49] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2023-03-24 20:47:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2936 places, 446 transitions and 6222 arcs took 7 ms.
Total runtime 48009 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: 2936 NrTr: 446 NrArc: 6222)

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

net check time: 0m 0.000sec

init dd package: 0m 2.656sec


before gc: list nodes free: 1227569

after gc: idd nodes used:45880972, unused:18119028; list nodes free:82018236

RS generation: 8m14.009sec


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


CANNOT_COMPUTE


BK_STOP 1679691395036

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-28"
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-28, 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-167873952400898"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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