About the Execution of Marcie+red for RingSingleMessageInMbox-PT-d0m010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5481.991 | 12222.00 | 20276.00 | 343.20 | FTTFFTFTTFTFTFFF | normal |
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-167889203700794.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-d0m010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700794
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.6K Feb 26 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 04:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 04:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 04:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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-d0m010-CTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679183313279
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-d0m010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:48:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:48:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:48:35] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-18 23:48:35] [INFO ] Transformed 385 places.
[2023-03-18 23:48:35] [INFO ] Transformed 59 transitions.
[2023-03-18 23:48:35] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 99 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:48:35] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-18 23:48:35] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-18 23:48:35] [INFO ] Invariant cache hit.
[2023-03-18 23:48:35] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:48:35] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-18 23:48:35] [INFO ] Invariant cache hit.
[2023-03-18 23:48:35] [INFO ] Dead Transitions using invariants and state equation in 49 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 380 ms. Remains : 54/56 places, 59/59 transitions.
Support contains 50 out of 54 places after structural reductions.
[2023-03-18 23:48:35] [INFO ] Flatten gal took : 22 ms
[2023-03-18 23:48:35] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:48:35] [INFO ] Input system was already deterministic with 59 transitions.
Incomplete random walk after 10000 steps, including 2168 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 65) seen :31
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 111 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-03-18 23:48:36] [INFO ] Invariant cache hit.
[2023-03-18 23:48:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 23:48:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-18 23:48:36] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:25
[2023-03-18 23:48:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:48:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:48:37] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :18
[2023-03-18 23:48:37] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:48:37] [INFO ] After 97ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :14 sat :18
[2023-03-18 23:48:37] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 4 ms to minimize.
[2023-03-18 23:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-18 23:48:37] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :18
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-18 23:48:37] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :18
Fused 32 Parikh solutions to 17 different solutions.
Parikh walk visited 6 properties in 33 ms.
Support contains 15 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 8 ms. Remains 50 /54 variables (removed 4) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 50/54 places, 53/59 transitions.
Incomplete random walk after 10000 steps, including 2146 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Probably explored full state space saw : 61659 states, properties seen :10
Probabilistic random walk after 166533 steps, saw 61659 distinct states, run finished after 239 ms. (steps per millisecond=696 ) properties seen :10
Explored full state space saw : 61659 states, properties seen :0
Exhaustive walk after 166533 steps, saw 61659 distinct states, run finished after 102 ms. (steps per millisecond=1632 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2023-03-18 23:48:38] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:48:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:48:38] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:48:38] [INFO ] Input system was already deterministic with 59 transitions.
Support contains 41 out of 54 places (down from 42) after GAL structural reductions.
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 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:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:48:38] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:38] [INFO ] Input system was already deterministic with 50 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 50 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 50 transition count 55
Applied a total of 8 rules in 2 ms. Remains 50 /54 variables (removed 4) and now considering 55/59 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/54 places, 55/59 transitions.
[2023-03-18 23:48:38] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:48:38] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:38] [INFO ] Input system was already deterministic with 55 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:48:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:38] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:38] [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 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:48:38] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:38] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:38] [INFO ] Input system was already deterministic with 50 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:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [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
Applied a total of 12 rules in 2 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 2 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [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 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:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [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 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Applied a total of 12 rules in 2 ms. Remains 48 /54 variables (removed 6) and now considering 51/59 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/54 places, 51/59 transitions.
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Input system was already deterministic with 51 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:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [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 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
Applied a total of 10 rules in 4 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 4 ms. Remains : 49/54 places, 54/59 transitions.
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [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:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [INFO ] Input system was already deterministic with 49 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 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 51
Applied a total of 12 rules in 3 ms. Remains 48 /54 variables (removed 6) and now considering 51/59 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/54 places, 51/59 transitions.
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Input system was already deterministic with 51 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 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Applied a total of 12 rules in 3 ms. Remains 48 /54 variables (removed 6) and now considering 51/59 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/54 places, 51/59 transitions.
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Input system was already deterministic with 51 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 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 6 ms. Remains 47 /54 variables (removed 7) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 47/54 places, 52/59 transitions.
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:48:39] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:48:39] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:48:39] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:48:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 59 transitions and 231 arcs took 1 ms.
Total runtime 4424 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.767sec
RS generation: 0m 0.088sec
-> reachability set: #nodes 3913 (3.9e+03) #states 62,547 (4)
starting MCC model checker
--------------------------
checking: AG [EF [AX [[p1<=0 | p45<=0]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [[p1<=0 | p45<=0]]]]]]]]
abstracting: (p45<=0)
states: 55,866 (4)
abstracting: (p1<=0)
states: 46,015 (4)
.-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.052sec
checking: EG [EX [~ [E [~ [AX [[1<=p1 & 1<=p27]]] U AF [[1<=p0 & 1<=p18]]]]]]
normalized: EG [EX [~ [E [EX [~ [[1<=p1 & 1<=p27]]] U ~ [EG [~ [[1<=p0 & 1<=p18]]]]]]]]
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
abstracting: (1<=p27)
states: 21,852 (4)
abstracting: (1<=p1)
states: 16,532 (4)
.........................
EG iterations: 23
-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.102sec
checking: AF [[EG [[p1<=0 | p46<=0]] | [1<=p1 & 1<=p51]]]
normalized: ~ [EG [~ [[[1<=p1 & 1<=p51] | EG [[p1<=0 | p46<=0]]]]]]
abstracting: (p46<=0)
states: 60,477 (4)
abstracting: (p1<=0)
states: 46,015 (4)
..
EG iterations: 2
abstracting: (1<=p51)
states: 3,024 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..................
EG iterations: 18
-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: AG [[AF [[1<=p1 & 1<=p30]] | EX [[p1<=0 | p50<=0]]]]
normalized: ~ [E [true U ~ [[EX [[p1<=0 | p50<=0]] | ~ [EG [~ [[1<=p1 & 1<=p30]]]]]]]]
abstracting: (1<=p30)
states: 6,150 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
abstracting: (p50<=0)
states: 59,523 (4)
abstracting: (p1<=0)
states: 46,015 (4)
.-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: E [~ [EX [[1<=p1 & 1<=p22]]] U [1<=p1 & 1<=p30]]
normalized: E [~ [EX [[1<=p1 & 1<=p22]]] U [1<=p1 & 1<=p30]]
abstracting: (1<=p30)
states: 6,150 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p22)
states: 21,852 (4)
abstracting: (1<=p1)
states: 16,532 (4)
.-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: EF [[[EX [[[p1<=0 | p26<=0] & [p1<=0 | p38<=0]]] & 1<=p1] & [1<=p51 & 1<=p48]]]
normalized: E [true U [[1<=p1 & EX [[[p1<=0 | p26<=0] & [p1<=0 | p38<=0]]]] & [1<=p51 & 1<=p48]]]
abstracting: (1<=p48)
states: 34,020 (4)
abstracting: (1<=p51)
states: 3,024 (3)
abstracting: (p38<=0)
states: 53,721 (4)
abstracting: (p1<=0)
states: 46,015 (4)
abstracting: (p26<=0)
states: 62,534 (4)
abstracting: (p1<=0)
states: 46,015 (4)
.abstracting: (1<=p1)
states: 16,532 (4)
-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: [AF [[[EF [[1<=p1 & 1<=p44]] & 1<=p1] & [1<=p49 & [1<=p1 & 1<=p51]]]] & AF [EG [[p1<=0 | p46<=0]]]]
normalized: [~ [EG [~ [EG [[p1<=0 | p46<=0]]]]] & ~ [EG [~ [[[1<=p49 & [1<=p1 & 1<=p51]] & [1<=p1 & E [true U [1<=p1 & 1<=p44]]]]]]]]
abstracting: (1<=p44)
states: 39,530 (4)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p51)
states: 3,024 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p49)
states: 3,024 (3)
EG iterations: 0
abstracting: (p46<=0)
states: 60,477 (4)
abstracting: (p1<=0)
states: 46,015 (4)
..
EG iterations: 2
..................
EG iterations: 18
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: [AG [[1<=p4 & 1<=p18]] | [AG [[AX [1<=0] & [[p1<=0 | p51<=0] & AG [[1<=p1 & 1<=p51]]]]] | EF [[1<=p17 & 1<=p36]]]]
normalized: [[E [true U [1<=p17 & 1<=p36]] | ~ [E [true U ~ [[[~ [E [true U ~ [[1<=p1 & 1<=p51]]]] & [p1<=0 | p51<=0]] & ~ [EX [~ [1<=0]]]]]]]] | ~ [E [true U ~ [[1<=p4 & 1<=p18]]]]]
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p4)
states: 1,575 (3)
abstracting: (1<=0)
states: 0
.abstracting: (p51<=0)
states: 59,523 (4)
abstracting: (p1<=0)
states: 46,015 (4)
abstracting: (1<=p51)
states: 3,024 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p36)
states: 5,820 (3)
abstracting: (1<=p17)
states: 10,608 (4)
-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: EG [[EF [[[1<=p1 & 1<=p29] | [[1<=p1 & 1<=p26] | [1<=p1 & 1<=p22]]]] & [p1<=0 | p22<=0]]]
normalized: EG [[[p1<=0 | p22<=0] & E [true U [[[1<=p1 & 1<=p22] | [1<=p1 & 1<=p26]] | [1<=p1 & 1<=p29]]]]]
abstracting: (1<=p29)
states: 1,839 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p22)
states: 21,852 (4)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (p22<=0)
states: 40,695 (4)
abstracting: (p1<=0)
states: 46,015 (4)
................................................
EG iterations: 48
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.158sec
checking: E [[~ [AX [[A [[1<=p2 & 1<=p36] U [1<=p11 & 1<=p18]] | EF [[1<=p0 & 1<=p18]]]]] | [1<=p16 & 1<=p18]] U AG [[1<=p1 & 1<=p31]]]
normalized: E [[[1<=p16 & 1<=p18] | EX [~ [[E [true U [1<=p0 & 1<=p18]] | [~ [EG [~ [[1<=p11 & 1<=p18]]]] & ~ [E [~ [[1<=p11 & 1<=p18]] U [~ [[1<=p2 & 1<=p36]] & ~ [[1<=p11 & 1<=p18]]]]]]]]]] U ~ [E [true U ~ [[1<=p1 & 1<=p31]]]]]
abstracting: (1<=p31)
states: 2,070 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p11)
states: 660
abstracting: (1<=p36)
states: 5,820 (3)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p11)
states: 660
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p11)
states: 660
.
EG iterations: 1
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p0)
states: 1
.abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p16)
states: 840
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [[~ [A [[~ [EG [[1<=p27 & 1<=p1]]] | [~ [[1<=p1 & 1<=p19]] & [[1<=p2 & 1<=p24] | [1<=p5 & 1<=p28]]]] U ~ [AF [[1<=p1 & 1<=p45]]]]] & AF [[p1<=0 | p21<=0]]]]
normalized: E [true U [~ [EG [~ [[p1<=0 | p21<=0]]]] & ~ [[~ [EG [~ [EG [~ [[1<=p1 & 1<=p45]]]]]] & ~ [E [~ [EG [~ [[1<=p1 & 1<=p45]]]] U [~ [[[[[1<=p5 & 1<=p28] | [1<=p2 & 1<=p24]] & ~ [[1<=p1 & 1<=p19]]] | ~ [EG [[1<=p27 & 1<=p1]]]]] & ~ [EG [~ [[1<=p1 & 1<=p45]]]]]]]]]]]
abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p27)
states: 21,852 (4)
..................
EG iterations: 18
abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p28)
states: 7,470 (3)
abstracting: (1<=p5)
states: 6,570 (3)
abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
.......................
EG iterations: 23
abstracting: (p21<=0)
states: 59,277 (4)
abstracting: (p1<=0)
states: 46,015 (4)
..................
EG iterations: 18
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.105sec
checking: E [~ [EG [~ [[AX [[1<=p7 & 1<=p18]] & [1<=p1 & 1<=p45]]]]] U AG [[[~ [EG [[1<=p1 & 1<=p26]]] & ~ [EF [[1<=p10 & 1<=p34]]]] & [~ [[[1<=p1 & 1<=p35] | [1<=p1 & 1<=p51]]] & E [[1<=p1 & 1<=p23] U [1<=p13 & 1<=p24]]]]]]
normalized: E [~ [EG [~ [[[1<=p1 & 1<=p45] & ~ [EX [~ [[1<=p7 & 1<=p18]]]]]]]] U ~ [E [true U ~ [[[E [[1<=p1 & 1<=p23] U [1<=p13 & 1<=p24]] & ~ [[[1<=p1 & 1<=p51] | [1<=p1 & 1<=p35]]]] & [~ [E [true U [1<=p10 & 1<=p34]]] & ~ [EG [[1<=p1 & 1<=p26]]]]]]]]]
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 16,532 (4)
...
EG iterations: 3
abstracting: (1<=p34)
states: 5,820 (3)
abstracting: (1<=p10)
states: 2,580 (3)
abstracting: (1<=p35)
states: 0
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p51)
states: 3,024 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p13)
states: 2,190 (3)
abstracting: (1<=p23)
states: 4,902 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p7)
states: 660
.abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: AG [A [[A [[~ [[1<=p1 & 1<=p18]] | EF [[1<=p2 & 1<=p36]]] U ~ [A [[1<=p7 & 1<=p18] U [1<=p2 & 1<=p24]]]] | [1<=p2 & 1<=p36]] U [1<=p1 & [1<=p43 & [~ [[1<=p2 & [1<=p34 & ~ [[1<=p0 & 1<=p18]]]]] | [A [[1<=p1 & 1<=p45] U [1<=p1 & 1<=p38]] & E [[1<=p6 & 1<=p18] U ~ [[p15<=0 | p18<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[1<=p1 & [1<=p43 & [[E [[1<=p6 & 1<=p18] U ~ [[p15<=0 | p18<=0]]] & [~ [EG [~ [[1<=p1 & 1<=p38]]]] & ~ [E [~ [[1<=p1 & 1<=p38]] U [~ [[1<=p1 & 1<=p45]] & ~ [[1<=p1 & 1<=p38]]]]]]] | ~ [[1<=p2 & [1<=p34 & ~ [[1<=p0 & 1<=p18]]]]]]]]]]] & ~ [E [~ [[1<=p1 & [1<=p43 & [[E [[1<=p6 & 1<=p18] U ~ [[p15<=0 | p18<=0]]] & [~ [EG [~ [[1<=p1 & 1<=p38]]]] & ~ [E [~ [[1<=p1 & 1<=p38]] U [~ [[1<=p1 & 1<=p45]] & ~ [[1<=p1 & 1<=p38]]]]]]] | ~ [[1<=p2 & [1<=p34 & ~ [[1<=p0 & 1<=p18]]]]]]]]] U [~ [[[1<=p2 & 1<=p36] | [~ [EG [[~ [EG [~ [[1<=p2 & 1<=p24]]]] & ~ [E [~ [[1<=p2 & 1<=p24]] U [~ [[1<=p7 & 1<=p18]] & ~ [[1<=p2 & 1<=p24]]]]]]]] & ~ [E [[~ [EG [~ [[1<=p2 & 1<=p24]]]] & ~ [E [~ [[1<=p2 & 1<=p24]] U [~ [[1<=p7 & 1<=p18]] & ~ [[1<=p2 & 1<=p24]]]]]] U [~ [[E [true U [1<=p2 & 1<=p36]] | ~ [[1<=p1 & 1<=p18]]]] & [~ [EG [~ [[1<=p2 & 1<=p24]]]] & ~ [E [~ [[1<=p2 & 1<=p24]] U [~ [[1<=p7 & 1<=p18]] & ~ [[1<=p2 & 1<=p24]]]]]]]]]]]] & ~ [[1<=p1 & [1<=p43 & [[E [[1<=p6 & 1<=p18] U ~ [[p15<=0 | p18<=0]]] & [~ [EG [~ [[1<=p1 & 1<=p38]]]] & ~ [E [~ [[1<=p1 & 1<=p38]] U [~ [[1<=p1 & 1<=p45]] & ~ [[1<=p1 & 1<=p38]]]]]]] | ~ [[1<=p2 & [1<=p34 & ~ [[1<=p0 & 1<=p18]]]]]]]]]]]]]]]]
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p34)
states: 5,820 (3)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
abstracting: (p18<=0)
states: 3,453 (3)
abstracting: (p15<=0)
states: 61,707 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p6)
states: 570
abstracting: (1<=p43)
states: 1,827 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p7)
states: 660
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
.
EG iterations: 1
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p36)
states: 5,820 (3)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p7)
states: 660
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
.
EG iterations: 1
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p7)
states: 660
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p24)
states: 10,713 (4)
abstracting: (1<=p2)
states: 16,070 (4)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p36)
states: 5,820 (3)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p34)
states: 5,820 (3)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
abstracting: (p18<=0)
states: 3,453 (3)
abstracting: (p15<=0)
states: 61,707 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p6)
states: 570
abstracting: (1<=p43)
states: 1,827 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p34)
states: 5,820 (3)
abstracting: (1<=p2)
states: 16,070 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p38)
states: 8,826 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
abstracting: (p18<=0)
states: 3,453 (3)
abstracting: (p15<=0)
states: 61,707 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p6)
states: 570
abstracting: (1<=p43)
states: 1,827 (3)
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: A [[E [~ [[[[[1<=p1 & 1<=p44] | [1<=p1 & 1<=p22]] & [[1<=p1 & 1<=p31] | [1<=p1 & 1<=p53]]] | AF [[1<=p1 & 1<=p19]]]] U [~ [E [[1<=p16 & 1<=p18] U [1<=p1 & 1<=p40]]] | [EG [[1<=p1 & 1<=p43]] & EX [~ [[p1<=0 | p21<=0]]]]]] | [EF [[EG [[1<=p1 & 1<=p44]] & A [[1<=p1 & 1<=p19] U [1<=p1 & 1<=p39]]]] | [1<=p1 & 1<=p47]]] U [EX [0<=0] | [1<=p1 & 1<=p45]]]
normalized: [~ [EG [~ [[[1<=p1 & 1<=p45] | EX [0<=0]]]]] & ~ [E [~ [[[1<=p1 & 1<=p45] | EX [0<=0]]] U [~ [[[[1<=p1 & 1<=p47] | E [true U [[~ [EG [~ [[1<=p1 & 1<=p39]]]] & ~ [E [~ [[1<=p1 & 1<=p39]] U [~ [[1<=p1 & 1<=p19]] & ~ [[1<=p1 & 1<=p39]]]]]] & EG [[1<=p1 & 1<=p44]]]]] | E [~ [[~ [EG [~ [[1<=p1 & 1<=p19]]]] | [[[1<=p1 & 1<=p53] | [1<=p1 & 1<=p31]] & [[1<=p1 & 1<=p22] | [1<=p1 & 1<=p44]]]]] U [[EX [~ [[p1<=0 | p21<=0]]] & EG [[1<=p1 & 1<=p43]]] | ~ [E [[1<=p16 & 1<=p18] U [1<=p1 & 1<=p40]]]]]]] & ~ [[[1<=p1 & 1<=p45] | EX [0<=0]]]]]]]
abstracting: (0<=0)
states: 62,547 (4)
.abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p40)
states: 2,070 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p18)
states: 59,094 (4)
abstracting: (1<=p16)
states: 840
abstracting: (1<=p43)
states: 1,827 (3)
abstracting: (1<=p1)
states: 16,532 (4)
...................
EG iterations: 19
abstracting: (p21<=0)
states: 59,277 (4)
abstracting: (p1<=0)
states: 46,015 (4)
.abstracting: (1<=p44)
states: 39,530 (4)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p22)
states: 21,852 (4)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p31)
states: 2,070 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p53)
states: 39,368 (4)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 16,532 (4)
..
EG iterations: 2
abstracting: (1<=p44)
states: 39,530 (4)
abstracting: (1<=p1)
states: 16,532 (4)
...................
EG iterations: 19
abstracting: (1<=p39)
states: 2,070 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p39)
states: 2,070 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (1<=p39)
states: 2,070 (3)
abstracting: (1<=p1)
states: 16,532 (4)
.
EG iterations: 1
abstracting: (1<=p47)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (0<=0)
states: 62,547 (4)
.abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
abstracting: (0<=0)
states: 62,547 (4)
.abstracting: (1<=p45)
states: 6,681 (3)
abstracting: (1<=p1)
states: 16,532 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.104sec
totally nodes used: 433462 (4.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1984872 2133404 4118276
used/not used/entry size/cache size: 2441321 64667543 16 1024MB
basic ops cache: hits/miss/sum: 315711 361766 677477
used/not used/entry size/cache size: 633177 16144039 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: 18104 21348 39452
used/not used/entry size/cache size: 21333 8367275 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 66719338
1 353256
2 31323
3 3923
4 555
5 126
6 108
7 48
8 83
9 9
>= 10 95
Total processing time: 0m 5.380sec
BK_STOP 1679183325501
--------------------
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:10667 (180), effective:526 (8)
initing FirstDep: 0m 0.001sec
iterations count:144 (2), effective:6 (0)
iterations count:59 (1), effective:0 (0)
iterations count:775 (13), effective:36 (0)
iterations count:1115 (18), effective:41 (0)
iterations count:1605 (27), effective:63 (1)
iterations count:517 (8), effective:21 (0)
iterations count:69 (1), effective:1 (0)
iterations count:85 (1), effective:3 (0)
iterations count:59 (1), effective:0 (0)
iterations count:1185 (20), effective:48 (0)
iterations count:1405 (23), effective:49 (0)
iterations count:78 (1), effective:2 (0)
iterations count:68 (1), effective:1 (0)
iterations count:59 (1), effective:0 (0)
iterations count:1183 (20), effective:48 (0)
iterations count:59 (1), effective:0 (0)
iterations count:59 (1), effective:0 (0)
iterations count:73 (1), effective:2 (0)
iterations count:59 (1), effective:0 (0)
iterations count:90 (1), effective:1 (0)
iterations count:1135 (19), effective:43 (0)
iterations count:90 (1), effective:1 (0)
iterations count:90 (1), effective:1 (0)
iterations count:73 (1), effective:2 (0)
iterations count:59 (1), effective:0 (0)
iterations count:73 (1), effective:2 (0)
iterations count:59 (1), effective:0 (0)
iterations count:129 (2), effective:5 (0)
iterations count:59 (1), effective:0 (0)
iterations count:78 (1), effective:2 (0)
iterations count:61 (1), effective:1 (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-d0m010"
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-d0m010, 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-167889203700794"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m010.tgz
mv RingSingleMessageInMbox-PT-d0m010 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 '
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 ;