About the Execution of Marcie+red for SieveSingleMsgMbox-PT-d0m36
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16103.632 | 3600000.00 | 3635856.00 | 2392.20 | F?TTFFTFFFFTFFFT | 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-167905978800378.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-d0m36, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800378
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 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-d0m36-CTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679351269163
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-d0m36
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:27:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:27:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:27:51] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-20 22:27:51] [INFO ] Transformed 262 places.
[2023-03-20 22:27:51] [INFO ] Transformed 73 transitions.
[2023-03-20 22:27:51] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Support contains 56 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 16 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:27:51] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-20 22:27:51] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-20 22:27:51] [INFO ] Invariant cache hit.
[2023-03-20 22:27:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:27:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-20 22:27:51] [INFO ] Invariant cache hit.
[2023-03-20 22:27:51] [INFO ] Dead Transitions using invariants and state equation in 45 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 327 ms. Remains : 70/72 places, 73/73 transitions.
Support contains 56 out of 70 places after structural reductions.
[2023-03-20 22:27:51] [INFO ] Flatten gal took : 23 ms
[2023-03-20 22:27:51] [INFO ] Flatten gal took : 9 ms
[2023-03-20 22:27:51] [INFO ] Input system was already deterministic with 73 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 56) seen :25
Incomplete Best-First random walk after 1001 steps, including 54 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 118 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 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 51 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) 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 30) seen :1
Running SMT prover for 29 properties.
[2023-03-20 22:27:52] [INFO ] Invariant cache hit.
[2023-03-20 22:27:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:27:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:27:52] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :5 sat :1 real:23
[2023-03-20 22:27:52] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:27:52] [INFO ] After 9ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :5 sat :0 real:24
[2023-03-20 22:27:52] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:24
[2023-03-20 22:27:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:27:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:27:53] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :22
[2023-03-20 22:27:53] [INFO ] After 123ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :7 sat :22
[2023-03-20 22:27:53] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :22
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-20 22:27:53] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :22
Fused 29 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 517 ms.
Support contains 31 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 70
Applied a total of 6 rules in 14 ms. Remains 67 /70 variables (removed 3) and now considering 70/73 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 67/70 places, 70/73 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 119 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 124 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Finished probabilistic random walk after 1802 steps, run visited all 20 properties in 30 ms. (steps per millisecond=60 )
Probabilistic random walk after 1802 steps, saw 925 distinct states, run finished after 30 ms. (steps per millisecond=60 ) properties seen :20
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 6 ms
[2023-03-20 22:27:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 6 ms
[2023-03-20 22:27:54] [INFO ] Input system was already deterministic with 73 transitions.
Support contains 50 out of 70 places (down from 51) after GAL structural reductions.
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 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 64 transition count 67
Iterating global reduction 0 with 1 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
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 63 transition count 65
Applied a total of 15 rules in 7 ms. Remains 63 /70 variables (removed 7) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 63/70 places, 65/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:54] [INFO ] Input system was already deterministic with 65 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 7 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 7 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 7 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [INFO ] Input system was already deterministic with 62 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
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:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:54] [INFO ] Input system was already deterministic with 66 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 7 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 7 ms. Remains : 61/70 places, 63/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:54] [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 5 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 5 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:54] [INFO ] Input system was already deterministic with 61 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 6 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 6 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [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 4 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 4 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [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 8 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 8 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 6 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [INFO ] Input system was already deterministic with 62 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
Applied a total of 14 rules in 1 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 1 ms. Remains : 63/70 places, 66/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [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
Applied a total of 18 rules in 4 ms. Remains 61 /70 variables (removed 9) and now considering 64/73 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 61/70 places, 64/73 transitions.
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:54] [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 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 7 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 61/70 places, 63/73 transitions.
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:55] [INFO ] Input system was already deterministic with 63 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 8 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 8 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:55] [INFO ] Input system was already deterministic with 62 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 3 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 3 ms. Remains : 61/70 places, 63/73 transitions.
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:55] [INFO ] Input system was already deterministic with 63 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 6 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 6 ms. Remains : 62/70 places, 64/73 transitions.
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 2 ms
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:27:55] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:55] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:27:55] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 22:27:55] [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 4105 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.270sec
RS generation: 2m39.542sec
-> reachability set: #nodes 203825 (2.0e+05) #states 20,650,118,726 (10)
starting MCC model checker
--------------------------
checking: AF [[EG [[1<=p1 & 1<=p32]] | [1<=p1 & 1<=p49]]]
normalized: ~ [EG [~ [[EG [[1<=p1 & 1<=p32]] | [1<=p1 & 1<=p49]]]]]
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p32)
states: 9,453,987,181 (9)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
........................................................................
EG iterations: 72
..
EG iterations: 2
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m30.423sec
checking: [AX [EX [EG [[p3<=0 | p23<=0]]]] & [EF [AX [1<=0]] | ~ [E [[1<=p13 & 1<=p23] U [1<=p20 & 1<=p23]]]]]
normalized: [[~ [E [[1<=p13 & 1<=p23] U [1<=p20 & 1<=p23]]] | E [true U ~ [EX [~ [1<=0]]]]] & ~ [EX [~ [EX [EG [[p3<=0 | p23<=0]]]]]]]
abstracting: (p23<=0)
states: 372,904,044 (8)
abstracting: (p3<=0)
states: 20,650,118,725 (10)
.
EG iterations: 1
..abstracting: (1<=0)
states: 0
.abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p20)
states: 148,652,352 (8)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p13)
states: 60,158,244 (7)
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.014sec
checking: EF [[AG [EX [A [[1<=p2 & 1<=p56] U [1<=p1 & 1<=p67]]]] & [1<=p5 & 1<=p33]]]
normalized: E [true U [[1<=p5 & 1<=p33] & ~ [E [true U ~ [EX [[~ [EG [~ [[1<=p1 & 1<=p67]]]] & ~ [E [~ [[1<=p1 & 1<=p67]] U [~ [[1<=p2 & 1<=p56]] & ~ [[1<=p1 & 1<=p67]]]]]]]]]]]]
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p56)
states: 1,198,241,328 (9)
abstracting: (1<=p2)
states: 3,002,027,056 (9)
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
.abstracting: (1<=p33)
states: 16,879,727,937 (10)
abstracting: (1<=p5)
states: 1,660,092,513 (9)
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.192sec
checking: AF [[EG [[AF [[1<=p1 & 1<=p52]] | [[1<=p1 & 1<=p39] | [1<=p1 & 1<=p28]]]] & [1<=p9 & 1<=p48]]]
normalized: ~ [EG [~ [[[1<=p9 & 1<=p48] & EG [[[[1<=p1 & 1<=p28] | [1<=p1 & 1<=p39]] | ~ [EG [~ [[1<=p1 & 1<=p52]]]]]]]]]]
abstracting: (1<=p52)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
abstracting: (1<=p39)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p28)
states: 58
abstracting: (1<=p1)
states: 3,320,185,034 (9)
....................................................................................
EG iterations: 84
abstracting: (1<=p48)
states: 1,284,044,004 (9)
abstracting: (1<=p9)
states: 1,146,482,670 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.363sec
checking: EF [[EF [[p9<=0 | p48<=0]] & AF [[EG [[1<=p7 & 1<=p23]] & [[1<=p1 & 1<=p60] | [1<=p21 & 1<=p42]]]]]]
normalized: E [true U [~ [EG [~ [[[[1<=p21 & 1<=p42] | [1<=p1 & 1<=p60]] & EG [[1<=p7 & 1<=p23]]]]]] & E [true U [p9<=0 | p48<=0]]]]
abstracting: (p48<=0)
states: 19,366,074,722 (10)
abstracting: (p9<=0)
states: 19,503,636,056 (10)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p7)
states: 90,239,094 (7)
..
EG iterations: 2
abstracting: (1<=p60)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p42)
states: 1,181,519,804 (9)
abstracting: (1<=p21)
states: 2,733,934,968 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.800sec
checking: A [[EX [AX [[[1<=p1 & 1<=p68] | [1<=p1 & 1<=p55]]]] & [EF [[1<=p1 & 1<=p68]] | [1<=p1 & 1<=p59]]] U [1<=p1 & 1<=p68]]
normalized: [~ [EG [~ [[1<=p1 & 1<=p68]]]] & ~ [E [~ [[1<=p1 & 1<=p68]] U [~ [[[[1<=p1 & 1<=p59] | E [true U [1<=p1 & 1<=p68]]] & EX [~ [EX [~ [[[1<=p1 & 1<=p55] | [1<=p1 & 1<=p68]]]]]]]] & ~ [[1<=p1 & 1<=p68]]]]]]
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p55)
states: 5,816,426,926 (9)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p59)
states: 16,938,300,086 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.781sec
checking: [E [[1<=p1 & 1<=p67] U AG [EF [[1<=p20 & 1<=p23]]]] | AG [AX [[~ [A [[1<=p1 & 1<=p29] U [1<=p1 & 1<=p51]]] & AG [[p1<=0 | p32<=0]]]]]]
normalized: [~ [E [true U EX [~ [[~ [E [true U ~ [[p1<=0 | p32<=0]]]] & ~ [[~ [EG [~ [[1<=p1 & 1<=p51]]]] & ~ [E [~ [[1<=p1 & 1<=p51]] U [~ [[1<=p1 & 1<=p29]] & ~ [[1<=p1 & 1<=p51]]]]]]]]]]]] | E [[1<=p1 & 1<=p67] U ~ [E [true U ~ [E [true U [1<=p20 & 1<=p23]]]]]]]
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p20)
states: 148,652,352 (8)
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p51)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p29)
states: 41,188,659 (7)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p51)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p51)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
abstracting: (p32<=0)
states: 11,196,131,545 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
.-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.587sec
checking: EF [AG [[[p1<=0 | p52<=0] & [[[1<=p1 & 1<=p50] | [1<=p17 & [1<=p23 & 1<=p3]]] & [[1<=p0 & 1<=p23] | [1<=p1 & 1<=p67]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[1<=p1 & 1<=p67] | [1<=p0 & 1<=p23]] & [[1<=p17 & [1<=p23 & 1<=p3]] | [1<=p1 & 1<=p50]]] & [p1<=0 | p52<=0]]]]]]
abstracting: (p52<=0)
states: 20,320,991,642 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
abstracting: (1<=p50)
states: 5,816,426,871 (9)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p17)
states: 148,652,352 (8)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.762sec
checking: EG [[EX [[[AF [[p1<=0 | p55<=0]] & [p1<=0 | p67<=0]] & [[p1<=0 | p39<=0] & [[p1<=0 | p50<=0] | [p1<=0 | p67<=0]]]]] | [1<=p1 & 1<=p26]]]
normalized: EG [[EX [[[[[p1<=0 | p67<=0] | [p1<=0 | p50<=0]] & [p1<=0 | p39<=0]] & [[p1<=0 | p67<=0] & ~ [EG [~ [[p1<=0 | p55<=0]]]]]]] | [1<=p1 & 1<=p26]]]
abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (p55<=0)
states: 14,833,691,800 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
.......................................................................
EG iterations: 71
abstracting: (p67<=0)
states: 19,740,004,550 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
abstracting: (p39<=0)
states: 20,052,587,356 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
abstracting: (p50<=0)
states: 14,833,691,855 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
abstracting: (p67<=0)
states: 19,740,004,550 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
.................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 1441995
after gc: idd nodes used:2639203, unused:61360797; list nodes free:597906857
...................MC time: 9m17.109sec
checking: A [[E [~ [[1<=p2 & 1<=p40]] U ~ [[p3<=0 | p23<=0]]] | [1<=p1 & 1<=p41]] U AX [~ [EG [[~ [[1<=p1 & 1<=p51]] | [[1<=p1 & 1<=p54] | [1<=p1 & 1<=p49]]]]]]]
normalized: [~ [EG [EX [EG [[[[1<=p1 & 1<=p49] | [1<=p1 & 1<=p54]] | ~ [[1<=p1 & 1<=p51]]]]]]] & ~ [E [EX [EG [[[[1<=p1 & 1<=p49] | [1<=p1 & 1<=p54]] | ~ [[1<=p1 & 1<=p51]]]]] U [~ [[[1<=p1 & 1<=p41] | E [~ [[1<=p2 & 1<=p40]] U ~ [[p3<=0 | p23<=0]]]]] & EX [EG [[[[1<=p1 & 1<=p49] | [1<=p1 & 1<=p54]] | ~ [[1<=p1 & 1<=p51]]]]]]]]]
abstracting: (1<=p51)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p54)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
.abstracting: (p23<=0)
states: 372,904,044 (8)
abstracting: (p3<=0)
states: 20,650,118,725 (10)
abstracting: (1<=p40)
states: 1,181,519,804 (9)
abstracting: (1<=p2)
states: 3,002,027,056 (9)
abstracting: (1<=p41)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p51)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p54)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
.abstracting: (1<=p51)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p54)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
..................................................................................................
EG iterations: 97
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m14.454sec
checking: [EF [AG [EX [EG [[p1<=0 | p37<=0]]]]] | ~ [E [[[A [EX [[1<=p20 & 1<=p23]] U ~ [EG [[1<=p1 & 1<=p69]]]] & EX [AX [[1<=p15 & 1<=p56]]]] & [1<=p10 & 1<=p23]] U AX [[AF [[1<=p1 & 1<=p46]] | AX [[1<=p1 & 1<=p51]]]]]]]
normalized: [~ [E [[[1<=p10 & 1<=p23] & [EX [~ [EX [~ [[1<=p15 & 1<=p56]]]]] & [~ [EG [EG [[1<=p1 & 1<=p69]]]] & ~ [E [EG [[1<=p1 & 1<=p69]] U [~ [EX [[1<=p20 & 1<=p23]]] & EG [[1<=p1 & 1<=p69]]]]]]]] U ~ [EX [~ [[~ [EX [~ [[1<=p1 & 1<=p51]]]] | ~ [EG [~ [[1<=p1 & 1<=p46]]]]]]]]]] | E [true U ~ [E [true U ~ [EX [EG [[p1<=0 | p37<=0]]]]]]]]
abstracting: (p37<=0)
states: 13,989,325,151 (10)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
..
EG iterations: 2
.abstracting: (1<=p46)
states: 16,967,343,612 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
abstracting: (1<=p51)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..abstracting: (1<=p69)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
.......................................................................
EG iterations: 71
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p20)
states: 148,652,352 (8)
.abstracting: (1<=p69)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
.......................................................................
EG iterations: 71
abstracting: (1<=p69)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
.......................................................................
EG iterations: 71
.
EG iterations: 1
abstracting: (1<=p56)
states: 1,198,241,328 (9)
abstracting: (1<=p15)
states: 1,046,570,100 (9)
..abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p10)
states: 109,023,216 (8)
-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m59.397sec
checking: [E [[EF [[1<=p1 & 1<=p67]] | [1<=p1 & 1<=p67]] U [~ [[[[[1<=p1 & 1<=p49] & [1<=p21 & 1<=p42]] | [[1<=p1 & 1<=p28] | [1<=p1 & 1<=p44]]] & ~ [[1<=p1 & 1<=p36]]]] | [1<=p7 & 1<=p23]]] & [EX [EG [EF [[1<=p1 & 1<=p26]]]] | AF [EX [A [[1<=p1 & 1<=p54] U [1<=p1 & 1<=p68]]]]]]
normalized: [[~ [EG [~ [EX [[~ [EG [~ [[1<=p1 & 1<=p68]]]] & ~ [E [~ [[1<=p1 & 1<=p68]] U [~ [[1<=p1 & 1<=p54]] & ~ [[1<=p1 & 1<=p68]]]]]]]]]] | EX [EG [E [true U [1<=p1 & 1<=p26]]]]] & E [[[1<=p1 & 1<=p67] | E [true U [1<=p1 & 1<=p67]]] U [[1<=p7 & 1<=p23] | ~ [[~ [[1<=p1 & 1<=p36]] & [[[1<=p1 & 1<=p44] | [1<=p1 & 1<=p28]] | [[1<=p21 & 1<=p42] & [1<=p1 & 1<=p49]]]]]]]]
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p42)
states: 1,181,519,804 (9)
abstracting: (1<=p21)
states: 2,733,934,968 (9)
abstracting: (1<=p28)
states: 58
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p44)
states: 586,796,208 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p36)
states: 586,796,208 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p7)
states: 90,239,094 (7)
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 3,320,185,034 (9)
.........
EG iterations: 9
.abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p54)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
...
EG iterations: 2
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m29.659sec
checking: E [[E [[[[1<=p19 & 1<=p23] | [1<=p23 & 1<=p0]] | [[[1<=p19 & 1<=p23] & [1<=p1 & 1<=p62]] | [1<=p5 & 1<=p33]]] U [[AF [[1<=p1 & 1<=p30]] & EF [[1<=p1 & 1<=p67]]] | [1<=p16 & 1<=p23]]] | ~ [[AF [~ [[1<=p11 & 1<=p23]]] | AG [[1<=p9 & 1<=p48]]]]] U EX [[AG [[[[1<=p1 & 1<=p69] & [1<=p1 & 1<=p54]] | ~ [[1<=p5 & 1<=p33]]]] & ~ [EG [~ [[1<=p1 & 1<=p65]]]]]]]
normalized: E [[~ [[~ [E [true U ~ [[1<=p9 & 1<=p48]]]] | ~ [EG [[1<=p11 & 1<=p23]]]]] | E [[[[1<=p5 & 1<=p33] | [[1<=p1 & 1<=p62] & [1<=p19 & 1<=p23]]] | [[1<=p23 & 1<=p0] | [1<=p19 & 1<=p23]]] U [[1<=p16 & 1<=p23] | [E [true U [1<=p1 & 1<=p67]] & ~ [EG [~ [[1<=p1 & 1<=p30]]]]]]]] U EX [[~ [EG [~ [[1<=p1 & 1<=p65]]]] & ~ [E [true U ~ [[~ [[1<=p5 & 1<=p33]] | [[1<=p1 & 1<=p54] & [1<=p1 & 1<=p69]]]]]]]]]
abstracting: (1<=p69)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p54)
states: 329,127,084 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p33)
states: 16,879,727,937 (10)
abstracting: (1<=p5)
states: 1,660,092,513 (9)
abstracting: (1<=p65)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
.abstracting: (1<=p30)
states: 22
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
abstracting: (1<=p67)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p16)
states: 148,652,352 (8)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p19)
states: 148,652,352 (8)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p19)
states: 148,652,352 (8)
abstracting: (1<=p62)
states: 16,983,018,224 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p33)
states: 16,879,727,937 (10)
abstracting: (1<=p5)
states: 1,660,092,513 (9)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p11)
states: 109,023,216 (8)
..
EG iterations: 2
abstracting: (1<=p48)
states: 1,284,044,004 (9)
abstracting: (1<=p9)
states: 1,146,482,670 (9)
-> the formula is FALSE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.294sec
checking: [~ [A [A [[1<=p19 & 1<=p23] U A [[1<=p21 & 1<=p42] U [1<=p1 & 1<=p68]]] U EG [A [~ [[1<=p1 & 1<=p36]] U [1<=p1 & 1<=p49]]]]] & [A [AF [[1<=p1 & 1<=p25]] U [[[1<=p1 & 1<=p49] | [1<=p1 & 1<=p34]] | [[1<=p1 & 1<=p64] | [1<=p0 & 1<=p23]]]] | [EF [[[p8<=0 | p23<=0] & [p1<=0 | p23<=0]]] | AX [EG [[[1<=p19 & 1<=p23] | [1<=p1 & 1<=p44]]]]]]]
normalized: [[[~ [EX [~ [EG [[[1<=p1 & 1<=p44] | [1<=p19 & 1<=p23]]]]]] | E [true U [[p1<=0 | p23<=0] & [p8<=0 | p23<=0]]]] | [~ [EG [~ [[[[1<=p0 & 1<=p23] | [1<=p1 & 1<=p64]] | [[1<=p1 & 1<=p34] | [1<=p1 & 1<=p49]]]]]] & ~ [E [~ [[[[1<=p0 & 1<=p23] | [1<=p1 & 1<=p64]] | [[1<=p1 & 1<=p34] | [1<=p1 & 1<=p49]]]] U [EG [~ [[1<=p1 & 1<=p25]]] & ~ [[[[1<=p0 & 1<=p23] | [1<=p1 & 1<=p64]] | [[1<=p1 & 1<=p34] | [1<=p1 & 1<=p49]]]]]]]]] & ~ [[~ [EG [~ [EG [[~ [EG [~ [[1<=p1 & 1<=p49]]]] & ~ [E [~ [[1<=p1 & 1<=p49]] U [[1<=p1 & 1<=p36] & ~ [[1<=p1 & 1<=p49]]]]]]]]]] & ~ [E [~ [EG [[~ [EG [~ [[1<=p1 & 1<=p49]]]] & ~ [E [~ [[1<=p1 & 1<=p49]] U [[1<=p1 & 1<=p36] & ~ [[1<=p1 & 1<=p49]]]]]]]] U [~ [[~ [EG [~ [[~ [EG [~ [[1<=p1 & 1<=p68]]]] & ~ [E [~ [[1<=p1 & 1<=p68]] U [~ [[1<=p21 & 1<=p42]] & ~ [[1<=p1 & 1<=p68]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p1 & 1<=p68]]]] & ~ [E [~ [[1<=p1 & 1<=p68]] U [~ [[1<=p21 & 1<=p42]] & ~ [[1<=p1 & 1<=p68]]]]]]] U [~ [[1<=p19 & 1<=p23]] & ~ [[~ [EG [~ [[1<=p1 & 1<=p68]]]] & ~ [E [~ [[1<=p1 & 1<=p68]] U [~ [[1<=p21 & 1<=p42]] & ~ [[1<=p1 & 1<=p68]]]]]]]]]]]] & ~ [EG [[~ [EG [~ [[1<=p1 & 1<=p49]]]] & ~ [E [~ [[1<=p1 & 1<=p49]] U [[1<=p1 & 1<=p36] & ~ [[1<=p1 & 1<=p49]]]]]]]]]]]]]]
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p36)
states: 586,796,208 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
.......................................................................................
EG iterations: 87
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p42)
states: 1,181,519,804 (9)
abstracting: (1<=p21)
states: 2,733,934,968 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p19)
states: 148,652,352 (8)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p42)
states: 1,181,519,804 (9)
abstracting: (1<=p21)
states: 2,733,934,968 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p42)
states: 1,181,519,804 (9)
abstracting: (1<=p21)
states: 2,733,934,968 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p68)
states: 16,948,815,312 (10)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p36)
states: 586,796,208 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
.......................................................................................
EG iterations: 87
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p36)
states: 586,796,208 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
..
EG iterations: 2
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p34)
states: 508,735,659 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p64)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p25)
states: 2
abstracting: (1<=p1)
states: 3,320,185,034 (9)
.
EG iterations: 1
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p34)
states: 508,735,659 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p64)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p49)
states: 597,531,370 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p34)
states: 508,735,659 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p64)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (p23<=0)
states: 372,904,044 (8)
abstracting: (p8<=0)
states: 20,543,315,546 (10)
abstracting: (p23<=0)
states: 372,904,044 (8)
abstracting: (p1<=0)
states: 17,329,933,692 (10)
abstracting: (1<=p23)
states: 20,277,214,682 (10)
abstracting: (1<=p19)
states: 148,652,352 (8)
abstracting: (1<=p44)
states: 586,796,208 (8)
abstracting: (1<=p1)
states: 3,320,185,034 (9)
.....................................................................
EG iterations: 69
.-> the formula is TRUE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 160936 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16176896 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
161755 331228 241738
iterations count:392275 (5373), effective:22356 (306)
initing FirstDep: 0m 0.000sec
iterations count:1154 (15), effective:41 (0)
iterations count:73 (1), effective:0 (0)
iterations count:83 (1), effective:1 (0)
iterations count:211 (2), effective:6 (0)
iterations count:121 (1), effective:1 (0)
iterations count:3041 (41), effective:89 (1)
iterations count:235 (3), effective:13 (0)
iterations count:4360 (59), effective:127 (1)
iterations count:1130 (15), effective:39 (0)
iterations count:230 (3), effective:10 (0)
iterations count:2874 (39), effective:89 (1)
iterations count:73 (1), effective:0 (0)
iterations count:107 (1), effective:3 (0)
net_ddint.h:600: Timeout: after 556 sec
iterations count:79 (1), effective:3 (0)
iterations count:154 (2), effective:7 (0)
iterations count:1078 (14), effective:35 (0)
iterations count:73 (1), effective:0 (0)
iterations count:5010 (68), effective:148 (2)
iterations count:184 (2), effective:9 (0)
iterations count:88 (1), effective:5 (0)
iterations count:96 (1), effective:2 (0)
iterations count:2722 (37), effective:85 (1)
iterations count:5010 (68), effective:148 (2)
iterations count:73 (1), effective:0 (0)
iterations count:121 (1), effective:1 (0)
iterations count:73 (1), effective:0 (0)
iterations count:2942 (40), effective:80 (1)
iterations count:102 (1), effective:1 (0)
iterations count:102 (1), effective:1 (0)
iterations count:134 (1), effective:1 (0)
iterations count:102 (1), effective:1 (0)
iterations count:2942 (40), effective:80 (1)
iterations count:203 (2), effective:6 (0)
iterations count:2942 (40), effective:80 (1)
iterations count:76 (1), effective:1 (0)
iterations count:279 (3), effective:15 (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-d0m36"
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-d0m36, 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-167905978800378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m36.tgz
mv SieveSingleMsgMbox-PT-d0m36 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 ;