About the Execution of Marcie+red for SieveSingleMsgMbox-PT-d0m18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6573.928 | 65446.00 | 74012.00 | 109.50 | FFTTTTTTTFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978800370.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d0m18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800370
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 10:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m18-CTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679351199643
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=SieveSingleMsgMbox-PT-d0m18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:26:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:26:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:26:41] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-20 22:26:41] [INFO ] Transformed 262 places.
[2023-03-20 22:26:41] [INFO ] Transformed 73 transitions.
[2023-03-20 22:26:41] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Support contains 58 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Applied a total of 2 rules in 11 ms. Remains 70 /72 variables (removed 2) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2023-03-20 22:26:41] [INFO ] Computed 5 place invariants in 14 ms
[2023-03-20 22:26:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-20 22:26:41] [INFO ] Invariant cache hit.
[2023-03-20 22:26:41] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:26:41] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-20 22:26:41] [INFO ] Invariant cache hit.
[2023-03-20 22:26:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 73/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 70/72 places, 73/73 transitions.
Support contains 58 out of 70 places after structural reductions.
[2023-03-20 22:26:41] [INFO ] Flatten gal took : 21 ms
[2023-03-20 22:26:41] [INFO ] Flatten gal took : 8 ms
[2023-03-20 22:26:41] [INFO ] Input system was already deterministic with 73 transitions.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 56) seen :24
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 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 44 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 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 55 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 114 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-20 22:26:42] [INFO ] Invariant cache hit.
[2023-03-20 22:26:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:26:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:26:42] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2 real:26
[2023-03-20 22:26:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:26:42] [INFO ] After 13ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :3 sat :0 real:28
[2023-03-20 22:26:42] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:28
[2023-03-20 22:26:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:26:43] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:26:43] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :26
[2023-03-20 22:26:43] [INFO ] After 200ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :5 sat :26
[2023-03-20 22:26:43] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 4 ms to minimize.
[2023-03-20 22:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-20 22:26:43] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :26
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-20 22:26:43] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :26
Fused 31 Parikh solutions to 26 different solutions.
Parikh walk visited 8 properties in 172 ms.
Support contains 23 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 66 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 66 transition count 69
Applied a total of 8 rules in 23 ms. Remains 66 /70 variables (removed 4) and now considering 69/73 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 66/70 places, 69/73 transitions.
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Finished probabilistic random walk after 78824 steps, run visited all 18 properties in 393 ms. (steps per millisecond=200 )
Probabilistic random walk after 78824 steps, saw 41997 distinct states, run finished after 393 ms. (steps per millisecond=200 ) properties seen :18
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:26:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 22:26:44] [INFO ] Flatten gal took : 10 ms
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:26:44] [INFO ] Flatten gal took : 6 ms
[2023-03-20 22:26:44] [INFO ] Input system was already deterministic with 73 transitions.
Computed a total of 10 stabilizing places and 13 stable transitions
Graph (complete) has 213 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 67
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 66
Applied a total of 14 rules in 4 ms. Remains 63 /70 variables (removed 7) and now considering 66/73 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/70 places, 66/73 transitions.
[2023-03-20 22:26:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:26:44] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:26:44] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 12 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 6 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 10 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 9 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 5 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 62/70 places, 65/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 4 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 61/70 places, 63/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 3 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 67
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 62 transition count 64
Applied a total of 17 rules in 3 ms. Remains 62 /70 variables (removed 8) and now considering 64/73 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/70 places, 64/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 68
Applied a total of 10 rules in 4 ms. Remains 65 /70 variables (removed 5) and now considering 68/73 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 65/70 places, 68/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 2 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 2 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/70 places, 63/73 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:26:45] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:26:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:26:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-20 22:26:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 73 transitions and 289 arcs took 0 ms.
Total runtime 4054 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: 70 NrTr: 73 NrArc: 289)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.217sec
RS generation: 0m13.368sec
-> reachability set: #nodes 48269 (4.8e+04) #states 136,672,787 (8)
starting MCC model checker
--------------------------
checking: EX [AF [AX [[1<=p1 & 1<=p41]]]]
normalized: EX [~ [EG [EX [~ [[1<=p1 & 1<=p41]]]]]]
abstracting: (1<=p41)
states: 4,799,599 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
..............................................................
EG iterations: 61
.-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.808sec
checking: E [[1<=p1 & 1<=p43] U ~ [AF [[[1<=p1 & 1<=p67] | AG [[1<=p1 & 1<=p36]]]]]]
normalized: E [[1<=p1 & 1<=p43] U EG [~ [[~ [E [true U ~ [[1<=p1 & 1<=p36]]]] | [1<=p1 & 1<=p67]]]]]
abstracting: (1<=p67)
states: 5,131,392 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p36)
states: 4,508,760 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
abstracting: (1<=p43)
states: 4,508,760 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.155sec
checking: EG [EF [[EG [EF [[1<=p1 & 1<=p25]]] | [EF [[p10<=0 | p23<=0]] & ~ [E [[1<=p1 & 1<=p39] U [1<=p1 & 1<=p62]]]]]]]
normalized: EG [E [true U [[~ [E [[1<=p1 & 1<=p39] U [1<=p1 & 1<=p62]]] & E [true U [p10<=0 | p23<=0]]] | EG [E [true U [1<=p1 & 1<=p25]]]]]]
abstracting: (1<=p25)
states: 2
abstracting: (1<=p1)
states: 24,186,548 (7)
....
EG iterations: 4
abstracting: (p23<=0)
states: 5,416,224 (6)
abstracting: (p10<=0)
states: 135,700,421 (8)
abstracting: (1<=p62)
states: 91,401,716 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p39)
states: 4,799,599 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.664sec
checking: AF [[AX [[EG [[p1<=0 | p46<=0]] & ~ [A [[1<=p13 & 1<=p23] U [1<=p2 & 1<=p56]]]]] | EF [[1<=p1 & 1<=p60]]]]
normalized: ~ [EG [~ [[E [true U [1<=p1 & 1<=p60]] | ~ [EX [~ [[~ [[~ [EG [~ [[1<=p2 & 1<=p56]]]] & ~ [E [~ [[1<=p2 & 1<=p56]] U [~ [[1<=p13 & 1<=p23]] & ~ [[1<=p2 & 1<=p56]]]]]]] & EG [[p1<=0 | p46<=0]]]]]]]]]]
abstracting: (p46<=0)
states: 45,426,983 (7)
abstracting: (p1<=0)
states: 112,486,239 (8)
..
EG iterations: 2
abstracting: (1<=p56)
states: 7,525,896 (6)
abstracting: (1<=p2)
states: 19,625,074 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p13)
states: 451,140 (5)
abstracting: (1<=p56)
states: 7,525,896 (6)
abstracting: (1<=p2)
states: 19,625,074 (7)
abstracting: (1<=p56)
states: 7,525,896 (6)
abstracting: (1<=p2)
states: 19,625,074 (7)
.
EG iterations: 1
.abstracting: (1<=p60)
states: 5,131,392 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
..........................................................
EG iterations: 58
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.039sec
checking: AX [EX [E [AG [~ [[1<=p1 & 1<=p25]]] U [AF [[1<=p1 & 1<=p26]] | [AG [[1<=p3 & 1<=p23]] | [1<=p4 & 1<=p23]]]]]]
normalized: ~ [EX [~ [EX [E [~ [E [true U [1<=p1 & 1<=p25]]] U [[~ [E [true U ~ [[1<=p3 & 1<=p23]]]] | [1<=p4 & 1<=p23]] | ~ [EG [~ [[1<=p1 & 1<=p26]]]]]]]]]]
abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 24,186,548 (7)
.
EG iterations: 1
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p4)
states: 3
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p25)
states: 2
abstracting: (1<=p1)
states: 24,186,548 (7)
..-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.108sec
checking: AF [EG [[E [[1<=p1 & 1<=p54] U [1<=p1 & 1<=p58]] | E [[~ [[1<=p1 & 1<=p69]] | EF [[1<=p21 & 1<=p42]]] U [1<=p1 & 1<=p47]]]]]
normalized: ~ [EG [~ [EG [[E [[E [true U [1<=p21 & 1<=p42]] | ~ [[1<=p1 & 1<=p69]]] U [1<=p1 & 1<=p47]] | E [[1<=p1 & 1<=p54] U [1<=p1 & 1<=p58]]]]]]]
abstracting: (1<=p58)
states: 5,131,392 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p54)
states: 2,264,652 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p69)
states: 90,954,564 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p42)
states: 8,082,842 (6)
abstracting: (1<=p21)
states: 16,314,840 (7)
................................................
EG iterations: 48
..
EG iterations: 2
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.099sec
checking: EF [AG [[~ [A [~ [[1<=p16 & 1<=p23]] U [1<=p1 & 1<=p38]]] & ~ [E [[[1<=p1 & 1<=p54] | [1<=p1 & 1<=p37]] U AG [[1<=p1 & 1<=p69]]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [[[1<=p1 & 1<=p37] | [1<=p1 & 1<=p54]] U ~ [E [true U ~ [[1<=p1 & 1<=p69]]]]]] & ~ [[~ [EG [~ [[1<=p1 & 1<=p38]]]] & ~ [E [~ [[1<=p1 & 1<=p38]] U [[1<=p16 & 1<=p23] & ~ [[1<=p1 & 1<=p38]]]]]]]]]]]]
abstracting: (1<=p38)
states: 40,719,108 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p16)
states: 911,232 (5)
abstracting: (1<=p38)
states: 40,719,108 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p38)
states: 40,719,108 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
abstracting: (1<=p69)
states: 90,954,564 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p54)
states: 2,264,652 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p37)
states: 40,719,108 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.516sec
checking: AX [[AF [E [[1<=p11 & 1<=p23] U [1<=p1 & 1<=p55]]] | [[1<=p21 & 1<=p42] | [AG [[p1<=0 | p47<=0]] & [1<=p1 & 1<=p28]]]]]
normalized: ~ [EX [~ [[[[[1<=p1 & 1<=p28] & ~ [E [true U ~ [[p1<=0 | p47<=0]]]]] | [1<=p21 & 1<=p42]] | ~ [EG [~ [E [[1<=p11 & 1<=p23] U [1<=p1 & 1<=p55]]]]]]]]]
abstracting: (1<=p55)
states: 37,918,153 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p11)
states: 972,366 (5)
..
EG iterations: 2
abstracting: (1<=p42)
states: 8,082,842 (6)
abstracting: (1<=p21)
states: 16,314,840 (7)
abstracting: (p47<=0)
states: 133,161,827 (8)
abstracting: (p1<=0)
states: 112,486,239 (8)
abstracting: (1<=p28)
states: 58
abstracting: (1<=p1)
states: 24,186,548 (7)
.-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.348sec
checking: EF [[EX [[[p21<=0 | p42<=0] & [EF [[1<=p1 & 1<=p58]] | [[1<=p1 & 1<=p49] | [1<=p1 & 1<=p24]]]]] & [AF [[p1<=0 | p49<=0]] & AG [[[p19<=0 | p23<=0] & ~ [E [[1<=p4 & 1<=p23] U [1<=p1 & 1<=p67]]]]]]]]
normalized: E [true U [[~ [E [true U ~ [[~ [E [[1<=p4 & 1<=p23] U [1<=p1 & 1<=p67]]] & [p19<=0 | p23<=0]]]]] & ~ [EG [~ [[p1<=0 | p49<=0]]]]] & EX [[[[[1<=p1 & 1<=p24] | [1<=p1 & 1<=p49]] | E [true U [1<=p1 & 1<=p58]]] & [p21<=0 | p42<=0]]]]]
abstracting: (p42<=0)
states: 128,589,945 (8)
abstracting: (p21<=0)
states: 120,357,947 (8)
abstracting: (1<=p58)
states: 5,131,392 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p49)
states: 4,799,599 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 24,186,548 (7)
.abstracting: (p49<=0)
states: 131,873,188 (8)
abstracting: (p1<=0)
states: 112,486,239 (8)
...................................
EG iterations: 35
abstracting: (p23<=0)
states: 5,416,224 (6)
abstracting: (p19<=0)
states: 135,761,555 (8)
abstracting: (1<=p67)
states: 5,131,392 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p4)
states: 3
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.197sec
checking: A [[[E [AF [~ [[p1<=0 | p46<=0]]] U [1<=p1 & 1<=p30]] | ~ [A [~ [[1<=p1 & 1<=p51]] U [1<=p22 & 1<=p66]]]] | [[1<=p1 & 1<=p59] | [1<=p1 & 1<=p27]]] U ~ [[EX [[1<=p5 & 1<=p33]] | [~ [[1<=p1 & 1<=p38]] | [[1<=p19 & 1<=p23] & [1<=p1 & 1<=p24]]]]]]
normalized: [~ [EG [[[[[1<=p1 & 1<=p24] & [1<=p19 & 1<=p23]] | ~ [[1<=p1 & 1<=p38]]] | EX [[1<=p5 & 1<=p33]]]]] & ~ [E [[[[[1<=p1 & 1<=p24] & [1<=p19 & 1<=p23]] | ~ [[1<=p1 & 1<=p38]]] | EX [[1<=p5 & 1<=p33]]] U [~ [[[~ [[~ [EG [~ [[1<=p22 & 1<=p66]]]] & ~ [E [~ [[1<=p22 & 1<=p66]] U [[1<=p1 & 1<=p51] & ~ [[1<=p22 & 1<=p66]]]]]]] | E [~ [EG [[p1<=0 | p46<=0]]] U [1<=p1 & 1<=p30]]] | [[1<=p1 & 1<=p27] | [1<=p1 & 1<=p59]]]] & [[[[1<=p1 & 1<=p24] & [1<=p19 & 1<=p23]] | ~ [[1<=p1 & 1<=p38]]] | EX [[1<=p5 & 1<=p33]]]]]]]
abstracting: (1<=p33)
states: 90,145,098 (7)
abstracting: (1<=p5)
states: 12,093,270 (7)
.abstracting: (1<=p38)
states: 40,719,108 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p19)
states: 911,232 (5)
abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p59)
states: 90,458,444 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p30)
states: 22
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (p46<=0)
states: 45,426,983 (7)
abstracting: (p1<=0)
states: 112,486,239 (8)
..
EG iterations: 2
abstracting: (1<=p66)
states: 7,525,896 (6)
abstracting: (1<=p22)
states: 16,314,840 (7)
abstracting: (1<=p51)
states: 2,264,652 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p66)
states: 7,525,896 (6)
abstracting: (1<=p22)
states: 16,314,840 (7)
abstracting: (1<=p66)
states: 7,525,896 (6)
abstracting: (1<=p22)
states: 16,314,840 (7)
.
EG iterations: 1
abstracting: (1<=p33)
states: 90,145,098 (7)
abstracting: (1<=p5)
states: 12,093,270 (7)
.abstracting: (1<=p38)
states: 40,719,108 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p19)
states: 911,232 (5)
abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p33)
states: 90,145,098 (7)
abstracting: (1<=p5)
states: 12,093,270 (7)
.abstracting: (1<=p38)
states: 40,719,108 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p19)
states: 911,232 (5)
abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.028sec
checking: [AF [[[[AF [[1<=p1 & 1<=p59]] | [p1<=0 | p44<=0]] & [EG [[1<=p8 & 1<=p23]] & [E [[1<=p13 & 1<=p23] U [1<=p14 & 1<=p40]] | [[1<=p1 & 1<=p32] | [1<=p1 & 1<=p67]]]]] & [1<=p1 & [1<=p31 & [p1<=0 | p67<=0]]]]] & AF [[1<=p1 & 1<=p55]]]
normalized: [~ [EG [~ [[1<=p1 & 1<=p55]]]] & ~ [EG [~ [[[1<=p1 & [1<=p31 & [p1<=0 | p67<=0]]] & [[[[[1<=p1 & 1<=p67] | [1<=p1 & 1<=p32]] | E [[1<=p13 & 1<=p23] U [1<=p14 & 1<=p40]]] & EG [[1<=p8 & 1<=p23]]] & [[p1<=0 | p44<=0] | ~ [EG [~ [[1<=p1 & 1<=p59]]]]]]]]]]]
abstracting: (1<=p59)
states: 90,458,444 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
abstracting: (p44<=0)
states: 132,164,027 (8)
abstracting: (p1<=0)
states: 112,486,239 (8)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p8)
states: 909,648 (5)
..
EG iterations: 2
abstracting: (1<=p40)
states: 8,082,842 (6)
abstracting: (1<=p14)
states: 7,611,042 (6)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p13)
states: 451,140 (5)
abstracting: (1<=p32)
states: 61,555,420 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p67)
states: 5,131,392 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (p67<=0)
states: 131,541,395 (8)
abstracting: (p1<=0)
states: 112,486,239 (8)
abstracting: (1<=p31)
states: 62,286,993 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
EG iterations: 0
abstracting: (1<=p55)
states: 37,918,153 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.911sec
checking: [AX [[[AG [~ [A [[1<=p34 & 1<=p1] U [1<=p10 & 1<=p23]]]] | AF [[1<=p1 & 1<=p31]]] & AF [AX [[p1<=0 | p59<=0]]]]] & EX [[AF [[[p1<=0 | p67<=0] & [p1<=0 | p27<=0]]] & ~ [A [[E [[1<=p14 & 1<=p40] U [1<=p1 & 1<=p39]] & [1<=p1 & 1<=p50]] U [A [[1<=p11 & 1<=p23] U [1<=p1 & 1<=p47]] | [1<=p1 & 1<=p27]]]]]]]
normalized: [EX [[~ [[~ [EG [~ [[[1<=p1 & 1<=p27] | [~ [EG [~ [[1<=p1 & 1<=p47]]]] & ~ [E [~ [[1<=p1 & 1<=p47]] U [~ [[1<=p11 & 1<=p23]] & ~ [[1<=p1 & 1<=p47]]]]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p27] | [~ [EG [~ [[1<=p1 & 1<=p47]]]] & ~ [E [~ [[1<=p1 & 1<=p47]] U [~ [[1<=p11 & 1<=p23]] & ~ [[1<=p1 & 1<=p47]]]]]]]] U [~ [[[1<=p1 & 1<=p50] & E [[1<=p14 & 1<=p40] U [1<=p1 & 1<=p39]]]] & ~ [[[1<=p1 & 1<=p27] | [~ [EG [~ [[1<=p1 & 1<=p47]]]] & ~ [E [~ [[1<=p1 & 1<=p47]] U [~ [[1<=p11 & 1<=p23]] & ~ [[1<=p1 & 1<=p47]]]]]]]]]]]]] & ~ [EG [~ [[[p1<=0 | p27<=0] & [p1<=0 | p67<=0]]]]]]] & ~ [EX [~ [[~ [EG [EX [~ [[p1<=0 | p59<=0]]]]] & [~ [EG [~ [[1<=p1 & 1<=p31]]]] | ~ [E [true U [~ [EG [~ [[1<=p10 & 1<=p23]]]] & ~ [E [~ [[1<=p10 & 1<=p23]] U [~ [[1<=p34 & 1<=p1]] & ~ [[1<=p10 & 1<=p23]]]]]]]]]]]]]]
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p10)
states: 972,366 (5)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p34)
states: 3,510,960 (6)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p10)
states: 972,366 (5)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p10)
states: 972,366 (5)
.
EG iterations: 1
abstracting: (1<=p31)
states: 62,286,993 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
abstracting: (p59<=0)
states: 46,214,343 (7)
abstracting: (p1<=0)
states: 112,486,239 (8)
...........................................................
EG iterations: 58
.abstracting: (p67<=0)
states: 131,541,395 (8)
abstracting: (p1<=0)
states: 112,486,239 (8)
abstracting: (p27<=0)
states: 136,672,779 (8)
abstracting: (p1<=0)
states: 112,486,239 (8)
................................
EG iterations: 32
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p11)
states: 972,366 (5)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p39)
states: 4,799,599 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p40)
states: 8,082,842 (6)
abstracting: (1<=p14)
states: 7,611,042 (6)
abstracting: (1<=p50)
states: 37,918,098 (7)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p11)
states: 972,366 (5)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p23)
states: 131,256,563 (8)
abstracting: (1<=p11)
states: 972,366 (5)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
abstracting: (1<=p47)
states: 3,510,960 (6)
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 24,186,548 (7)
..
EG iterations: 2
.-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.840sec
totally nodes used: 11273184 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 128041823 79505992 207547815
used/not used/entry size/cache size: 49075647 18033217 16 1024MB
basic ops cache: hits/miss/sum: 12442038 7950741 20392779
used/not used/entry size/cache size: 9145387 7631829 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: 424110 321865 745975
used/not used/entry size/cache size: 315850 8072758 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 57631890
1 8088653
2 1160982
3 179119
4 26648
5 5846
6 3328
7 2210
8 1596
9 1337
>= 10 7255
Total processing time: 0m59.636sec
BK_STOP 1679351265089
--------------------
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
60040
iterations count:170407 (2334), effective:9648 (132)
initing FirstDep: 0m 0.000sec
iterations count:133 (1), effective:4 (0)
iterations count:73 (1), effective:0 (0)
iterations count:76 (1), effective:2 (0)
iterations count:86 (1), effective:1 (0)
iterations count:73 (1), effective:0 (0)
iterations count:213 (2), effective:9 (0)
iterations count:119 (1), effective:1 (0)
iterations count:4922 (67), effective:146 (2)
iterations count:77 (1), effective:1 (0)
iterations count:76 (1), effective:2 (0)
iterations count:82 (1), effective:2 (0)
iterations count:73 (1), effective:0 (0)
iterations count:3435 (47), effective:102 (1)
iterations count:4131 (56), effective:139 (1)
iterations count:3943 (54), effective:108 (1)
iterations count:213 (2), effective:9 (0)
iterations count:1884 (25), effective:54 (0)
iterations count:1130 (15), effective:39 (0)
iterations count:87 (1), effective:1 (0)
iterations count:3328 (45), effective:99 (1)
iterations count:4687 (64), effective:134 (1)
iterations count:73 (1), effective:0 (0)
iterations count:4949 (67), effective:147 (2)
iterations count:29080 (398), effective:791 (10)
iterations count:73 (1), effective:0 (0)
iterations count:3339 (45), effective:98 (1)
iterations count:7863 (107), effective:221 (3)
iterations count:73 (1), effective:0 (0)
iterations count:133 (1), effective:4 (0)
iterations count:3319 (45), effective:96 (1)
iterations count:87 (1), effective:1 (0)
iterations count:73 (1), effective:0 (0)
iterations count:87 (1), effective:1 (0)
iterations count:106 (1), effective:2 (0)
iterations count:87 (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="SieveSingleMsgMbox-PT-d0m18"
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 SieveSingleMsgMbox-PT-d0m18, 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 r426-tajo-167905978800370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m18.tgz
mv SieveSingleMsgMbox-PT-d0m18 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 ;