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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.6K Feb 26 05:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 05:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 04:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 04:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 05:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Feb 26 05:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Feb 26 05:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m020-CTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679183447883

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=RingSingleMessageInMbox-PT-d0m020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:50:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:50:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:50:49] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-18 23:50:49] [INFO ] Transformed 385 places.
[2023-03-18 23:50:49] [INFO ] Transformed 59 transitions.
[2023-03-18 23:50:49] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 44 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 51 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 51 transition count 56
Applied a total of 8 rules in 14 ms. Remains 51 /56 variables (removed 5) and now considering 56/59 (removed 3) transitions.
// Phase 1: matrix 56 rows 51 cols
[2023-03-18 23:50:49] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-18 23:50:49] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-18 23:50:49] [INFO ] Invariant cache hit.
[2023-03-18 23:50:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-18 23:50:49] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-18 23:50:49] [INFO ] Invariant cache hit.
[2023-03-18 23:50:49] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/56 places, 56/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 51/56 places, 56/59 transitions.
Support contains 44 out of 51 places after structural reductions.
[2023-03-18 23:50:50] [INFO ] Flatten gal took : 19 ms
[2023-03-18 23:50:50] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:50:50] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 2064 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 54) seen :28
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 151 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-18 23:50:50] [INFO ] Invariant cache hit.
[2023-03-18 23:50:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:50:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:50:51] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:22
[2023-03-18 23:50:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 23:50:51] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:50:51] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :13
[2023-03-18 23:50:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-18 23:50:51] [INFO ] After 71ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :12 sat :13
[2023-03-18 23:50:51] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :13
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-18 23:50:51] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :13
Fused 25 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 18 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 51
Applied a total of 6 rules in 13 ms. Remains 48 /51 variables (removed 3) and now considering 51/56 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 48/51 places, 51/56 transitions.
Incomplete random walk after 10000 steps, including 2147 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 522 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 51 rows 48 cols
[2023-03-18 23:50:52] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:50:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:50:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-18 23:50:52] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 23:50:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:50:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:50:52] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 23:50:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-18 23:50:52] [INFO ] After 46ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-18 23:50:52] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-18 23:50:52] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 4 properties in 41 ms.
Support contains 10 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 129 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 47 transition count 48
Applied a total of 4 rules in 11 ms. Remains 47 /48 variables (removed 1) and now considering 48/51 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 47/48 places, 48/51 transitions.
Incomplete random walk after 10000 steps, including 2132 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 948 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 504 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Probably explored full state space saw : 266640 states, properties seen :6
Probabilistic random walk after 706536 steps, saw 266640 distinct states, run finished after 632 ms. (steps per millisecond=1117 ) properties seen :6
Explored full state space saw : 266640 states, properties seen :0
Exhaustive walk after 706536 steps, saw 266640 distinct states, run finished after 440 ms. (steps per millisecond=1605 ) properties seen :0
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:50:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:50:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 31 out of 51 places (down from 34) after GAL structural reductions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 157 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 53
Applied a total of 6 rules in 4 ms. Remains 48 /51 variables (removed 3) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/51 places, 53/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 46 transition count 49
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 46 transition count 49
Applied a total of 10 rules in 2 ms. Remains 46 /51 variables (removed 5) and now considering 49/56 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/51 places, 49/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 54
Applied a total of 4 rules in 4 ms. Remains 49 /51 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 49/51 places, 54/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 46 transition count 49
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 46 transition count 49
Applied a total of 10 rules in 2 ms. Remains 46 /51 variables (removed 5) and now considering 49/56 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/51 places, 49/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 47 transition count 50
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 47 transition count 50
Applied a total of 8 rules in 2 ms. Remains 47 /51 variables (removed 4) and now considering 50/56 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/51 places, 50/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 51
Applied a total of 6 rules in 2 ms. Remains 48 /51 variables (removed 3) and now considering 51/56 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/51 places, 51/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 47 transition count 50
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 47 transition count 50
Applied a total of 8 rules in 2 ms. Remains 47 /51 variables (removed 4) and now considering 50/56 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/51 places, 50/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 54
Applied a total of 4 rules in 2 ms. Remains 49 /51 variables (removed 2) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/51 places, 54/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 47 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 47 transition count 52
Applied a total of 8 rules in 2 ms. Remains 47 /51 variables (removed 4) and now considering 52/56 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/51 places, 52/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 46 transition count 49
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 46 transition count 49
Applied a total of 10 rules in 2 ms. Remains 46 /51 variables (removed 5) and now considering 49/56 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/51 places, 49/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 46 transition count 49
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 46 transition count 49
Applied a total of 10 rules in 2 ms. Remains 46 /51 variables (removed 5) and now considering 49/56 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/51 places, 49/56 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Input system was already deterministic with 49 transitions.
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:50:54] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:50:54] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-18 23:50:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 51 places, 56 transitions and 219 arcs took 0 ms.
Total runtime 5582 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: 51 NrTr: 56 NrArc: 219)

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

net check time: 0m 0.000sec

init dd package: 0m 2.709sec


RS generation: 0m 0.045sec


-> reachability set: #nodes 2314 (2.3e+03) #states 282,144 (5)



starting MCC model checker
--------------------------

checking: AG [AX [EF [[1<=p1 & 1<=p20]]]]
normalized: ~ [E [true U EX [~ [E [true U [1<=p1 & 1<=p20]]]]]]

abstracting: (1<=p20)
states: 2
abstracting: (1<=p1)
states: 68,250 (4)
.-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: AF [EX [[1<=p16 & 1<=p18]]]
normalized: ~ [EG [~ [EX [[1<=p16 & 1<=p18]]]]]

abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p16)
states: 3,876 (3)
..
EG iterations: 1
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AX [AF [EG [AG [[p2<=0 | p34<=0]]]]]
normalized: ~ [EX [EG [~ [EG [~ [E [true U ~ [[p2<=0 | p34<=0]]]]]]]]]

abstracting: (p34<=0)
states: 259,116 (5)
abstracting: (p2<=0)
states: 204,736 (5)
.
EG iterations: 1
.......
EG iterations: 7
.-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AG [[EX [AG [[p1<=0 | p48<=0]]] | [p1<=0 | p43<=0]]]
normalized: ~ [E [true U ~ [[[p1<=0 | p43<=0] | EX [~ [E [true U ~ [[p1<=0 | p48<=0]]]]]]]]]

abstracting: (p48<=0)
states: 267,252 (5)
abstracting: (p1<=0)
states: 213,894 (5)
.abstracting: (p43<=0)
states: 257,064 (5)
abstracting: (p1<=0)
states: 213,894 (5)
-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AF [AX [~ [A [[EF [[1<=p13 & 1<=p24]] | [1<=p1 & 1<=p46]] U [1<=p17 & 1<=p34]]]]]
normalized: ~ [EG [EX [[~ [EG [~ [[1<=p17 & 1<=p34]]]] & ~ [E [~ [[1<=p17 & 1<=p34]] U [~ [[[1<=p1 & 1<=p46] | E [true U [1<=p13 & 1<=p24]]]] & ~ [[1<=p17 & 1<=p34]]]]]]]]]

abstracting: (1<=p34)
states: 23,028 (4)
abstracting: (1<=p17)
states: 58,014 (4)
abstracting: (1<=p24)
states: 58,406 (4)
abstracting: (1<=p13)
states: 7,220 (3)
abstracting: (1<=p46)
states: 14,892 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p34)
states: 23,028 (4)
abstracting: (1<=p17)
states: 58,014 (4)
abstracting: (1<=p34)
states: 23,028 (4)
abstracting: (1<=p17)
states: 58,014 (4)
.
EG iterations: 1
.....................................
EG iterations: 36
-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.076sec

checking: ~ [E [[[~ [EF [AX [[1<=p1 & 1<=p25]]]] | [AF [[1<=p1 & 1<=p30]] | [1<=p4 & 1<=p18]]] & EX [0<=0]] U [1<=p2 & 1<=p32]]]
normalized: ~ [E [[EX [0<=0] & [[[1<=p4 & 1<=p18] | ~ [EG [~ [[1<=p1 & 1<=p30]]]]] | ~ [E [true U ~ [EX [~ [[1<=p1 & 1<=p25]]]]]]]] U [1<=p2 & 1<=p32]]]

abstracting: (1<=p32)
states: 23,028 (4)
abstracting: (1<=p2)
states: 77,408 (4)
abstracting: (1<=p25)
states: 13
abstracting: (1<=p1)
states: 68,250 (4)
.abstracting: (1<=p30)
states: 7,638 (3)
abstracting: (1<=p1)
states: 68,250 (4)
.
EG iterations: 1
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p4)
states: 7,790 (3)
abstracting: (0<=0)
states: 282,144 (5)
.-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: [AG [[1<=p18 & 1<=p16]] | E [AF [~ [AX [[1<=p2 & 1<=p24]]]] U [AX [[AG [[1<=p1 & 1<=p50]] | [~ [[1<=p13 & 1<=p24]] & ~ [[1<=p4 & 1<=p18]]]]] & EG [[1<=p1 & 1<=p41]]]]]
normalized: [E [~ [EG [~ [EX [~ [[1<=p2 & 1<=p24]]]]]] U [EG [[1<=p1 & 1<=p41]] & ~ [EX [~ [[[~ [[1<=p4 & 1<=p18]] & ~ [[1<=p13 & 1<=p24]]] | ~ [E [true U ~ [[1<=p1 & 1<=p50]]]]]]]]]] | ~ [E [true U ~ [[1<=p18 & 1<=p16]]]]]

abstracting: (1<=p16)
states: 3,876 (3)
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p50)
states: 238,905 (5)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p24)
states: 58,406 (4)
abstracting: (1<=p13)
states: 7,220 (3)
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p4)
states: 7,790 (3)
.abstracting: (1<=p41)
states: 17,772 (4)
abstracting: (1<=p1)
states: 68,250 (4)
.......................................
EG iterations: 39
abstracting: (1<=p24)
states: 58,406 (4)
abstracting: (1<=p2)
states: 77,408 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: AX [[AF [AX [EX [[1<=p1 & 1<=p50]]]] | A [E [EF [[1<=p16 & 1<=p18]] U EG [[1<=p1 & 1<=p47]]] U E [[1<=p1 & 1<=p43] U [EF [[1<=p1 & 1<=p43]] & [1<=p12 & 1<=p18]]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [E [[1<=p1 & 1<=p43] U [[1<=p12 & 1<=p18] & E [true U [1<=p1 & 1<=p43]]]]]]] & ~ [E [~ [E [[1<=p1 & 1<=p43] U [[1<=p12 & 1<=p18] & E [true U [1<=p1 & 1<=p43]]]]] U [~ [E [E [true U [1<=p16 & 1<=p18]] U EG [[1<=p1 & 1<=p47]]]] & ~ [E [[1<=p1 & 1<=p43] U [[1<=p12 & 1<=p18] & E [true U [1<=p1 & 1<=p43]]]]]]]]] | ~ [EG [EX [~ [EX [[1<=p1 & 1<=p50]]]]]]]]]]

abstracting: (1<=p50)
states: 238,905 (5)
abstracting: (1<=p1)
states: 68,250 (4)
.............................................
EG iterations: 43
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p12)
states: 2,280 (3)
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p47)
states: 14,892 (4)
abstracting: (1<=p1)
states: 68,250 (4)
....................................
EG iterations: 36
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p16)
states: 3,876 (3)
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p12)
states: 2,280 (3)
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p12)
states: 2,280 (3)
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.296sec

checking: [EF [[1<=p12 & 1<=p18]] & AX [EF [[AG [[1<=p1 & 1<=p48]] & [EG [[1<=p1 & 1<=p20]] & [EF [[1<=p1 & 1<=p28]] | [EF [[1<=p2 & 1<=p24]] & [1<=p1 & 1<=p43]]]]]]]]
normalized: [~ [EX [~ [E [true U [[[[[1<=p1 & 1<=p43] & E [true U [1<=p2 & 1<=p24]]] | E [true U [1<=p1 & 1<=p28]]] & EG [[1<=p1 & 1<=p20]]] & ~ [E [true U ~ [[1<=p1 & 1<=p48]]]]]]]]] & E [true U [1<=p12 & 1<=p18]]]

abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p12)
states: 2,280 (3)
abstracting: (1<=p48)
states: 14,892 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p20)
states: 2
abstracting: (1<=p1)
states: 68,250 (4)
..
EG iterations: 2
abstracting: (1<=p28)
states: 17,784 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p24)
states: 58,406 (4)
abstracting: (1<=p2)
states: 77,408 (4)
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
.-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: [EF [[AF [[p6<=0 | p18<=0]] & [[p7<=0 | p18<=0] & [[p1<=0 | p45<=0] | [p1<=0 | p37<=0]]]]] & A [EG [[~ [[1<=p12 & 1<=p18]] & A [[1<=p1 & 1<=p44] U [1<=p0 & 1<=p18]]]] U ~ [EG [[EF [[1<=p1 & 1<=p41]] | [1<=p1 & 1<=p44]]]]]]
normalized: [[~ [EG [EG [[[1<=p1 & 1<=p44] | E [true U [1<=p1 & 1<=p41]]]]]] & ~ [E [EG [[[1<=p1 & 1<=p44] | E [true U [1<=p1 & 1<=p41]]]] U [~ [EG [[[~ [EG [~ [[1<=p0 & 1<=p18]]]] & ~ [E [~ [[1<=p0 & 1<=p18]] U [~ [[1<=p1 & 1<=p44]] & ~ [[1<=p0 & 1<=p18]]]]]] & ~ [[1<=p12 & 1<=p18]]]]] & EG [[[1<=p1 & 1<=p44] | E [true U [1<=p1 & 1<=p41]]]]]]]] & E [true U [[[[p1<=0 | p37<=0] | [p1<=0 | p45<=0]] & [p7<=0 | p18<=0]] & ~ [EG [~ [[p6<=0 | p18<=0]]]]]]]

abstracting: (p18<=0)
states: 8,018 (3)
abstracting: (p6<=0)
states: 277,204 (5)
..
EG iterations: 2
abstracting: (p18<=0)
states: 8,018 (3)
abstracting: (p7<=0)
states: 279,864 (5)
abstracting: (p45<=0)
states: 257,064 (5)
abstracting: (p1<=0)
states: 213,894 (5)
abstracting: (p37<=0)
states: 274,506 (5)
abstracting: (p1<=0)
states: 213,894 (5)
abstracting: (1<=p41)
states: 17,772 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p44)
states: 7,638 (3)
abstracting: (1<=p1)
states: 68,250 (4)
.................................................................................................
EG iterations: 97
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p12)
states: 2,280 (3)
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p44)
states: 7,638 (3)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p41)
states: 17,772 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p44)
states: 7,638 (3)
abstracting: (1<=p1)
states: 68,250 (4)
.................................................................................................
EG iterations: 97
abstracting: (1<=p41)
states: 17,772 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p44)
states: 7,638 (3)
abstracting: (1<=p1)
states: 68,250 (4)
.................................................................................................
EG iterations: 97
.
EG iterations: 1
-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.172sec

checking: [A [[[AX [[1<=p16 & 1<=p18]] & ~ [EG [[1<=p7 & 1<=p18]]]] & [1<=p1 & 1<=p26]] U [~ [[1<=p1 & 1<=p25]] & AX [[[1<=p1 & 1<=p40] | [1<=p1 & 1<=p48]]]]] | [EX [AG [[p1<=0 | p44<=0]]] & [AX [AF [[p1<=0 | p41<=0]]] & [EF [EG [[p6<=0 | p18<=0]]] | ~ [E [EF [[1<=p1 & 1<=p43]] U ~ [[[1<=p15 & 1<=p18] | [1<=p1 & 1<=p38]]]]]]]]]
normalized: [[[[~ [E [E [true U [1<=p1 & 1<=p43]] U ~ [[[1<=p1 & 1<=p38] | [1<=p15 & 1<=p18]]]]] | E [true U EG [[p6<=0 | p18<=0]]]] & ~ [EX [EG [~ [[p1<=0 | p41<=0]]]]]] & EX [~ [E [true U ~ [[p1<=0 | p44<=0]]]]]] | [~ [EG [~ [[~ [EX [~ [[[1<=p1 & 1<=p48] | [1<=p1 & 1<=p40]]]]] & ~ [[1<=p1 & 1<=p25]]]]]] & ~ [E [~ [[~ [EX [~ [[[1<=p1 & 1<=p48] | [1<=p1 & 1<=p40]]]]] & ~ [[1<=p1 & 1<=p25]]]] U [~ [[[1<=p1 & 1<=p26] & [~ [EG [[1<=p7 & 1<=p18]]] & ~ [EX [~ [[1<=p16 & 1<=p18]]]]]]] & ~ [[~ [EX [~ [[[1<=p1 & 1<=p48] | [1<=p1 & 1<=p40]]]]] & ~ [[1<=p1 & 1<=p25]]]]]]]]]

abstracting: (1<=p25)
states: 13
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p40)
states: 0
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p48)
states: 14,892 (4)
abstracting: (1<=p1)
states: 68,250 (4)
.abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p16)
states: 3,876 (3)
.abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p7)
states: 2,280 (3)
..
EG iterations: 2
abstracting: (1<=p26)
states: 98,718 (4)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p25)
states: 13
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p40)
states: 0
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p48)
states: 14,892 (4)
abstracting: (1<=p1)
states: 68,250 (4)
.abstracting: (1<=p25)
states: 13
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p40)
states: 0
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p48)
states: 14,892 (4)
abstracting: (1<=p1)
states: 68,250 (4)
............................................
EG iterations: 43
abstracting: (p44<=0)
states: 274,506 (5)
abstracting: (p1<=0)
states: 213,894 (5)
.abstracting: (p41<=0)
states: 264,372 (5)
abstracting: (p1<=0)
states: 213,894 (5)
.......................................
EG iterations: 39
.abstracting: (p18<=0)
states: 8,018 (3)
abstracting: (p6<=0)
states: 277,204 (5)
.
EG iterations: 1
abstracting: (1<=p18)
states: 274,126 (5)
abstracting: (1<=p15)
states: 3,876 (3)
abstracting: (1<=p38)
states: 7,638 (3)
abstracting: (1<=p1)
states: 68,250 (4)
abstracting: (1<=p43)
states: 25,080 (4)
abstracting: (1<=p1)
states: 68,250 (4)
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.241sec

totally nodes used: 690963 (6.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2757974 2599245 5357219
used/not used/entry size/cache size: 3044942 64063922 16 1024MB
basic ops cache: hits/miss/sum: 443013 392262 835275
used/not used/entry size/cache size: 719940 16057276 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 15178 10891 26069
used/not used/entry size/cache size: 10889 8377719 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66541871
1 473576
2 76383
3 13634
4 2032
5 404
6 120
7 94
8 67
9 48
>= 10 635

Total processing time: 0m 5.521sec


BK_STOP 1679183461257

--------------------
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.000sec


iterations count:4061 (72), effective:270 (4)

initing FirstDep: 0m 0.000sec


iterations count:72 (1), effective:2 (0)

iterations count:71 (1), effective:1 (0)

iterations count:1160 (20), effective:40 (0)

iterations count:1137 (20), effective:41 (0)

iterations count:1095 (19), effective:41 (0)

iterations count:647 (11), effective:29 (0)

iterations count:807 (14), effective:35 (0)

iterations count:56 (1), effective:0 (0)

iterations count:75 (1), effective:1 (0)

iterations count:307 (5), effective:20 (0)

iterations count:928 (16), effective:34 (0)

iterations count:56 (1), effective:0 (0)

iterations count:1130 (20), effective:41 (0)

iterations count:928 (16), effective:34 (0)

iterations count:56 (1), effective:0 (0)

iterations count:56 (1), effective:0 (0)

iterations count:928 (16), effective:34 (0)

iterations count:56 (1), effective:0 (0)

iterations count:1099 (19), effective:41 (0)

iterations count:67 (1), effective:1 (0)

iterations count:166 (2), effective:8 (0)

iterations count:1119 (19), effective:37 (0)

iterations count:79 (1), effective:1 (0)

iterations count:167 (2), effective:8 (0)

iterations count:150 (2), effective:5 (0)

iterations count:167 (2), effective:8 (0)

iterations count:167 (2), effective:8 (0)

iterations count:56 (1), effective:0 (0)

iterations count:1098 (19), effective:41 (0)

iterations count:73 (1), effective:1 (0)

iterations count:928 (16), effective:34 (0)

iterations count:113 (2), effective:4 (0)

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="RingSingleMessageInMbox-PT-d0m020"
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 RingSingleMessageInMbox-PT-d0m020, 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 r330-tall-167889203700802"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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