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-167905979000458.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-d2m06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 10:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 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 1.1M 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-d2m06-CTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679355314301

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-d2m06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 23:35:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 23:35:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:35:16] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-20 23:35:16] [INFO ] Transformed 2398 places.
[2023-03-20 23:35:16] [INFO ] Transformed 1954 transitions.
[2023-03-20 23:35:16] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 1984 places in 14 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 71 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 929 place count 313 transition count 961
Iterating global reduction 1 with 76 rules applied. Total rules applied 1005 place count 313 transition count 961
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1020 place count 313 transition count 946
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1065 place count 268 transition count 901
Iterating global reduction 2 with 45 rules applied. Total rules applied 1110 place count 268 transition count 901
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 1135 place count 268 transition count 876
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1151 place count 252 transition count 858
Iterating global reduction 3 with 16 rules applied. Total rules applied 1167 place count 252 transition count 858
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 3 with 74 rules applied. Total rules applied 1241 place count 252 transition count 784
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1243 place count 250 transition count 782
Iterating global reduction 4 with 2 rules applied. Total rules applied 1245 place count 250 transition count 782
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1247 place count 248 transition count 780
Iterating global reduction 4 with 2 rules applied. Total rules applied 1249 place count 248 transition count 780
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1250 place count 247 transition count 778
Iterating global reduction 4 with 1 rules applied. Total rules applied 1251 place count 247 transition count 778
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1252 place count 246 transition count 777
Iterating global reduction 4 with 1 rules applied. Total rules applied 1253 place count 246 transition count 777
Applied a total of 1253 rules in 109 ms. Remains 246 /414 variables (removed 168) and now considering 777/1954 (removed 1177) transitions.
// Phase 1: matrix 777 rows 246 cols
[2023-03-20 23:35:16] [INFO ] Computed 5 place invariants in 27 ms
[2023-03-20 23:35:16] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-20 23:35:16] [INFO ] Invariant cache hit.
[2023-03-20 23:35:16] [INFO ] State equation strengthened by 592 read => feed constraints.
[2023-03-20 23:35:18] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
[2023-03-20 23:35:18] [INFO ] Invariant cache hit.
[2023-03-20 23:35:18] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 246/414 places, 777/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2095 ms. Remains : 246/414 places, 777/1954 transitions.
Support contains 71 out of 246 places after structural reductions.
[2023-03-20 23:35:18] [INFO ] Flatten gal took : 72 ms
[2023-03-20 23:35:18] [INFO ] Flatten gal took : 43 ms
[2023-03-20 23:35:18] [INFO ] Input system was already deterministic with 777 transitions.
Support contains 69 out of 246 places (down from 71) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 70) 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 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 70) seen :1
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 118 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) 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 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) 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 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) 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 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 69) 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 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Interrupted probabilistic random walk after 209201 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{0=1, 1=1, 3=1, 4=1, 6=1, 7=1, 9=1, 10=1, 11=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 26=1, 27=1, 28=1, 29=1, 30=1, 33=1, 34=1, 35=1, 37=1, 38=1, 39=1, 40=1, 42=1, 43=1, 44=1, 45=1, 48=1, 50=1, 54=1, 55=1, 56=1, 57=1, 58=1, 60=1, 64=1, 66=1, 67=1}
Probabilistic random walk after 209201 steps, saw 90828 distinct states, run finished after 3010 ms. (steps per millisecond=69 ) properties seen :47
Running SMT prover for 22 properties.
[2023-03-20 23:35:23] [INFO ] Invariant cache hit.
[2023-03-20 23:35:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:35:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-20 23:35:23] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-20 23:35:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:35:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 23:35:25] [INFO ] After 1278ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :14
[2023-03-20 23:35:25] [INFO ] State equation strengthened by 592 read => feed constraints.
[2023-03-20 23:35:28] [INFO ] After 3035ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :8 sat :14
[2023-03-20 23:35:28] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 6 ms to minimize.
[2023-03-20 23:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-20 23:35:31] [INFO ] After 5953ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :14
Attempting to minimize the solution found.
Minimization took 3084 ms.
[2023-03-20 23:35:34] [INFO ] After 10548ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :14
Fused 22 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 253 ms.
Support contains 18 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 777/777 transitions.
Graph (complete) has 1150 edges and 246 vertex of which 245 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 245 transition count 775
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 209 transition count 415
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 209 transition count 415
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 209 transition count 411
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 114 place count 174 transition count 372
Iterating global reduction 2 with 35 rules applied. Total rules applied 149 place count 174 transition count 372
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 173 place count 174 transition count 348
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 184 place count 163 transition count 333
Iterating global reduction 3 with 11 rules applied. Total rules applied 195 place count 163 transition count 333
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 207 place count 163 transition count 321
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 210 place count 160 transition count 317
Iterating global reduction 4 with 3 rules applied. Total rules applied 213 place count 160 transition count 317
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 216 place count 157 transition count 314
Iterating global reduction 4 with 3 rules applied. Total rules applied 219 place count 157 transition count 314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 220 place count 156 transition count 313
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 156 transition count 313
Applied a total of 221 rules in 85 ms. Remains 156 /246 variables (removed 90) and now considering 313/777 (removed 464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 156/246 places, 313/777 transitions.
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 455449 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 11=1, 12=1, 13=1}
Probabilistic random walk after 455449 steps, saw 178382 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :10
Running SMT prover for 4 properties.
// Phase 1: matrix 313 rows 156 cols
[2023-03-20 23:35:38] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-20 23:35:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:35:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-20 23:35:39] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 23:35:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:35:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:35:39] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 23:35:39] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-20 23:35:39] [INFO ] After 191ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 23:35:39] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2023-03-20 23:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-20 23:35:39] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-20 23:35:39] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 313/313 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 144 transition count 180
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 144 transition count 180
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 132 transition count 168
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 132 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 132 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 123 transition count 147
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 123 transition count 147
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 123 transition count 138
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 120 transition count 135
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 120 transition count 135
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 117 transition count 132
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 117 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 115 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 115 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 115 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 113 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 113 transition count 126
Applied a total of 101 rules in 40 ms. Remains 113 /156 variables (removed 43) and now considering 126/313 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 113/156 places, 126/313 transitions.
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 445 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Probably explored full state space saw : 75554 states, properties seen :0
Probabilistic random walk after 183050 steps, saw 75554 distinct states, run finished after 1275 ms. (steps per millisecond=143 ) properties seen :0
Explored full state space saw : 75554 states, properties seen :0
Exhaustive walk after 183050 steps, saw 75554 distinct states, run finished after 1022 ms. (steps per millisecond=179 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 23:35:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 23:35:42] [INFO ] Flatten gal took : 32 ms
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 23:35:42] [INFO ] Flatten gal took : 29 ms
[2023-03-20 23:35:42] [INFO ] Input system was already deterministic with 777 transitions.
Support contains 59 out of 246 places (down from 60) after GAL structural reductions.
Computed a total of 54 stabilizing places and 102 stable transitions
Graph (complete) has 1239 edges and 246 vertex of which 245 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 196 transition count 275
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 196 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 105 place count 196 transition count 270
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 152 place count 149 transition count 219
Iterating global reduction 1 with 47 rules applied. Total rules applied 199 place count 149 transition count 219
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 218 place count 149 transition count 200
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 239 place count 128 transition count 168
Iterating global reduction 2 with 21 rules applied. Total rules applied 260 place count 128 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 271 place count 128 transition count 157
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 277 place count 122 transition count 149
Iterating global reduction 3 with 6 rules applied. Total rules applied 283 place count 122 transition count 149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 289 place count 116 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 295 place count 116 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 299 place count 112 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 303 place count 112 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 305 place count 112 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 308 place count 109 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 311 place count 109 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 312 place count 108 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 313 place count 108 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 314 place count 107 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 315 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 316 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 317 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 318 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 105 transition count 128
Applied a total of 319 rules in 43 ms. Remains 105 /246 variables (removed 141) and now considering 128/777 (removed 649) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 105/246 places, 128/777 transitions.
[2023-03-20 23:35:42] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:42] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:42] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 201 transition count 336
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 201 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 95 place count 201 transition count 331
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 137 place count 159 transition count 285
Iterating global reduction 1 with 42 rules applied. Total rules applied 179 place count 159 transition count 285
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 201 place count 159 transition count 263
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 219 place count 141 transition count 237
Iterating global reduction 2 with 18 rules applied. Total rules applied 237 place count 141 transition count 237
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 249 place count 141 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 253 place count 137 transition count 219
Iterating global reduction 3 with 4 rules applied. Total rules applied 257 place count 137 transition count 219
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 261 place count 133 transition count 215
Iterating global reduction 3 with 4 rules applied. Total rules applied 265 place count 133 transition count 215
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 268 place count 130 transition count 212
Iterating global reduction 3 with 3 rules applied. Total rules applied 271 place count 130 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 273 place count 128 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 128 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 127 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 127 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 126 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 126 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 125 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 125 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 282 place count 124 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 124 transition count 204
Applied a total of 283 rules in 19 ms. Remains 124 /246 variables (removed 122) and now considering 204/777 (removed 573) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 124/246 places, 204/777 transitions.
[2023-03-20 23:35:42] [INFO ] Flatten gal took : 7 ms
[2023-03-20 23:35:42] [INFO ] Flatten gal took : 7 ms
[2023-03-20 23:35:42] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 206 transition count 399
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 206 transition count 399
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 85 place count 206 transition count 394
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 121 place count 170 transition count 354
Iterating global reduction 1 with 36 rules applied. Total rules applied 157 place count 170 transition count 354
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 177 place count 170 transition count 334
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 189 place count 158 transition count 317
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 158 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 212 place count 158 transition count 306
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 216 place count 154 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 220 place count 154 transition count 300
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 224 place count 150 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 150 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 230 place count 148 transition count 294
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 148 transition count 294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 233 place count 147 transition count 293
Iterating global reduction 3 with 1 rules applied. Total rules applied 234 place count 147 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 235 place count 146 transition count 292
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 146 transition count 292
Applied a total of 236 rules in 20 ms. Remains 146 /246 variables (removed 100) and now considering 292/777 (removed 485) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 146/246 places, 292/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 8 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 9 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 205 transition count 382
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 205 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 205 transition count 378
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 123 place count 168 transition count 339
Iterating global reduction 1 with 37 rules applied. Total rules applied 160 place count 168 transition count 339
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 181 place count 168 transition count 318
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 193 place count 156 transition count 301
Iterating global reduction 2 with 12 rules applied. Total rules applied 205 place count 156 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 209 place count 156 transition count 297
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 153 transition count 292
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 153 transition count 292
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 217 place count 151 transition count 290
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 151 transition count 290
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 220 place count 150 transition count 289
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 150 transition count 289
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 222 place count 149 transition count 288
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 149 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 224 place count 148 transition count 287
Iterating global reduction 3 with 1 rules applied. Total rules applied 225 place count 148 transition count 287
Applied a total of 225 rules in 18 ms. Remains 148 /246 variables (removed 98) and now considering 287/777 (removed 490) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 148/246 places, 287/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 8 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 8 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 200 transition count 307
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 200 transition count 307
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 200 transition count 303
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 137 place count 159 transition count 260
Iterating global reduction 1 with 41 rules applied. Total rules applied 178 place count 159 transition count 260
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 195 place count 159 transition count 243
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 212 place count 142 transition count 218
Iterating global reduction 2 with 17 rules applied. Total rules applied 229 place count 142 transition count 218
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 239 place count 142 transition count 208
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 139 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 139 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 248 place count 136 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 136 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 134 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 134 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 257 place count 132 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 132 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 260 place count 131 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 131 transition count 195
Applied a total of 261 rules in 17 ms. Remains 131 /246 variables (removed 115) and now considering 195/777 (removed 582) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 131/246 places, 195/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 7 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 7 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 198 transition count 305
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 198 transition count 305
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 101 place count 198 transition count 300
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 146 place count 153 transition count 251
Iterating global reduction 1 with 45 rules applied. Total rules applied 191 place count 153 transition count 251
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 210 place count 153 transition count 232
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 229 place count 134 transition count 204
Iterating global reduction 2 with 19 rules applied. Total rules applied 248 place count 134 transition count 204
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 259 place count 134 transition count 193
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 263 place count 130 transition count 187
Iterating global reduction 3 with 4 rules applied. Total rules applied 267 place count 130 transition count 187
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 271 place count 126 transition count 183
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 126 transition count 183
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 123 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 123 transition count 180
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 121 transition count 178
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 121 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 286 place count 120 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 120 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 288 place count 119 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 289 place count 119 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 290 place count 118 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 118 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 292 place count 117 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 117 transition count 172
Applied a total of 293 rules in 34 ms. Remains 117 /246 variables (removed 129) and now considering 172/777 (removed 605) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 117/246 places, 172/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 198 transition count 291
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 198 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 101 place count 198 transition count 286
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 144 place count 155 transition count 240
Iterating global reduction 1 with 43 rules applied. Total rules applied 187 place count 155 transition count 240
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 205 place count 155 transition count 222
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 220 place count 140 transition count 199
Iterating global reduction 2 with 15 rules applied. Total rules applied 235 place count 140 transition count 199
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 244 place count 140 transition count 190
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 137 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 137 transition count 186
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 134 transition count 183
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 134 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 133 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 133 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 132 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 132 transition count 181
Applied a total of 260 rules in 12 ms. Remains 132 /246 variables (removed 114) and now considering 181/777 (removed 596) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 132/246 places, 181/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 6 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 6 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 196 transition count 275
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 196 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 105 place count 196 transition count 270
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 152 place count 149 transition count 219
Iterating global reduction 1 with 47 rules applied. Total rules applied 199 place count 149 transition count 219
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 217 place count 149 transition count 201
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 238 place count 128 transition count 169
Iterating global reduction 2 with 21 rules applied. Total rules applied 259 place count 128 transition count 169
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 270 place count 128 transition count 158
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 276 place count 122 transition count 150
Iterating global reduction 3 with 6 rules applied. Total rules applied 282 place count 122 transition count 150
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 288 place count 116 transition count 144
Iterating global reduction 3 with 6 rules applied. Total rules applied 294 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 298 place count 112 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 302 place count 112 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 304 place count 112 transition count 138
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 307 place count 109 transition count 135
Iterating global reduction 4 with 3 rules applied. Total rules applied 310 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 311 place count 108 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 312 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 313 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 314 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 315 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 317 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 105 transition count 129
Applied a total of 318 rules in 30 ms. Remains 105 /246 variables (removed 141) and now considering 129/777 (removed 648) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 105/246 places, 129/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 129 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2755 steps, run visited all 1 properties in 8 ms. (steps per millisecond=344 )
Probabilistic random walk after 2755 steps, saw 1320 distinct states, run finished after 8 ms. (steps per millisecond=344 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 202 transition count 353
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 202 transition count 353
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 93 place count 202 transition count 348
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 134 place count 161 transition count 303
Iterating global reduction 1 with 41 rules applied. Total rules applied 175 place count 161 transition count 303
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 196 place count 161 transition count 282
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 145 transition count 259
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 145 transition count 259
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 240 place count 145 transition count 247
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 244 place count 141 transition count 241
Iterating global reduction 3 with 4 rules applied. Total rules applied 248 place count 141 transition count 241
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 137 transition count 237
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 137 transition count 237
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 258 place count 135 transition count 235
Iterating global reduction 3 with 2 rules applied. Total rules applied 260 place count 135 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 134 transition count 234
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 134 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 263 place count 133 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 133 transition count 233
Applied a total of 264 rules in 15 ms. Remains 133 /246 variables (removed 113) and now considering 233/777 (removed 544) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 133/246 places, 233/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 7 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 7 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 200 transition count 335
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 200 transition count 335
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 97 place count 200 transition count 330
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 139 place count 158 transition count 284
Iterating global reduction 1 with 42 rules applied. Total rules applied 181 place count 158 transition count 284
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 199 place count 158 transition count 266
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 217 place count 140 transition count 240
Iterating global reduction 2 with 18 rules applied. Total rules applied 235 place count 140 transition count 240
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 247 place count 140 transition count 228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 251 place count 136 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 255 place count 136 transition count 222
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 259 place count 132 transition count 218
Iterating global reduction 3 with 4 rules applied. Total rules applied 263 place count 132 transition count 218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 265 place count 130 transition count 216
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 130 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 129 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 129 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 128 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 128 transition count 214
Applied a total of 271 rules in 16 ms. Remains 128 /246 variables (removed 118) and now considering 214/777 (removed 563) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 128/246 places, 214/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 6 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 9 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 200 transition count 321
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 200 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 97 place count 200 transition count 316
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 140 place count 157 transition count 269
Iterating global reduction 1 with 43 rules applied. Total rules applied 183 place count 157 transition count 269
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 200 place count 157 transition count 252
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 217 place count 140 transition count 228
Iterating global reduction 2 with 17 rules applied. Total rules applied 234 place count 140 transition count 228
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 244 place count 140 transition count 218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 137 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 137 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 134 transition count 211
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 134 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 258 place count 132 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 260 place count 132 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 131 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 131 transition count 208
Applied a total of 262 rules in 12 ms. Remains 131 /246 variables (removed 115) and now considering 208/777 (removed 569) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 131/246 places, 208/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 6 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 200 transition count 321
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 200 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 97 place count 200 transition count 316
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 140 place count 157 transition count 269
Iterating global reduction 1 with 43 rules applied. Total rules applied 183 place count 157 transition count 269
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 203 place count 157 transition count 249
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 221 place count 139 transition count 223
Iterating global reduction 2 with 18 rules applied. Total rules applied 239 place count 139 transition count 223
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 250 place count 139 transition count 212
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 254 place count 135 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 135 transition count 206
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 262 place count 131 transition count 202
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 131 transition count 202
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 269 place count 128 transition count 199
Iterating global reduction 3 with 3 rules applied. Total rules applied 272 place count 128 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 274 place count 126 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 126 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 277 place count 125 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 278 place count 125 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 124 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 124 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 281 place count 123 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 123 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 283 place count 122 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 122 transition count 191
Applied a total of 284 rules in 17 ms. Remains 122 /246 variables (removed 124) and now considering 191/777 (removed 586) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 122/246 places, 191/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 5 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 191 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 204 transition count 381
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 204 transition count 381
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 89 place count 204 transition count 376
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 128 place count 165 transition count 333
Iterating global reduction 1 with 39 rules applied. Total rules applied 167 place count 165 transition count 333
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 180 place count 165 transition count 320
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 195 place count 150 transition count 300
Iterating global reduction 2 with 15 rules applied. Total rules applied 210 place count 150 transition count 300
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 222 place count 150 transition count 288
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 226 place count 146 transition count 282
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 146 transition count 282
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 234 place count 142 transition count 278
Iterating global reduction 3 with 4 rules applied. Total rules applied 238 place count 142 transition count 278
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 241 place count 139 transition count 275
Iterating global reduction 3 with 3 rules applied. Total rules applied 244 place count 139 transition count 275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 246 place count 137 transition count 273
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 137 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 136 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 136 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 135 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 135 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 134 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 134 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 255 place count 133 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 256 place count 133 transition count 267
Applied a total of 256 rules in 25 ms. Remains 133 /246 variables (removed 113) and now considering 267/777 (removed 510) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 133/246 places, 267/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 6 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 6 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 777/777 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 197 transition count 290
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 197 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 103 place count 197 transition count 285
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 149 place count 151 transition count 235
Iterating global reduction 1 with 46 rules applied. Total rules applied 195 place count 151 transition count 235
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 214 place count 151 transition count 216
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 234 place count 131 transition count 186
Iterating global reduction 2 with 20 rules applied. Total rules applied 254 place count 131 transition count 186
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 265 place count 131 transition count 175
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 270 place count 126 transition count 168
Iterating global reduction 3 with 5 rules applied. Total rules applied 275 place count 126 transition count 168
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 280 place count 121 transition count 163
Iterating global reduction 3 with 5 rules applied. Total rules applied 285 place count 121 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 117 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 117 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 296 place count 117 transition count 156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 299 place count 114 transition count 153
Iterating global reduction 4 with 3 rules applied. Total rules applied 302 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 303 place count 113 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 304 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 305 place count 112 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 306 place count 112 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 307 place count 111 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 308 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 309 place count 110 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 110 transition count 147
Applied a total of 310 rules in 21 ms. Remains 110 /246 variables (removed 136) and now considering 147/777 (removed 630) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 110/246 places, 147/777 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 3 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 4 ms
[2023-03-20 23:35:43] [INFO ] Input system was already deterministic with 147 transitions.
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 19 ms
[2023-03-20 23:35:43] [INFO ] Flatten gal took : 20 ms
[2023-03-20 23:35:43] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-20 23:35:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 246 places, 777 transitions and 3072 arcs took 4 ms.
Total runtime 27742 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: 246 NrTr: 777 NrArc: 3072)

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

net check time: 0m 0.000sec

init dd package: 0m 3.053sec


RS generation: 0m29.916sec


-> reachability set: #nodes 39674 (4.0e+04) #states 871,160 (5)



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

checking: AF [[1<=p239 & 1<=p1]]
normalized: ~ [EG [~ [[1<=p239 & 1<=p1]]]]

abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p239)
states: 800
..
EG iterations: 2
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.002sec

checking: EF [EG [[AX [[p1<=0 | p231<=0]] & [1<=p1 & 1<=p216]]]]
normalized: E [true U EG [[~ [EX [~ [[p1<=0 | p231<=0]]]] & [1<=p1 & 1<=p216]]]]

abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (p231<=0)
states: 870,360 (5)
abstracting: (p1<=0)
states: 738,206 (5)
.........
EG iterations: 8
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.086sec

checking: [E [[1<=p1 & 1<=p212] U ~ [[1<=p1 & 1<=p229]]] & EF [AG [[p1<=0 | p221<=0]]]]
normalized: [E [true U ~ [E [true U ~ [[p1<=0 | p221<=0]]]]] & E [[1<=p1 & 1<=p212] U ~ [[1<=p1 & 1<=p229]]]]

abstracting: (1<=p229)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p212)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (p221<=0)
states: 869,368 (5)
abstracting: (p1<=0)
states: 738,206 (5)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.457sec

checking: AF [[AF [[1<=p206 & 1<=p1]] | [[1<=p1 & 1<=p216] & [A [EX [[1<=p1 & 1<=p211]] U EG [[1<=p1 & 1<=p212]]] & [1<=p202 & [p21<=0 | p86<=0]]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[1<=p206 & 1<=p1]]]] | [[1<=p1 & 1<=p216] & [[~ [E [~ [EG [[1<=p1 & 1<=p212]]] U [~ [EG [[1<=p1 & 1<=p212]]] & ~ [EX [[1<=p1 & 1<=p211]]]]]] & ~ [EG [~ [EG [[1<=p1 & 1<=p212]]]]]] & [1<=p202 & [p21<=0 | p86<=0]]]]]]]]

abstracting: (p86<=0)
states: 100,328 (5)
abstracting: (p21<=0)
states: 867,704 (5)
abstracting: (1<=p202)
states: 28,504 (4)
abstracting: (1<=p212)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
........
EG iterations: 8

EG iterations: 0
abstracting: (1<=p211)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p212)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
........
EG iterations: 8
abstracting: (1<=p212)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
........
EG iterations: 8
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p206)
states: 3,104 (3)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.312sec

checking: EX [[[[[[1<=p1 & 1<=p87] | p235<=0] | p1<=0] & [[[[1<=p181 | 1<=p231] & 1<=p237] & 1<=p1] | [1<=p1 & 1<=p215]]] | AG [EF [[p232<=0 | p1<=0]]]]]
normalized: EX [[~ [E [true U ~ [E [true U [p232<=0 | p1<=0]]]]] | [[[1<=p1 & 1<=p215] | [1<=p1 & [1<=p237 & [1<=p181 | 1<=p231]]]] & [p1<=0 | [p235<=0 | [1<=p1 & 1<=p87]]]]]]

abstracting: (1<=p87)
states: 2
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (p235<=0)
states: 870,360 (5)
abstracting: (p1<=0)
states: 738,206 (5)
abstracting: (1<=p231)
states: 800
abstracting: (1<=p181)
states: 59,184 (4)
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p215)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (p1<=0)
states: 738,206 (5)
abstracting: (p232<=0)
states: 870,360 (5)
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: A [AG [[1<=p1 & 1<=p217]] U ~ [EX [[[AX [[1<=p1 & 1<=p101]] | EF [[1<=p1 & 1<=p226]]] | [[1<=p1 & 1<=p208] | [[1<=p1 & 1<=p209] | [1<=p1 & 1<=p239]]]]]]]
normalized: [~ [EG [EX [[[[[1<=p1 & 1<=p239] | [1<=p1 & 1<=p209]] | [1<=p1 & 1<=p208]] | [E [true U [1<=p1 & 1<=p226]] | ~ [EX [~ [[1<=p1 & 1<=p101]]]]]]]]] & ~ [E [EX [[[[[1<=p1 & 1<=p239] | [1<=p1 & 1<=p209]] | [1<=p1 & 1<=p208]] | [E [true U [1<=p1 & 1<=p226]] | ~ [EX [~ [[1<=p1 & 1<=p101]]]]]]] U [E [true U ~ [[1<=p1 & 1<=p217]]] & EX [[[[[1<=p1 & 1<=p239] | [1<=p1 & 1<=p209]] | [1<=p1 & 1<=p208]] | [E [true U [1<=p1 & 1<=p226]] | ~ [EX [~ [[1<=p1 & 1<=p101]]]]]]]]]]]

abstracting: (1<=p101)
states: 10,704 (4)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p226)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p208)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p209)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p239)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p217)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p101)
states: 10,704 (4)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p226)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p208)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p209)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p239)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p101)
states: 10,704 (4)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p226)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p208)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p209)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p239)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
...............
EG iterations: 14
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.615sec

checking: AG [[[EX [[p1<=0 | p228<=0]] | EF [AG [E [[1<=p1 & 1<=p237] U [1<=p1 & 1<=p210]]]]] | [[1<=p1 & 1<=p220] | [1<=p1 & [1<=p152 & [p1<=0 | p210<=0]]]]]]
normalized: ~ [E [true U ~ [[[E [true U ~ [E [true U ~ [E [[1<=p1 & 1<=p237] U [1<=p1 & 1<=p210]]]]]] | EX [[p1<=0 | p228<=0]]] | [[1<=p1 & [1<=p152 & [p1<=0 | p210<=0]]] | [1<=p1 & 1<=p220]]]]]]

abstracting: (1<=p220)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (p210<=0)
states: 869,368 (5)
abstracting: (p1<=0)
states: 738,206 (5)
abstracting: (1<=p152)
states: 1,478 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (p228<=0)
states: 870,360 (5)
abstracting: (p1<=0)
states: 738,206 (5)
.abstracting: (1<=p210)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.410sec

checking: [EF [[1<=p1 & 1<=p223]] & [EX [[1<=p53 & 1<=p155]] | AG [[[p1<=0 | [p118<=0 | [1<=p83 & 1<=p126]]] | [[1<=p1 & 1<=p231] | [[1<=p42 & 1<=p155] | [1<=p1 & 1<=p239]]]]]]]
normalized: [E [true U [1<=p1 & 1<=p223]] & [~ [E [true U ~ [[[[[1<=p42 & 1<=p155] | [1<=p1 & 1<=p239]] | [1<=p1 & 1<=p231]] | [p1<=0 | [p118<=0 | [1<=p83 & 1<=p126]]]]]]] | EX [[1<=p53 & 1<=p155]]]]

abstracting: (1<=p155)
states: 40,848 (4)
abstracting: (1<=p53)
states: 5,624 (3)
.abstracting: (1<=p126)
states: 15,856 (4)
abstracting: (1<=p83)
states: 18,084 (4)
abstracting: (p118<=0)
states: 853,384 (5)
abstracting: (p1<=0)
states: 738,206 (5)
abstracting: (1<=p231)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p239)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p155)
states: 40,848 (4)
abstracting: (1<=p42)
states: 6,104 (3)
abstracting: (1<=p223)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.525sec

checking: ~ [E [[~ [A [EG [[1<=p1 & 1<=p133]] U [[1<=p66 & 1<=p155] | [1<=p1 & 1<=p237]]]] & A [A [~ [[1<=p1 & 1<=p216]] U [1<=p1 & 1<=p198]] U AX [~ [[1<=p1 & 1<=p203]]]]] U [1<=p1 & 1<=p138]]]
normalized: ~ [E [[[~ [EG [EX [[1<=p1 & 1<=p203]]]] & ~ [E [EX [[1<=p1 & 1<=p203]] U [~ [[~ [EG [~ [[1<=p1 & 1<=p198]]]] & ~ [E [~ [[1<=p1 & 1<=p198]] U [[1<=p1 & 1<=p216] & ~ [[1<=p1 & 1<=p198]]]]]]] & EX [[1<=p1 & 1<=p203]]]]]] & ~ [[~ [EG [~ [[[1<=p1 & 1<=p237] | [1<=p66 & 1<=p155]]]]] & ~ [E [~ [[[1<=p1 & 1<=p237] | [1<=p66 & 1<=p155]]] U [~ [EG [[1<=p1 & 1<=p133]]] & ~ [[[1<=p1 & 1<=p237] | [1<=p66 & 1<=p155]]]]]]]]] U [1<=p1 & 1<=p138]]]

abstracting: (1<=p138)
states: 48,176 (4)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p155)
states: 40,848 (4)
abstracting: (1<=p66)
states: 6,096 (3)
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p133)
states: 50
abstracting: (1<=p1)
states: 132,954 (5)
.....
EG iterations: 5
abstracting: (1<=p155)
states: 40,848 (4)
abstracting: (1<=p66)
states: 6,096 (3)
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p155)
states: 40,848 (4)
abstracting: (1<=p66)
states: 6,096 (3)
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p203)
states: 28,504 (4)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p198)
states: 31,384 (4)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p198)
states: 31,384 (4)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p198)
states: 31,384 (4)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p203)
states: 28,504 (4)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p203)
states: 28,504 (4)
abstracting: (1<=p1)
states: 132,954 (5)
..........................
EG iterations: 25
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.537sec

checking: A [[1<=p1 & 1<=p225] U [AF [[1<=p1 & 1<=p231]] | ~ [[EF [[AG [[1<=p1 & 1<=p223]] & A [[1<=p1 & 1<=p230] U [1<=p1 & 1<=p207]]]] & [E [[[1<=p1 & 1<=p227] | [1<=p39 & 1<=p86]] U AF [[1<=p1 & 1<=p237]]] | EX [AF [[1<=p1 & 1<=p236]]]]]]]]
normalized: [~ [EG [~ [[~ [[[EX [~ [EG [~ [[1<=p1 & 1<=p236]]]]] | E [[[1<=p39 & 1<=p86] | [1<=p1 & 1<=p227]] U ~ [EG [~ [[1<=p1 & 1<=p237]]]]]] & E [true U [[~ [EG [~ [[1<=p1 & 1<=p207]]]] & ~ [E [~ [[1<=p1 & 1<=p207]] U [~ [[1<=p1 & 1<=p230]] & ~ [[1<=p1 & 1<=p207]]]]]] & ~ [E [true U ~ [[1<=p1 & 1<=p223]]]]]]]] | ~ [EG [~ [[1<=p1 & 1<=p231]]]]]]]] & ~ [E [~ [[~ [[[EX [~ [EG [~ [[1<=p1 & 1<=p236]]]]] | E [[[1<=p39 & 1<=p86] | [1<=p1 & 1<=p227]] U ~ [EG [~ [[1<=p1 & 1<=p237]]]]]] & E [true U [[~ [EG [~ [[1<=p1 & 1<=p207]]]] & ~ [E [~ [[1<=p1 & 1<=p207]] U [~ [[1<=p1 & 1<=p230]] & ~ [[1<=p1 & 1<=p207]]]]]] & ~ [E [true U ~ [[1<=p1 & 1<=p223]]]]]]]] | ~ [EG [~ [[1<=p1 & 1<=p231]]]]]] U [~ [[1<=p1 & 1<=p225]] & ~ [[~ [[[EX [~ [EG [~ [[1<=p1 & 1<=p236]]]]] | E [[[1<=p39 & 1<=p86] | [1<=p1 & 1<=p227]] U ~ [EG [~ [[1<=p1 & 1<=p237]]]]]] & E [true U [[~ [EG [~ [[1<=p1 & 1<=p207]]]] & ~ [E [~ [[1<=p1 & 1<=p207]] U [~ [[1<=p1 & 1<=p230]] & ~ [[1<=p1 & 1<=p207]]]]]] & ~ [E [true U ~ [[1<=p1 & 1<=p223]]]]]]]] | ~ [EG [~ [[1<=p1 & 1<=p231]]]]]]]]]]

abstracting: (1<=p231)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p223)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p230)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p227)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p86)
states: 770,832 (5)
abstracting: (1<=p39)
states: 448
abstracting: (1<=p236)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
.abstracting: (1<=p225)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p231)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p223)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p230)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p227)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p86)
states: 770,832 (5)
abstracting: (1<=p39)
states: 448
abstracting: (1<=p236)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
.abstracting: (1<=p231)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p223)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p230)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p237)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p227)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p86)
states: 770,832 (5)
abstracting: (1<=p39)
states: 448
abstracting: (1<=p236)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.253sec

checking: EX [EF [[[EG [[p1<=0 | p196<=0]] | EG [[p1<=0 | p132<=0]]] | [[1<=p1 & 1<=p214] | [[A [[1<=p1 & 1<=p214] U [1<=p1 & 1<=p207]] & A [[1<=p1 & 1<=p227] U [1<=p1 & 1<=p225]]] | [AG [[1<=p1 & 1<=p215]] & [EG [[1<=p1 & 1<=p214]] & [p1<=0 | p238<=0]]]]]]]]
normalized: EX [E [true U [[[[[[p1<=0 | p238<=0] & EG [[1<=p1 & 1<=p214]]] & ~ [E [true U ~ [[1<=p1 & 1<=p215]]]]] | [[~ [EG [~ [[1<=p1 & 1<=p225]]]] & ~ [E [~ [[1<=p1 & 1<=p225]] U [~ [[1<=p1 & 1<=p227]] & ~ [[1<=p1 & 1<=p225]]]]]] & [~ [EG [~ [[1<=p1 & 1<=p207]]]] & ~ [E [~ [[1<=p1 & 1<=p207]] U [~ [[1<=p1 & 1<=p214]] & ~ [[1<=p1 & 1<=p207]]]]]]]] | [1<=p1 & 1<=p214]] | [EG [[p1<=0 | p132<=0]] | EG [[p1<=0 | p196<=0]]]]]]

abstracting: (p196<=0)
states: 839,776 (5)
abstracting: (p1<=0)
states: 738,206 (5)
..
EG iterations: 2
abstracting: (p132<=0)
states: 851,408 (5)
abstracting: (p1<=0)
states: 738,206 (5)
..
EG iterations: 2
abstracting: (1<=p214)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p214)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p225)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p227)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p225)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p225)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p215)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p214)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
........
EG iterations: 8
abstracting: (p238<=0)
states: 870,360 (5)
abstracting: (p1<=0)
states: 738,206 (5)
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.727sec

checking: [E [[A [~ [[[1<=p108 & 1<=p1] | [1<=p1 & 1<=p207]]] U [E [[1<=p1 & 1<=p234] U [1<=p1 & 1<=p235]] | [1<=p1 & 1<=p216]]] | [1<=p214 & 1<=p1]] U [EG [AG [[1<=p174 & 1<=p1]]] & EX [E [[1<=p1 & 1<=p217] U [1<=p1 & 1<=p221]]]]] | [AX [A [[1<=p1 & 1<=p209] U AX [1<=0]]] | AX [EF [[1<=p1 & 1<=p134]]]]]
normalized: [[~ [EX [~ [E [true U [1<=p1 & 1<=p134]]]]] | ~ [EX [~ [[~ [EG [EX [~ [1<=0]]]] & ~ [E [EX [~ [1<=0]] U [~ [[1<=p1 & 1<=p209]] & EX [~ [1<=0]]]]]]]]]] | E [[[1<=p214 & 1<=p1] | [~ [EG [~ [[[1<=p1 & 1<=p216] | E [[1<=p1 & 1<=p234] U [1<=p1 & 1<=p235]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p216] | E [[1<=p1 & 1<=p234] U [1<=p1 & 1<=p235]]]] U [[[1<=p1 & 1<=p207] | [1<=p108 & 1<=p1]] & ~ [[[1<=p1 & 1<=p216] | E [[1<=p1 & 1<=p234] U [1<=p1 & 1<=p235]]]]]]]]] U [EX [E [[1<=p1 & 1<=p217] U [1<=p1 & 1<=p221]]] & EG [~ [E [true U ~ [[1<=p174 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p174)
states: 80,656 (4)
.
EG iterations: 1
abstracting: (1<=p221)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p217)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p235)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p234)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p108)
states: 0
abstracting: (1<=p207)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p235)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p234)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p235)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p234)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p214)
states: 3,104 (3)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p209)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=0)
states: 0
.abstracting: (1<=0)
states: 0
...................................
EG iterations: 34
.abstracting: (1<=p134)
states: 17,776 (4)
abstracting: (1<=p1)
states: 132,954 (5)
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.531sec

checking: A [[[[~ [[[[[1<=p1 & 1<=p127] | [1<=p1 & 1<=p216]] & ~ [[1<=p224 & 1<=p1]]] & EX [[1<=p1 & 1<=p211]]]] | E [AX [[1<=p1 & 1<=p216]] U [[1<=p86 & 1<=p12] | EG [[1<=p227 & 1<=p1]]]]] & ~ [[1<=p166 & 1<=p1]]] & [~ [[1<=p228 & 1<=p1]] & ~ [[[[[1<=p1 & 1<=p218] | [1<=p1 & 1<=p220]] & AG [[1<=p1 & 1<=p216]]] | [1<=p184 & 1<=p1]]]]] U [AG [EF [~ [E [[1<=p1 & 1<=p210] U [1<=p1 & 1<=p208]]]]] & [1<=p1 & 1<=p227]]]
normalized: [~ [EG [~ [[[1<=p1 & 1<=p227] & ~ [E [true U ~ [E [true U ~ [E [[1<=p1 & 1<=p210] U [1<=p1 & 1<=p208]]]]]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p227] & ~ [E [true U ~ [E [true U ~ [E [[1<=p1 & 1<=p210] U [1<=p1 & 1<=p208]]]]]]]]] U [~ [[[~ [[[~ [E [true U ~ [[1<=p1 & 1<=p216]]]] & [[1<=p1 & 1<=p220] | [1<=p1 & 1<=p218]]] | [1<=p184 & 1<=p1]]] & ~ [[1<=p228 & 1<=p1]]] & [~ [[1<=p166 & 1<=p1]] & [E [~ [EX [~ [[1<=p1 & 1<=p216]]]] U [EG [[1<=p227 & 1<=p1]] | [1<=p86 & 1<=p12]]] | ~ [[EX [[1<=p1 & 1<=p211]] & [~ [[1<=p224 & 1<=p1]] & [[1<=p1 & 1<=p216] | [1<=p1 & 1<=p127]]]]]]]]] & ~ [[[1<=p1 & 1<=p227] & ~ [E [true U ~ [E [true U ~ [E [[1<=p1 & 1<=p210] U [1<=p1 & 1<=p208]]]]]]]]]]]]]

abstracting: (1<=p208)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p210)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p227)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p127)
states: 0
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p224)
states: 3,104 (3)
abstracting: (1<=p211)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p12)
states: 1,728 (3)
abstracting: (1<=p86)
states: 770,832 (5)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p227)
states: 1,792 (3)
........
EG iterations: 8
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
.abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p166)
states: 196,944 (5)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p228)
states: 800
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p184)
states: 3,104 (3)
abstracting: (1<=p218)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p220)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p216)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p208)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p210)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p227)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p208)
states: 3,104 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p210)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
abstracting: (1<=p227)
states: 1,792 (3)
abstracting: (1<=p1)
states: 132,954 (5)
..
EG iterations: 2
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.235sec

totally nodes used: 21024509 (2.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 100543810 300168044 400711854
used/not used/entry size/cache size: 66511868 596996 16 1024MB
basic ops cache: hits/miss/sum: 7103096 16730511 23833607
used/not used/entry size/cache size: 14184591 2592625 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: 28288 129738 158026
used/not used/entry size/cache size: 128870 8259738 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 50745598
1 12654133
2 2924581
3 642677
4 120101
5 18904
6 2524
7 267
8 36
9 8
>= 10 35

Total processing time: 1m34.609sec


BK_STOP 1679355438521

--------------------
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

26190 30186 28760 31578 30367 31678 29734 31123 40798 40080
iterations count:1087463 (1399), effective:13987 (18)

initing FirstDep: 0m 0.000sec


iterations count:777 (1), effective:0 (0)
25026
iterations count:119762 (154), effective:859 (1)

iterations count:17910 (23), effective:138 (0)

iterations count:1108 (1), effective:4 (0)

iterations count:877 (1), effective:3 (0)
24157
iterations count:125128 (161), effective:891 (1)

iterations count:877 (1), effective:3 (0)
24157
iterations count:125128 (161), effective:891 (1)

iterations count:777 (1), effective:0 (0)
24157
iterations count:125128 (161), effective:891 (1)

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

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

iterations count:19662 (25), effective:168 (0)

iterations count:74771 (96), effective:549 (0)
24075
iterations count:100972 (129), effective:752 (0)

iterations count:777 (1), effective:0 (0)
24780
iterations count:121162 (155), effective:853 (1)

iterations count:2360 (3), effective:12 (0)

iterations count:74772 (96), effective:567 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:1793 (2), effective:13 (0)

iterations count:2695 (3), effective:28 (0)

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

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

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

iterations count:73353 (94), effective:556 (0)

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

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

iterations count:74962 (96), effective:551 (0)

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

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

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

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

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

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

iterations count:75912 (97), effective:522 (0)

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

iterations count:877 (1), effective:3 (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-d2m06"
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-d2m06, 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-167905979000458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m06.tgz
mv SieveSingleMsgMbox-PT-d2m06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;