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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 04:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 04:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Feb 26 04:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Feb 26 04:59 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-d0m005-CTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679183174861

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-d0m005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:46:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:46:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:46:16] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-18 23:46:16] [INFO ] Transformed 385 places.
[2023-03-18 23:46:16] [INFO ] Transformed 59 transitions.
[2023-03-18 23:46:16] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 100 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 50 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
Applied a total of 2 rules in 11 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2023-03-18 23:46:16] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-18 23:46:16] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-18 23:46:16] [INFO ] Invariant cache hit.
[2023-03-18 23:46:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:46:16] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-18 23:46:16] [INFO ] Invariant cache hit.
[2023-03-18 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 59/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 54/56 places, 59/59 transitions.
Support contains 50 out of 54 places after structural reductions.
[2023-03-18 23:46:17] [INFO ] Flatten gal took : 22 ms
[2023-03-18 23:46:17] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:46:17] [INFO ] Input system was already deterministic with 59 transitions.
Incomplete random walk after 10000 steps, including 2101 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 63) seen :34
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 158 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 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-18 23:46:17] [INFO ] Invariant cache hit.
[2023-03-18 23:46:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:46:18] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-18 23:46:18] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :13 sat :0 real:13
[2023-03-18 23:46:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:46:18] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:46:18] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :18 sat :8
[2023-03-18 23:46:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:46:18] [INFO ] After 49ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :18 sat :8
[2023-03-18 23:46:18] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 4 ms to minimize.
[2023-03-18 23:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-18 23:46:18] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :18 sat :8
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-18 23:46:18] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :18 sat :8
Fused 26 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 59/59 transitions.
Graph (complete) has 141 edges and 54 vertex of which 53 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 53 transition count 56
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 50 transition count 51
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 50 transition count 51
Applied a total of 10 rules in 10 ms. Remains 50 /54 variables (removed 4) and now considering 51/59 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 50/54 places, 51/59 transitions.
Incomplete random walk after 10000 steps, including 2184 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 51 rows 50 cols
[2023-03-18 23:46:18] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-18 23:46:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 23:46:19] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 23:46:19] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:46:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:46:19] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:46:19] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:46:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-18 23:46:19] [INFO ] After 16ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 23:46:19] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 23:46:19] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 51/51 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 48 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 49
Applied a total of 4 rules in 6 ms. Remains 48 /50 variables (removed 2) and now considering 49/51 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 48/50 places, 49/51 transitions.
Incomplete random walk after 10000 steps, including 2167 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 529 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Finished probabilistic random walk after 446 steps, run visited all 4 properties in 16 ms. (steps per millisecond=27 )
Probabilistic random walk after 446 steps, saw 242 distinct states, run finished after 16 ms. (steps per millisecond=27 ) properties seen :4
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:46:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 15 ms
FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 59 transitions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 164 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 5 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 52
Applied a total of 14 rules in 4 ms. Remains 47 /54 variables (removed 7) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/54 places, 52/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 56
Applied a total of 6 rules in 2 ms. Remains 51 /54 variables (removed 3) and now considering 56/59 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/54 places, 56/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 56
Applied a total of 6 rules in 5 ms. Remains 51 /54 variables (removed 3) and now considering 56/59 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 51/54 places, 56/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 50
Applied a total of 14 rules in 6 ms. Remains 47 /54 variables (removed 7) and now considering 50/59 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 47/54 places, 50/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 53
Applied a total of 8 rules in 3 ms. Remains 50 /54 variables (removed 4) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/54 places, 53/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 3 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 55
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 49 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 49 transition count 54
Applied a total of 10 rules in 6 ms. Remains 49 /54 variables (removed 5) and now considering 54/59 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 49/54 places, 54/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 3 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 5 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 52
Applied a total of 14 rules in 3 ms. Remains 47 /54 variables (removed 7) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 47/54 places, 52/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 49 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 49 transition count 52
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/54 places, 52/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 52
Applied a total of 14 rules in 3 ms. Remains 47 /54 variables (removed 7) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 47/54 places, 52/59 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:46:19] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:46:19] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:46:19] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:46:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 59 transitions and 231 arcs took 0 ms.
Total runtime 3602 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: 54 NrTr: 59 NrArc: 231)

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

net check time: 0m 0.000sec

init dd package: 0m 2.712sec


RS generation: 0m 0.030sec


-> reachability set: #nodes 1673 (1.7e+03) #states 2,662 (3)



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

checking: EX [EG [[p1<=0 | p26<=0]]]
normalized: EX [EG [[p1<=0 | p26<=0]]]

abstracting: (p26<=0)
states: 2,649 (3)
abstracting: (p1<=0)
states: 1,820 (3)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [A [~ [AG [E [[1<=p1 & 1<=p51] U [1<=p2 & 1<=p24]]]] U AX [EX [0<=0]]]]
normalized: ~ [E [true U ~ [[~ [EG [EX [~ [EX [0<=0]]]]] & ~ [E [EX [~ [EX [0<=0]]] U [~ [E [true U ~ [E [[1<=p1 & 1<=p51] U [1<=p2 & 1<=p24]]]]] & EX [~ [EX [0<=0]]]]]]]]]]

abstracting: (0<=0)
states: 2,662 (3)
..abstracting: (1<=p24)
states: 538
abstracting: (1<=p2)
states: 580
abstracting: (1<=p51)
states: 64
abstracting: (1<=p1)
states: 842
abstracting: (0<=0)
states: 2,662 (3)
..abstracting: (0<=0)
states: 2,662 (3)
............
EG iterations: 10
-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: ~ [A [~ [[1<=p1 & 1<=p46]] U [1<=p4 & 1<=p18]]]
normalized: ~ [[~ [EG [~ [[1<=p4 & 1<=p18]]]] & ~ [E [~ [[1<=p4 & 1<=p18]] U [[1<=p1 & 1<=p46] & ~ [[1<=p4 & 1<=p18]]]]]]]

abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p4)
states: 125
abstracting: (1<=p46)
states: 85
abstracting: (1<=p1)
states: 842
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p4)
states: 125
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p4)
states: 125
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: EG [AX [[EF [[1<=p1 & 1<=p45]] | [1<=p1 & 1<=p43]]]]
normalized: EG [~ [EX [~ [[[1<=p1 & 1<=p43] | E [true U [1<=p1 & 1<=p45]]]]]]]

abstracting: (1<=p45)
states: 291
abstracting: (1<=p1)
states: 842
abstracting: (1<=p43)
states: 142
abstracting: (1<=p1)
states: 842
.........
EG iterations: 8
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [[EF [[p40<=0 | p1<=0]] & AX [AF [[[p5<=0 | p28<=0] & [p1<=0 | p45<=0]]]]]]
normalized: ~ [E [true U ~ [[~ [EX [EG [~ [[[p1<=0 | p45<=0] & [p5<=0 | p28<=0]]]]]] & E [true U [p40<=0 | p1<=0]]]]]]

abstracting: (p1<=0)
states: 1,820 (3)
abstracting: (p40<=0)
states: 2,577 (3)
abstracting: (p28<=0)
states: 2,377 (3)
abstracting: (p5<=0)
states: 2,377 (3)
abstracting: (p45<=0)
states: 2,371 (3)
abstracting: (p1<=0)
states: 1,820 (3)
..........
EG iterations: 10
.-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: E [[EF [[EF [[1<=p3 & 1<=p18]] & [1<=p1 & 1<=p49]]] | EG [[1<=p1 & 1<=p21]]] U [1<=p1 & 1<=p25]]
normalized: E [[EG [[1<=p1 & 1<=p21]] | E [true U [[1<=p1 & 1<=p49] & E [true U [1<=p3 & 1<=p18]]]]] U [1<=p1 & 1<=p25]]

abstracting: (1<=p25)
states: 260
abstracting: (1<=p1)
states: 842
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p49)
states: 64
abstracting: (1<=p1)
states: 842
abstracting: (1<=p21)
states: 135
abstracting: (1<=p1)
states: 842
........
EG iterations: 8
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [AF [AG [[1<=p11 & 1<=p18]]] | AG [EF [EX [[[[1<=p1 & 1<=p30] & [1<=p1 & 1<=p21]] | [p1<=0 | p23<=0]]]]]]
normalized: [~ [E [true U ~ [E [true U EX [[[p1<=0 | p23<=0] | [[1<=p1 & 1<=p21] & [1<=p1 & 1<=p30]]]]]]]] | ~ [EG [E [true U ~ [[1<=p11 & 1<=p18]]]]]]

abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p11)
states: 30

EG iterations: 0
abstracting: (1<=p30)
states: 225
abstracting: (1<=p1)
states: 842
abstracting: (1<=p21)
states: 135
abstracting: (1<=p1)
states: 842
abstracting: (p23<=0)
states: 2,335 (3)
abstracting: (p1<=0)
states: 1,820 (3)
.-> the formula is FALSE

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

MC time: 0m 0.023sec

checking: E [EG [[1<=p1 & 1<=p53]] U [~ [AF [EX [[[1<=p2 & 1<=p34] | [1<=p1 & 1<=p43]]]]] & [EX [[1<=p1 & 1<=p51]] | [1<=p0 & 1<=p18]]]]
normalized: E [EG [[1<=p1 & 1<=p53]] U [[[1<=p0 & 1<=p18] | EX [[1<=p1 & 1<=p51]]] & EG [~ [EX [[[1<=p1 & 1<=p43] | [1<=p2 & 1<=p34]]]]]]]

abstracting: (1<=p34)
states: 210
abstracting: (1<=p2)
states: 580
abstracting: (1<=p43)
states: 142
abstracting: (1<=p1)
states: 842
...
EG iterations: 2
abstracting: (1<=p51)
states: 64
abstracting: (1<=p1)
states: 842
.abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p53)
states: 888
abstracting: (1<=p1)
states: 842
.........
EG iterations: 9
-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [[[EX [0<=0] | [p11<=0 | p18<=0]] & [~ [A [[1<=p1 & 1<=p53] U [~ [[1<=p1 & 1<=p44]] & EF [[1<=p1 & 1<=p25]]]]] | EX [[[p2<=0 | p24<=0] | AG [[p1<=0 | p37<=0]]]]]]]
normalized: ~ [E [true U ~ [[[EX [[~ [E [true U ~ [[p1<=0 | p37<=0]]]] | [p2<=0 | p24<=0]]] | ~ [[~ [EG [~ [[E [true U [1<=p1 & 1<=p25]] & ~ [[1<=p1 & 1<=p44]]]]]] & ~ [E [~ [[E [true U [1<=p1 & 1<=p25]] & ~ [[1<=p1 & 1<=p44]]]] U [~ [[1<=p1 & 1<=p53]] & ~ [[E [true U [1<=p1 & 1<=p25]] & ~ [[1<=p1 & 1<=p44]]]]]]]]]] & [[p11<=0 | p18<=0] | EX [0<=0]]]]]]

abstracting: (0<=0)
states: 2,662 (3)
.abstracting: (p18<=0)
states: 418
abstracting: (p11<=0)
states: 2,632 (3)
abstracting: (1<=p44)
states: 920
abstracting: (1<=p1)
states: 842
abstracting: (1<=p25)
states: 260
abstracting: (1<=p1)
states: 842
abstracting: (1<=p53)
states: 888
abstracting: (1<=p1)
states: 842
abstracting: (1<=p44)
states: 920
abstracting: (1<=p1)
states: 842
abstracting: (1<=p25)
states: 260
abstracting: (1<=p1)
states: 842
abstracting: (1<=p44)
states: 920
abstracting: (1<=p1)
states: 842
abstracting: (1<=p25)
states: 260
abstracting: (1<=p1)
states: 842
.
EG iterations: 1
abstracting: (p24<=0)
states: 2,124 (3)
abstracting: (p2<=0)
states: 2,082 (3)
abstracting: (p37<=0)
states: 2,421 (3)
abstracting: (p1<=0)
states: 1,820 (3)
.-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EG [~ [A [[[~ [[[1<=p1 & 1<=p51] | AG [[1<=p0 & 1<=p18]]]] | [1<=p1 & 1<=p26]] | [[1<=p1 & 1<=p21] | [[1<=p12 & 1<=p18] | [1<=p1 & 1<=p26]]]] U ~ [EF [[1<=p0 & 1<=p18]]]]]]
normalized: EG [~ [[~ [EG [E [true U [1<=p0 & 1<=p18]]]] & ~ [E [E [true U [1<=p0 & 1<=p18]] U [~ [[[[[1<=p1 & 1<=p26] | [1<=p12 & 1<=p18]] | [1<=p1 & 1<=p21]] | [[1<=p1 & 1<=p26] | ~ [[~ [E [true U ~ [[1<=p0 & 1<=p18]]]] | [1<=p1 & 1<=p51]]]]]] & E [true U [1<=p0 & 1<=p18]]]]]]]]

abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p51)
states: 64
abstracting: (1<=p1)
states: 842
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 842
abstracting: (1<=p21)
states: 135
abstracting: (1<=p1)
states: 842
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p12)
states: 30
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 842
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EG [[[EG [[1<=p1 & 1<=p47]] & [p1<=0 | p45<=0]] | AF [[1<=p1 & 1<=p38]]]] | AG [~ [E [[[1<=p1 & 1<=p53] | [AG [[1<=p11 & 1<=p18]] | AX [[1<=p1 & 1<=p46]]]] U [A [[1<=p1 & 1<=p39] U [1<=p1 & 1<=p46]] & EX [[1<=p1 & 1<=p43]]]]]]]
normalized: [~ [E [true U E [[[~ [EX [~ [[1<=p1 & 1<=p46]]]] | ~ [E [true U ~ [[1<=p11 & 1<=p18]]]]] | [1<=p1 & 1<=p53]] U [EX [[1<=p1 & 1<=p43]] & [~ [EG [~ [[1<=p1 & 1<=p46]]]] & ~ [E [~ [[1<=p1 & 1<=p46]] U [~ [[1<=p1 & 1<=p39]] & ~ [[1<=p1 & 1<=p46]]]]]]]]]] | EG [[~ [EG [~ [[1<=p1 & 1<=p38]]]] | [[p1<=0 | p45<=0] & EG [[1<=p1 & 1<=p47]]]]]]

abstracting: (1<=p47)
states: 291
abstracting: (1<=p1)
states: 842
.........
EG iterations: 9
abstracting: (p45<=0)
states: 2,371 (3)
abstracting: (p1<=0)
states: 1,820 (3)
abstracting: (1<=p38)
states: 241
abstracting: (1<=p1)
states: 842
..
EG iterations: 2
.........
EG iterations: 9
abstracting: (1<=p46)
states: 85
abstracting: (1<=p1)
states: 842
abstracting: (1<=p39)
states: 85
abstracting: (1<=p1)
states: 842
abstracting: (1<=p46)
states: 85
abstracting: (1<=p1)
states: 842
abstracting: (1<=p46)
states: 85
abstracting: (1<=p1)
states: 842
..
EG iterations: 2
abstracting: (1<=p43)
states: 142
abstracting: (1<=p1)
states: 842
.abstracting: (1<=p53)
states: 888
abstracting: (1<=p1)
states: 842
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p11)
states: 30
abstracting: (1<=p46)
states: 85
abstracting: (1<=p1)
states: 842
.-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: [E [[p1<=0 | p26<=0] U [EG [[1<=p1 & 1<=p30]] & [A [[AX [[1<=p2 & 1<=p36]] | [[1<=p1 & 1<=p45] | [1<=p2 & 1<=p36]]] U E [[1<=p1 & 1<=p44] U ~ [[p1<=0 | p26<=0]]]] & [AX [AF [[1<=p1 & 1<=p20]]] | E [AX [[1<=p1 & 1<=p21]] U [[1<=p1 & 1<=p51] | [1<=p1 & 1<=p46]]]]]]] & AX [EF [EX [[1<=p1 & 1<=p43]]]]]
normalized: [~ [EX [~ [E [true U EX [[1<=p1 & 1<=p43]]]]]] & E [[p1<=0 | p26<=0] U [[[E [~ [EX [~ [[1<=p1 & 1<=p21]]]] U [[1<=p1 & 1<=p46] | [1<=p1 & 1<=p51]]] | ~ [EX [EG [~ [[1<=p1 & 1<=p20]]]]]] & [~ [EG [~ [E [[1<=p1 & 1<=p44] U ~ [[p1<=0 | p26<=0]]]]]] & ~ [E [~ [E [[1<=p1 & 1<=p44] U ~ [[p1<=0 | p26<=0]]]] U [~ [[[[1<=p2 & 1<=p36] | [1<=p1 & 1<=p45]] | ~ [EX [~ [[1<=p2 & 1<=p36]]]]]] & ~ [E [[1<=p1 & 1<=p44] U ~ [[p1<=0 | p26<=0]]]]]]]]] & EG [[1<=p1 & 1<=p30]]]]]

abstracting: (1<=p30)
states: 225
abstracting: (1<=p1)
states: 842
.......
EG iterations: 7
abstracting: (p26<=0)
states: 2,649 (3)
abstracting: (p1<=0)
states: 1,820 (3)
abstracting: (1<=p44)
states: 920
abstracting: (1<=p1)
states: 842
abstracting: (1<=p36)
states: 210
abstracting: (1<=p2)
states: 580
.abstracting: (1<=p45)
states: 291
abstracting: (1<=p1)
states: 842
abstracting: (1<=p36)
states: 210
abstracting: (1<=p2)
states: 580
abstracting: (p26<=0)
states: 2,649 (3)
abstracting: (p1<=0)
states: 1,820 (3)
abstracting: (1<=p44)
states: 920
abstracting: (1<=p1)
states: 842
abstracting: (p26<=0)
states: 2,649 (3)
abstracting: (p1<=0)
states: 1,820 (3)
abstracting: (1<=p44)
states: 920
abstracting: (1<=p1)
states: 842
..
EG iterations: 2
abstracting: (1<=p20)
states: 2
abstracting: (1<=p1)
states: 842
.
EG iterations: 1
.abstracting: (1<=p51)
states: 64
abstracting: (1<=p1)
states: 842
abstracting: (1<=p46)
states: 85
abstracting: (1<=p1)
states: 842
abstracting: (1<=p21)
states: 135
abstracting: (1<=p1)
states: 842
.abstracting: (p26<=0)
states: 2,649 (3)
abstracting: (p1<=0)
states: 1,820 (3)
abstracting: (1<=p43)
states: 142
abstracting: (1<=p1)
states: 842
..-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: E [[~ [AF [[[1<=p8 & 1<=p18] | [1<=p2 & 1<=p24]]]] | [EF [~ [E [[1<=p1 & 1<=p45] U [1<=p4 & 1<=p18]]]] | [[AG [[1<=p1 & 1<=p52]] & EF [[[1<=p1 & 1<=p32] | [1<=p1 & 1<=p53]]]] & [1<=p1 & 1<=p26]]]] U [AF [[1<=p1 & 1<=p49]] & [[E [[1<=p2 & 1<=p34] U [1<=p15 & 1<=p18]] & ~ [EF [[1<=p1 & 1<=p23]]]] | [[1<=p1 & 1<=p31] | [1<=p1 & 1<=p30]]]]]
normalized: E [[[[[1<=p1 & 1<=p26] & [E [true U [[1<=p1 & 1<=p53] | [1<=p1 & 1<=p32]]] & ~ [E [true U ~ [[1<=p1 & 1<=p52]]]]]] | E [true U ~ [E [[1<=p1 & 1<=p45] U [1<=p4 & 1<=p18]]]]] | EG [~ [[[1<=p2 & 1<=p24] | [1<=p8 & 1<=p18]]]]] U [[[[1<=p1 & 1<=p30] | [1<=p1 & 1<=p31]] | [~ [E [true U [1<=p1 & 1<=p23]]] & E [[1<=p2 & 1<=p34] U [1<=p15 & 1<=p18]]]] & ~ [EG [~ [[1<=p1 & 1<=p49]]]]]]

abstracting: (1<=p49)
states: 64
abstracting: (1<=p1)
states: 842
.
EG iterations: 1
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p15)
states: 20
abstracting: (1<=p34)
states: 210
abstracting: (1<=p2)
states: 580
abstracting: (1<=p23)
states: 327
abstracting: (1<=p1)
states: 842
abstracting: (1<=p31)
states: 85
abstracting: (1<=p1)
states: 842
abstracting: (1<=p30)
states: 225
abstracting: (1<=p1)
states: 842
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p8)
states: 0
abstracting: (1<=p24)
states: 538
abstracting: (1<=p2)
states: 580
.
EG iterations: 1
abstracting: (1<=p18)
states: 2,244 (3)
abstracting: (1<=p4)
states: 125
abstracting: (1<=p45)
states: 291
abstracting: (1<=p1)
states: 842
abstracting: (1<=p52)
states: 888
abstracting: (1<=p1)
states: 842
abstracting: (1<=p32)
states: 0
abstracting: (1<=p1)
states: 842
abstracting: (1<=p53)
states: 888
abstracting: (1<=p1)
states: 842
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 842
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m005-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

totally nodes used: 175467 (1.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 261080 798657 1059737
used/not used/entry size/cache size: 936803 66172061 16 1024MB
basic ops cache: hits/miss/sum: 57248 157803 215051
used/not used/entry size/cache size: 281489 16495727 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: 2578 7782 10360
used/not used/entry size/cache size: 7780 8380828 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 66948586
1 146677
2 12280
3 1184
4 108
5 9
6 6
7 2
8 5
9 1
>= 10 6

Total processing time: 0m 4.591sec


BK_STOP 1679183185420

--------------------
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:4417 (74), effective:221 (3)

initing FirstDep: 0m 0.000sec


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

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

iterations count:237 (4), effective:8 (0)

iterations count:1077 (18), effective:42 (0)

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

iterations count:65 (1), effective:3 (0)

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

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

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

iterations count:775 (13), effective:36 (0)

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

iterations count:92 (1), effective:5 (0)

iterations count:92 (1), effective:5 (0)

iterations count:279 (4), effective:12 (0)

iterations count:92 (1), effective:5 (0)

iterations count:1303 (22), effective:48 (0)

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

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

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

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

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

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

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

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

iterations count:184 (3), effective:6 (0)

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

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

iterations count:164 (2), effective:9 (0)

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

iterations count:1170 (19), effective:48 (0)

iterations count:157 (2), effective:3 (0)

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

iterations count:201 (3), effective:9 (0)

iterations count:1410 (23), effective:59 (1)

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-d0m005"
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-d0m005, 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-167889203700786"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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