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.r423-tajo-167905976700436.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 lolaxred
Input is SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976700436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 19K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:29 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 450K 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-d1m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679247384526

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:36:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:36:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:36:26] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-19 17:36:26] [INFO ] Transformed 1295 places.
[2023-03-19 17:36:26] [INFO ] Transformed 749 transitions.
[2023-03-19 17:36:26] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 393
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 393
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 357 place count 196 transition count 385
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 385 place count 168 transition count 357
Iterating global reduction 2 with 28 rules applied. Total rules applied 413 place count 168 transition count 357
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 420 place count 168 transition count 350
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 434 place count 154 transition count 335
Iterating global reduction 3 with 14 rules applied. Total rules applied 448 place count 154 transition count 335
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 493 place count 154 transition count 290
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 495 place count 152 transition count 287
Iterating global reduction 4 with 2 rules applied. Total rules applied 497 place count 152 transition count 287
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 499 place count 150 transition count 285
Iterating global reduction 4 with 2 rules applied. Total rules applied 501 place count 150 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 502 place count 149 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 503 place count 149 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 148 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 148 transition count 283
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 506 place count 147 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 147 transition count 282
Applied a total of 507 rules in 82 ms. Remains 147 /259 variables (removed 112) and now considering 282/749 (removed 467) transitions.
// Phase 1: matrix 282 rows 147 cols
[2023-03-19 17:36:26] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-19 17:36:26] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-19 17:36:26] [INFO ] Invariant cache hit.
[2023-03-19 17:36:26] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-19 17:36:27] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2023-03-19 17:36:27] [INFO ] Invariant cache hit.
[2023-03-19 17:36:27] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/259 places, 282/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1103 ms. Remains : 147/259 places, 282/749 transitions.
Support contains 24 out of 147 places after structural reductions.
[2023-03-19 17:36:27] [INFO ] Flatten gal took : 41 ms
[2023-03-19 17:36:27] [INFO ] Flatten gal took : 18 ms
[2023-03-19 17:36:27] [INFO ] Input system was already deterministic with 282 transitions.
Incomplete random walk after 10000 steps, including 2198 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 116 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 117 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 220649 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{0=1, 2=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 13=1, 18=1, 19=1, 20=1, 21=1}
Probabilistic random walk after 220649 steps, saw 103125 distinct states, run finished after 3003 ms. (steps per millisecond=73 ) properties seen :14
Running SMT prover for 8 properties.
[2023-03-19 17:36:31] [INFO ] Invariant cache hit.
[2023-03-19 17:36:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:36:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:36:32] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:36:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:36:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:36:32] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:36:32] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-19 17:36:32] [INFO ] After 400ms SMT Verify possible using 178 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 17:36:32] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 7 ms to minimize.
[2023-03-19 17:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-19 17:36:33] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-03-19 17:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-19 17:36:33] [INFO ] After 1173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 542 ms.
[2023-03-19 17:36:34] [INFO ] After 2127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 1 properties in 190 ms.
Support contains 9 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 282/282 transitions.
Graph (complete) has 512 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 146 transition count 280
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 134 transition count 195
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 134 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 134 transition count 193
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 38 place count 125 transition count 184
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 125 transition count 184
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 56 place count 125 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 122 transition count 172
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 122 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 122 transition count 170
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 121 transition count 169
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 121 transition count 169
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 120 transition count 168
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 120 transition count 168
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 119 transition count 167
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 119 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 75 place count 119 transition count 162
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 118 transition count 161
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 118 transition count 161
Applied a total of 77 rules in 49 ms. Remains 118 /147 variables (removed 29) and now considering 161/282 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 118/147 places, 161/282 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1034 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 382034 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 382034 steps, saw 163868 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 161 rows 118 cols
[2023-03-19 17:36:38] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 17:36:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:36:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:36:38] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 17:36:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:36:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 17:36:38] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 17:36:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-19 17:36:38] [INFO ] After 195ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 17:36:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2023-03-19 17:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-19 17:36:39] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-19 17:36:39] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 230 ms.
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 161/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 116 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 116 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 115 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 115 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 114 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 155
Applied a total of 9 rules in 27 ms. Remains 114 /118 variables (removed 4) and now considering 155/161 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 114/118 places, 155/161 transitions.
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 445931 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 445931 steps, saw 190791 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 155 rows 114 cols
[2023-03-19 17:36:43] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 17:36:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:36:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:36:43] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:36:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:36:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:36:43] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:36:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-19 17:36:43] [INFO ] After 179ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 17:36:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-03-19 17:36:43] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2023-03-19 17:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-19 17:36:44] [INFO ] After 593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-19 17:36:44] [INFO ] After 907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 213 ms.
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 155/155 transitions.
Applied a total of 0 rules in 13 ms. Remains 114 /114 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 114/114 places, 155/155 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 155/155 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2023-03-19 17:36:44] [INFO ] Invariant cache hit.
[2023-03-19 17:36:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-19 17:36:44] [INFO ] Invariant cache hit.
[2023-03-19 17:36:44] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-19 17:36:44] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-19 17:36:44] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 17:36:44] [INFO ] Invariant cache hit.
[2023-03-19 17:36:45] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 114/114 places, 155/155 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 114 transition count 150
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 110 transition count 150
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 9 place count 110 transition count 132
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 45 place count 92 transition count 132
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 65 place count 82 transition count 122
Applied a total of 65 rules in 19 ms. Remains 82 /114 variables (removed 32) and now considering 122/155 (removed 33) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 122 rows 82 cols
[2023-03-19 17:36:45] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 17:36:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:36:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:36:45] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:36:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:36:45] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:36:45] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-19 17:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-19 17:36:45] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2023-03-19 17:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-19 17:36:45] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-19 17:36:45] [INFO ] After 512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 32 stabilizing places and 52 stable transitions
Graph (complete) has 566 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 173
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 118 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 109 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 109 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 109 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 105 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 105 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 102 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 102 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 100 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 95 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 93 transition count 122
Applied a total of 119 rules in 32 ms. Remains 93 /147 variables (removed 54) and now considering 122/282 (removed 160) transitions.
// Phase 1: matrix 122 rows 93 cols
[2023-03-19 17:36:46] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 17:36:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 17:36:46] [INFO ] Invariant cache hit.
[2023-03-19 17:36:46] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-19 17:36:46] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-19 17:36:46] [INFO ] Invariant cache hit.
[2023-03-19 17:36:46] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/147 places, 122/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 93/147 places, 122/282 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s17 1) (LT s28 1)) (OR (LT s1 1) (LT s88 1)) (OR (LT s1 1) (LT s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22468 reset in 437 ms.
Product exploration explored 100000 steps with 22303 reset in 176 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1034 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 12 ms. (steps per millisecond=311 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 13 ms. (steps per millisecond=287 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-19 17:36:48] [INFO ] Invariant cache hit.
[2023-03-19 17:36:48] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-19 17:36:48] [INFO ] Invariant cache hit.
[2023-03-19 17:36:48] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-19 17:36:48] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-19 17:36:48] [INFO ] Invariant cache hit.
[2023-03-19 17:36:48] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 93/93 places, 122/122 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1042 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 31 ms. (steps per millisecond=120 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 31 ms. (steps per millisecond=120 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22488 reset in 171 ms.
Product exploration explored 100000 steps with 22460 reset in 179 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 12 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-19 17:36:50] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:36:50] [INFO ] Invariant cache hit.
[2023-03-19 17:36:50] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 93/93 places, 122/122 transitions.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-19 17:36:50] [INFO ] Invariant cache hit.
[2023-03-19 17:36:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 17:36:50] [INFO ] Invariant cache hit.
[2023-03-19 17:36:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-19 17:36:50] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-19 17:36:50] [INFO ] Invariant cache hit.
[2023-03-19 17:36:50] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 93/93 places, 122/122 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 finished in 4796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&(!p0 U X((p2 U p0))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 71 place count 118 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 109 transition count 148
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 109 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 109 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 105 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 105 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 102 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 102 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 100 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 100 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 98 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 98 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 96 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 95 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 94 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 93 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 127
Applied a total of 123 rules in 23 ms. Remains 93 /147 variables (removed 54) and now considering 127/282 (removed 155) transitions.
// Phase 1: matrix 127 rows 93 cols
[2023-03-19 17:36:50] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:36:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 17:36:50] [INFO ] Invariant cache hit.
[2023-03-19 17:36:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-19 17:36:51] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-19 17:36:51] [INFO ] Invariant cache hit.
[2023-03-19 17:36:51] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/147 places, 127/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 93/147 places, 127/282 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s87 1)), p0:(AND (GEQ s1 1) (GEQ s86 1)), p2:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 finished in 711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p0||F(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 163
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 149
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 149
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 116 transition count 140
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 107 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 107 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 107 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 103 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 103 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 97 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 97 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 95 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 94 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 94 transition count 111
Applied a total of 122 rules in 33 ms. Remains 94 /147 variables (removed 53) and now considering 111/282 (removed 171) transitions.
// Phase 1: matrix 111 rows 94 cols
[2023-03-19 17:36:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:36:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 17:36:51] [INFO ] Invariant cache hit.
[2023-03-19 17:36:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:36:51] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-19 17:36:51] [INFO ] Invariant cache hit.
[2023-03-19 17:36:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/147 places, 111/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 94/147 places, 111/282 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s10 1) (GEQ s29 1)), p1:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p2))&&(!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 110 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 107 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 101 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 96 transition count 132
Applied a total of 115 rules in 20 ms. Remains 96 /147 variables (removed 51) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 96 cols
[2023-03-19 17:36:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:36:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 17:36:52] [INFO ] Invariant cache hit.
[2023-03-19 17:36:52] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 17:36:52] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-19 17:36:52] [INFO ] Invariant cache hit.
[2023-03-19 17:36:52] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/147 places, 132/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 96/147 places, 132/282 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND p0 (NOT p1)), true, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s89 1))) (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 30996 reset in 267 ms.
Product exploration explored 100000 steps with 30904 reset in 246 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 483 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1852 ms. (steps per millisecond=629 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1853 ms. (steps per millisecond=629 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 568 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-19 17:36:56] [INFO ] Invariant cache hit.
[2023-03-19 17:36:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-19 17:36:56] [INFO ] Invariant cache hit.
[2023-03-19 17:36:56] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 17:36:57] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-19 17:36:57] [INFO ] Invariant cache hit.
[2023-03-19 17:36:57] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 96/96 places, 132/132 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1613 ms. (steps per millisecond=723 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1613 ms. (steps per millisecond=723 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22461 reset in 183 ms.
Product exploration explored 100000 steps with 22356 reset in 167 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 103 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 24 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-19 17:37:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 89 cols
[2023-03-19 17:37:00] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-19 17:37:00] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 89/96 places, 112/132 transitions.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 7 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-19 17:37:00] [INFO ] Invariant cache hit.
[2023-03-19 17:37:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 17:37:00] [INFO ] Invariant cache hit.
[2023-03-19 17:37:00] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-19 17:37:00] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-19 17:37:00] [INFO ] Invariant cache hit.
[2023-03-19 17:37:01] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 89/96 places, 112/132 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 8928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 27 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-19 17:37:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-19 17:37:01] [INFO ] Invariant cache hit.
[2023-03-19 17:37:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:01] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-19 17:37:01] [INFO ] Invariant cache hit.
[2023-03-19 17:37:01] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 87/147 places, 102/282 transitions.
Stuttering acceptance computed with spot in 308 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22311 reset in 250 ms.
Product exploration explored 100000 steps with 22478 reset in 265 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 9 ms. (steps per millisecond=276 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 10 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:37:02] [INFO ] Invariant cache hit.
[2023-03-19 17:37:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 17:37:02] [INFO ] Invariant cache hit.
[2023-03-19 17:37:03] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:03] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-19 17:37:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:37:03] [INFO ] Invariant cache hit.
[2023-03-19 17:37:03] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 8 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 87 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22477 reset in 115 ms.
Product exploration explored 100000 steps with 22438 reset in 128 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:37:04] [INFO ] Invariant cache hit.
[2023-03-19 17:37:04] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 17:37:04] [INFO ] Invariant cache hit.
[2023-03-19 17:37:04] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:04] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-19 17:37:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:37:04] [INFO ] Invariant cache hit.
[2023-03-19 17:37:04] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 3420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F((!p1&&X(X(G(!p0))))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 13 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-19 17:37:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 17:37:04] [INFO ] Invariant cache hit.
[2023-03-19 17:37:04] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:04] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-19 17:37:04] [INFO ] Invariant cache hit.
[2023-03-19 17:37:04] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 87/147 places, 102/282 transitions.
Stuttering acceptance computed with spot in 168 ms :[p0, true, p0, p0, (OR p1 p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={0} source=5 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22494 reset in 143 ms.
Product exploration explored 100000 steps with 22479 reset in 151 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 393 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 5 properties in 28 ms. (steps per millisecond=100 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 28 ms. (steps per millisecond=100 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 459 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, (OR p1 p0), p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:37:07] [INFO ] Invariant cache hit.
[2023-03-19 17:37:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 17:37:07] [INFO ] Invariant cache hit.
[2023-03-19 17:37:07] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:07] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-19 17:37:07] [INFO ] Invariant cache hit.
[2023-03-19 17:37:07] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 281 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:37:08] [INFO ] Invariant cache hit.
[2023-03-19 17:37:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:37:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:37:08] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:37:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:08] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:37:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:08] [INFO ] After 28ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:37:08] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-19 17:37:08] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 105 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 245 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 86 transition count 100
Applied a total of 3 rules in 4 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 3 properties in 33 ms. (steps per millisecond=85 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 33 ms. (steps per millisecond=85 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 576 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 226 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 248 ms :[p0, p0, p0, (OR p1 p0), p0]
Product exploration explored 100000 steps with 22460 reset in 175 ms.
Product exploration explored 100000 steps with 22483 reset in 157 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:37:11] [INFO ] Invariant cache hit.
[2023-03-19 17:37:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 17:37:11] [INFO ] Invariant cache hit.
[2023-03-19 17:37:11] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:11] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-19 17:37:11] [INFO ] Invariant cache hit.
[2023-03-19 17:37:11] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 finished in 6878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(F(p1))||F(p2)))&&p0)))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 163
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 149
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 149
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 139
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 108 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 108 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 108 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 104 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 101 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 101 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 99 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 99 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 99 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 97 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 97 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 96 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 96 transition count 112
Applied a total of 119 rules in 13 ms. Remains 96 /147 variables (removed 51) and now considering 112/282 (removed 170) transitions.
// Phase 1: matrix 112 rows 96 cols
[2023-03-19 17:37:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 17:37:11] [INFO ] Invariant cache hit.
[2023-03-19 17:37:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 17:37:11] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-19 17:37:11] [INFO ] Invariant cache hit.
[2023-03-19 17:37:11] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/147 places, 112/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 96/147 places, 112/282 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p2:(OR (LT s1 1) (LT s59 1)), p1:(OR (LT s1 1) (LT s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 155
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 113 transition count 137
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 113 transition count 137
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 113 transition count 128
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 103 transition count 117
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 103 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 103 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 96 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 93 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 90 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 88 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 87 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 86 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 85 transition count 92
Applied a total of 139 rules in 19 ms. Remains 85 /147 variables (removed 62) and now considering 92/282 (removed 190) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-19 17:37:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 17:37:11] [INFO ] Invariant cache hit.
[2023-03-19 17:37:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:37:12] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-19 17:37:12] [INFO ] Invariant cache hit.
[2023-03-19 17:37:12] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/147 places, 92/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 85/147 places, 92/282 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s20 1) (LT s58 1) (AND (GEQ s1 1) (GEQ s71 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22455 reset in 105 ms.
Product exploration explored 100000 steps with 22458 reset in 121 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2233 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 1021 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 9 ms. (steps per millisecond=428 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 9 ms. (steps per millisecond=428 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 17:37:13] [INFO ] Invariant cache hit.
[2023-03-19 17:37:13] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 17:37:13] [INFO ] Invariant cache hit.
[2023-03-19 17:37:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:37:13] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-19 17:37:13] [INFO ] Invariant cache hit.
[2023-03-19 17:37:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 85/85 places, 92/92 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2206 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 987 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 10 ms. (steps per millisecond=385 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 11 ms. (steps per millisecond=350 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22435 reset in 146 ms.
Product exploration explored 100000 steps with 22466 reset in 133 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 17:37:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:37:14] [INFO ] Invariant cache hit.
[2023-03-19 17:37:14] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 85/85 places, 92/92 transitions.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 17:37:14] [INFO ] Invariant cache hit.
[2023-03-19 17:37:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 17:37:14] [INFO ] Invariant cache hit.
[2023-03-19 17:37:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:37:14] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-19 17:37:14] [INFO ] Invariant cache hit.
[2023-03-19 17:37:15] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 85/85 places, 92/92 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 3192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1&&F(p2)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 110 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 106 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 106 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 101 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 99 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 99 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 94 transition count 129
Applied a total of 120 rules in 14 ms. Remains 94 /147 variables (removed 53) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 94 cols
[2023-03-19 17:37:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 17:37:15] [INFO ] Invariant cache hit.
[2023-03-19 17:37:15] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-19 17:37:15] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-19 17:37:15] [INFO ] Invariant cache hit.
[2023-03-19 17:37:15] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/147 places, 129/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 94/147 places, 129/282 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p1:(OR (LT s1 1) (LT s89 1)), p2:(OR (LT s1 1) (LT s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 196 ms.
Product exploration explored 100000 steps with 33333 reset in 195 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 317 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 finished in 1102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 166
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 165
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 117 transition count 151
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 117 transition count 151
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 117 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 108 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 108 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 104 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 104 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 101 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 101 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 99 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 99 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 99 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 98 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 98 transition count 115
Applied a total of 114 rules in 11 ms. Remains 98 /147 variables (removed 49) and now considering 115/282 (removed 167) transitions.
// Phase 1: matrix 115 rows 98 cols
[2023-03-19 17:37:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 17:37:16] [INFO ] Invariant cache hit.
[2023-03-19 17:37:16] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 17:37:16] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-19 17:37:16] [INFO ] Invariant cache hit.
[2023-03-19 17:37:16] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/147 places, 115/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 98/147 places, 115/282 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s41 1)), p0:(OR (AND (GEQ s1 1) (GEQ s67 1)) (AND (GEQ s1 1) (GEQ s93 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 84 transition count 98
Applied a total of 143 rules in 36 ms. Remains 84 /147 variables (removed 63) and now considering 98/282 (removed 184) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-19 17:37:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 17:37:16] [INFO ] Invariant cache hit.
[2023-03-19 17:37:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 17:37:16] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-19 17:37:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:37:16] [INFO ] Invariant cache hit.
[2023-03-19 17:37:17] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/147 places, 98/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 84/147 places, 98/282 transitions.
Stuttering acceptance computed with spot in 53 ms :[false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22473 reset in 138 ms.
Product exploration explored 100000 steps with 22363 reset in 193 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[false]
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 69 ms. (steps per millisecond=523 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 69 ms. (steps per millisecond=523 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[false]
Stuttering acceptance computed with spot in 53 ms :[false]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-19 17:37:18] [INFO ] Invariant cache hit.
[2023-03-19 17:37:18] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 17:37:18] [INFO ] Invariant cache hit.
[2023-03-19 17:37:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 17:37:18] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-19 17:37:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:37:18] [INFO ] Invariant cache hit.
[2023-03-19 17:37:18] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[false]
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 52 ms. (steps per millisecond=694 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 52 ms. (steps per millisecond=694 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[false]
Stuttering acceptance computed with spot in 36 ms :[false]
Stuttering acceptance computed with spot in 33 ms :[false]
Product exploration explored 100000 steps with 22458 reset in 126 ms.
Product exploration explored 100000 steps with 22448 reset in 142 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-19 17:37:19] [INFO ] Invariant cache hit.
[2023-03-19 17:37:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-19 17:37:19] [INFO ] Invariant cache hit.
[2023-03-19 17:37:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 17:37:19] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-19 17:37:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:37:19] [INFO ] Invariant cache hit.
[2023-03-19 17:37:19] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 finished in 2874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U X(X(p2)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 175
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 117 transition count 161
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 117 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 117 transition count 151
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 108 transition count 141
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 108 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 108 transition count 139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 104 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 104 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 101 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 101 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 97 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 97 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 95 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 94 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 94 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 93 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 93 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 92 transition count 120
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 92 transition count 120
Applied a total of 123 rules in 13 ms. Remains 92 /147 variables (removed 55) and now considering 120/282 (removed 162) transitions.
// Phase 1: matrix 120 rows 92 cols
[2023-03-19 17:37:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 17:37:19] [INFO ] Invariant cache hit.
[2023-03-19 17:37:19] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 17:37:19] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-19 17:37:19] [INFO ] Invariant cache hit.
[2023-03-19 17:37:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/147 places, 120/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 92/147 places, 120/282 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1)), p2:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&F(!p1)) U (G((p0&&F(!p1)))||(p0&&G(!p1)))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 107 transition count 138
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 107 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 107 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 103 transition count 131
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 100 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 100 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 91 transition count 117
Applied a total of 126 rules in 17 ms. Remains 91 /147 variables (removed 56) and now considering 117/282 (removed 165) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-19 17:37:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:20] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 17:37:20] [INFO ] Invariant cache hit.
[2023-03-19 17:37:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:37:20] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-19 17:37:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:37:20] [INFO ] Invariant cache hit.
[2023-03-19 17:37:20] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/147 places, 117/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 91/147 places, 117/282 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22442 reset in 113 ms.
Product exploration explored 100000 steps with 22335 reset in 134 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 426 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 647687 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{0=1, 1=1, 3=1, 6=1}
Probabilistic random walk after 647687 steps, saw 279041 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :4
Running SMT prover for 3 properties.
[2023-03-19 17:37:25] [INFO ] Invariant cache hit.
[2023-03-19 17:37:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:25] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:25] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 17:37:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:25] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:37:25] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 17:37:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:37:25] [INFO ] After 33ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-19 17:37:25] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 17:37:25] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 6 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/91 places, 115/117 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 874726 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 874726 steps, saw 374657 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 90 cols
[2023-03-19 17:37:28] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 17:37:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 17:37:28] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:37:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:28] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:37:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-19 17:37:28] [INFO ] After 24ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:37:28] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 17:37:28] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-19 17:37:28] [INFO ] Invariant cache hit.
[2023-03-19 17:37:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 17:37:29] [INFO ] Invariant cache hit.
[2023-03-19 17:37:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-19 17:37:29] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-19 17:37:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:37:29] [INFO ] Invariant cache hit.
[2023-03-19 17:37:29] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 90/90 places, 115/115 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 7 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2023-03-19 17:37:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 17:37:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:29] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:37:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:29] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:37:29] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 17:37:29] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (OR (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 12 factoid took 458 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-19 17:37:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 17:37:30] [INFO ] Invariant cache hit.
[2023-03-19 17:37:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:37:30] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-19 17:37:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:37:30] [INFO ] Invariant cache hit.
[2023-03-19 17:37:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 364 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 2137809 steps, run timeout after 3001 ms. (steps per millisecond=712 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 2137809 steps, saw 883264 distinct states, run finished after 3001 ms. (steps per millisecond=712 ) properties seen :4
Running SMT prover for 1 properties.
[2023-03-19 17:37:34] [INFO ] Invariant cache hit.
[2023-03-19 17:37:34] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 17:37:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:37:34] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:37:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:37:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:37:34] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:37:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:37:34] [INFO ] After 25ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:37:34] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 17:37:34] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 86 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 85 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 84 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 83 transition count 96
Applied a total of 21 rules in 12 ms. Remains 83 /91 variables (removed 8) and now considering 96/117 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 83/91 places, 96/117 transitions.
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2879439 steps, run timeout after 3001 ms. (steps per millisecond=959 ) properties seen :{}
Probabilistic random walk after 2879439 steps, saw 1205167 distinct states, run finished after 3002 ms. (steps per millisecond=959 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 83 cols
[2023-03-19 17:37:37] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 17:37:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:37:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:38] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:37:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:38] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:37:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 17:37:38] [INFO ] After 17ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:37:38] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 17:37:38] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-19 17:37:38] [INFO ] Invariant cache hit.
[2023-03-19 17:37:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 17:37:38] [INFO ] Invariant cache hit.
[2023-03-19 17:37:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 17:37:38] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-19 17:37:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:37:38] [INFO ] Invariant cache hit.
[2023-03-19 17:37:38] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 83/83 places, 96/96 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 90
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 78 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 65 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 58 transition count 70
Applied a total of 51 rules in 5 ms. Remains 58 /83 variables (removed 25) and now considering 70/96 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 58 cols
[2023-03-19 17:37:38] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:37:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:38] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:37:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:38] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:37:38] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-19 17:37:38] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (OR (NOT p0) p1)), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 9 factoid took 498 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 22412 reset in 167 ms.
Product exploration explored 100000 steps with 22513 reset in 141 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-19 17:37:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:37:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-19 17:37:40] [INFO ] Invariant cache hit.
[2023-03-19 17:37:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 17:37:40] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-19 17:37:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:37:40] [INFO ] Invariant cache hit.
[2023-03-19 17:37:40] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 91/91 places, 117/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 finished in 20328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 107 transition count 138
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 107 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 107 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 102 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 102 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 95 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 95 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 95 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 92 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 90 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 89 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 88 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 87 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 87 transition count 109
Applied a total of 138 rules in 16 ms. Remains 87 /147 variables (removed 60) and now considering 109/282 (removed 173) transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-19 17:37:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 17:37:40] [INFO ] Invariant cache hit.
[2023-03-19 17:37:40] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-19 17:37:40] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-19 17:37:40] [INFO ] Invariant cache hit.
[2023-03-19 17:37:40] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 109/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 87/147 places, 109/282 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s82 1)), p0:(AND (GEQ s1 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 finished in 519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 173
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 118 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 109 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 109 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 109 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 105 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 105 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 102 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 102 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 100 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 95 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 93 transition count 122
Applied a total of 119 rules in 24 ms. Remains 93 /147 variables (removed 54) and now considering 122/282 (removed 160) transitions.
// Phase 1: matrix 122 rows 93 cols
[2023-03-19 17:37:41] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:37:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 17:37:41] [INFO ] Invariant cache hit.
[2023-03-19 17:37:41] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-19 17:37:41] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-19 17:37:41] [INFO ] Invariant cache hit.
[2023-03-19 17:37:41] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 93/147 places, 122/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 394 ms. Remains : 93/147 places, 122/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s17 1) (LT s28 1)) (OR (LT s1 1) (LT s88 1)) (OR (LT s1 1) (LT s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22503 reset in 144 ms.
Product exploration explored 100000 steps with 22567 reset in 161 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1069 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 14 ms. (steps per millisecond=266 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 14 ms. (steps per millisecond=266 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-19 17:37:42] [INFO ] Invariant cache hit.
[2023-03-19 17:37:42] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-19 17:37:42] [INFO ] Invariant cache hit.
[2023-03-19 17:37:42] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-19 17:37:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-19 17:37:43] [INFO ] Invariant cache hit.
[2023-03-19 17:37:43] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 93/93 places, 122/122 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 11 ms. (steps per millisecond=339 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 11 ms. (steps per millisecond=339 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22436 reset in 181 ms.
Product exploration explored 100000 steps with 22533 reset in 173 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-19 17:37:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:37:44] [INFO ] Invariant cache hit.
[2023-03-19 17:37:44] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 93/93 places, 122/122 transitions.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 0 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-19 17:37:44] [INFO ] Invariant cache hit.
[2023-03-19 17:37:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 17:37:44] [INFO ] Invariant cache hit.
[2023-03-19 17:37:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-19 17:37:45] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-19 17:37:45] [INFO ] Invariant cache hit.
[2023-03-19 17:37:45] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 93/93 places, 122/122 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 finished in 4184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p2))&&(!p0 U (p1||G(!p0)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), true, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 110 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 107 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 101 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 96 transition count 132
Applied a total of 115 rules in 21 ms. Remains 96 /147 variables (removed 51) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 96 cols
[2023-03-19 17:37:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:37:45] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 17:37:45] [INFO ] Invariant cache hit.
[2023-03-19 17:37:45] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 17:37:45] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-19 17:37:45] [INFO ] Invariant cache hit.
[2023-03-19 17:37:45] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 96/147 places, 132/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 373 ms. Remains : 96/147 places, 132/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s89 1))) (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 31076 reset in 199 ms.
Product exploration explored 100000 steps with 30945 reset in 173 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 423 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1814 ms. (steps per millisecond=642 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1815 ms. (steps per millisecond=642 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 658 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-19 17:37:49] [INFO ] Invariant cache hit.
[2023-03-19 17:37:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 17:37:49] [INFO ] Invariant cache hit.
[2023-03-19 17:37:49] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 17:37:49] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-19 17:37:49] [INFO ] Invariant cache hit.
[2023-03-19 17:37:49] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 96/96 places, 132/132 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1911 ms. (steps per millisecond=610 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1911 ms. (steps per millisecond=610 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22374 reset in 123 ms.
Product exploration explored 100000 steps with 22433 reset in 130 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 121 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 13 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-19 17:37:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 112 rows 89 cols
[2023-03-19 17:37:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:53] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 89/96 places, 112/132 transitions.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 15 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-19 17:37:53] [INFO ] Invariant cache hit.
[2023-03-19 17:37:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 17:37:53] [INFO ] Invariant cache hit.
[2023-03-19 17:37:53] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-19 17:37:53] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-19 17:37:53] [INFO ] Invariant cache hit.
[2023-03-19 17:37:53] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 89/96 places, 112/132 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 8780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Stuttering acceptance computed with spot in 296 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 19 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-19 17:37:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:37:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 17:37:54] [INFO ] Invariant cache hit.
[2023-03-19 17:37:54] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:54] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-19 17:37:54] [INFO ] Invariant cache hit.
[2023-03-19 17:37:54] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 307 ms. Remains : 87/147 places, 102/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22398 reset in 107 ms.
Product exploration explored 100000 steps with 22410 reset in 122 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 8 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 82 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:37:55] [INFO ] Invariant cache hit.
[2023-03-19 17:37:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 17:37:55] [INFO ] Invariant cache hit.
[2023-03-19 17:37:55] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:55] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-19 17:37:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:37:55] [INFO ] Invariant cache hit.
[2023-03-19 17:37:55] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 8 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22610 reset in 88 ms.
Product exploration explored 100000 steps with 22365 reset in 85 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:37:56] [INFO ] Invariant cache hit.
[2023-03-19 17:37:56] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-19 17:37:56] [INFO ] Invariant cache hit.
[2023-03-19 17:37:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-19 17:37:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:37:56] [INFO ] Invariant cache hit.
[2023-03-19 17:37:56] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 2957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F((!p1&&X(X(G(!p0))))))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
Stuttering acceptance computed with spot in 260 ms :[p0, true, p0, p0, (OR p1 p0), p0]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 33 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-19 17:37:57] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:37:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 17:37:57] [INFO ] Invariant cache hit.
[2023-03-19 17:37:57] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:57] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-19 17:37:57] [INFO ] Invariant cache hit.
[2023-03-19 17:37:57] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 309 ms. Remains : 87/147 places, 102/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={0} source=5 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22572 reset in 156 ms.
Product exploration explored 100000 steps with 22407 reset in 151 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 485 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:37:59] [INFO ] Invariant cache hit.
[2023-03-19 17:37:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:59] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:37:59] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:37:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:37:59] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:37:59] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:37:59] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:37:59] [INFO ] After 33ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:37:59] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-19 17:37:59] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 63 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 245 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 7 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 523 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 3 properties in 25 ms. (steps per millisecond=112 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 25 ms. (steps per millisecond=112 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 527 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 261 ms :[p0, p0, p0, (OR p1 p0), p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:38:00] [INFO ] Invariant cache hit.
[2023-03-19 17:38:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 17:38:00] [INFO ] Invariant cache hit.
[2023-03-19 17:38:00] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:38:01] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-19 17:38:01] [INFO ] Invariant cache hit.
[2023-03-19 17:38:01] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2233 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2023-03-19 17:38:02] [INFO ] Invariant cache hit.
[2023-03-19 17:38:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:38:02] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:38:02] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:38:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:38:02] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:38:02] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:38:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:38:02] [INFO ] After 45ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:38:02] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-19 17:38:02] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 60 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 245 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 5 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 3 properties in 26 ms. (steps per millisecond=108 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 26 ms. (steps per millisecond=108 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 623 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 286 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 258 ms :[p0, p0, p0, (OR p1 p0), p0]
Product exploration explored 100000 steps with 22439 reset in 188 ms.
Product exploration explored 100000 steps with 22484 reset in 164 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-19 17:38:05] [INFO ] Invariant cache hit.
[2023-03-19 17:38:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 17:38:05] [INFO ] Invariant cache hit.
[2023-03-19 17:38:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 17:38:05] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-19 17:38:05] [INFO ] Invariant cache hit.
[2023-03-19 17:38:05] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 finished in 8420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 155
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 113 transition count 137
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 113 transition count 137
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 113 transition count 128
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 103 transition count 117
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 103 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 103 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 96 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 93 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 90 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 88 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 87 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 86 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 85 transition count 92
Applied a total of 139 rules in 22 ms. Remains 85 /147 variables (removed 62) and now considering 92/282 (removed 190) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-19 17:38:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:38:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-19 17:38:05] [INFO ] Invariant cache hit.
[2023-03-19 17:38:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:38:05] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-19 17:38:05] [INFO ] Invariant cache hit.
[2023-03-19 17:38:05] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 85/147 places, 92/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 322 ms. Remains : 85/147 places, 92/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s20 1) (LT s58 1) (AND (GEQ s1 1) (GEQ s71 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22426 reset in 106 ms.
Product exploration explored 100000 steps with 22477 reset in 120 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 11 ms. (steps per millisecond=350 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 12 ms. (steps per millisecond=321 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 17:38:07] [INFO ] Invariant cache hit.
[2023-03-19 17:38:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 17:38:07] [INFO ] Invariant cache hit.
[2023-03-19 17:38:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:38:07] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-19 17:38:07] [INFO ] Invariant cache hit.
[2023-03-19 17:38:07] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 85/85 places, 92/92 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 986 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 11 ms. (steps per millisecond=350 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 11 ms. (steps per millisecond=350 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22533 reset in 137 ms.
Product exploration explored 100000 steps with 22339 reset in 114 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 17:38:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:38:08] [INFO ] Invariant cache hit.
[2023-03-19 17:38:08] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 85/85 places, 92/92 transitions.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 17:38:08] [INFO ] Invariant cache hit.
[2023-03-19 17:38:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-19 17:38:09] [INFO ] Invariant cache hit.
[2023-03-19 17:38:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:38:09] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-19 17:38:09] [INFO ] Invariant cache hit.
[2023-03-19 17:38:09] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 85/85 places, 92/92 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 3890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&F(!p1)) U (G((p0&&F(!p1)))||(p0&&G(!p1)))))))'
[2023-03-19 17:38:09] [INFO ] Flatten gal took : 37 ms
[2023-03-19 17:38:09] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-19 17:38:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 147 places, 282 transitions and 1113 arcs took 4 ms.
Total runtime 103503 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d1m64
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679247585176

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
lola: time limit : 514 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/514 5/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 644890 m, 128978 m/sec, 1368593 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/514 11/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 1343255 m, 139673 m/sec, 2873916 t fired, .

Time elapsed: 10 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/514 16/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 2058584 m, 143065 m/sec, 4406330 t fired, .

Time elapsed: 15 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/514 21/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 2789258 m, 146134 m/sec, 5991094 t fired, .

Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/514 27/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 3547891 m, 151726 m/sec, 7627065 t fired, .

Time elapsed: 25 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 4 (type EXCL) for SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 13 (type EXCL) for 12 SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
lola: time limit : 595 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
lola: result : false
lola: markings : 581
lola: fired transitions : 1059
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
lola: time limit : 713 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
lola: result : false
lola: markings : 905
lola: fired transitions : 2155
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
lola: time limit : 892 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/892 9/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 1102851 m, 220570 m/sec, 2343646 t fired, .

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/892 17/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 2215888 m, 222607 m/sec, 4748659 t fired, .

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/892 25/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 3329743 m, 222771 m/sec, 7155154 t fired, .

Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 7 (type EXCL) for SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
lola: time limit : 1183 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
lola: result : false
lola: markings : 340
lola: fired transitions : 603
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
lola: time limit : 1774 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 5/1774 9/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 1162533 m, 232506 m/sec, 2486863 t fired, .

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 10/1774 18/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 2315720 m, 230637 m/sec, 4987932 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 15/1774 26/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 3400208 m, 216897 m/sec, 7327904 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 16 (type EXCL) for SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 19 (type EXCL) for 18 SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
lola: time limit : 3529 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 5/3529 9/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 1106728 m, 221345 m/sec, 2351783 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 10/3529 17/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 2223705 m, 223395 m/sec, 4765722 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 15/3529 24/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 3236117 m, 202482 m/sec, 6955666 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 20/3529 32/32 SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 4243123 m, 201401 m/sec, 9163028 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 19 (type EXCL) for SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: Portfolio finished: no open tasks 7

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m64-LTLFireability-00: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-04: LTL unknown AGGR
SieveSingleMsgMbox-PT-d1m64-LTLFireability-06: LTL unknown AGGR
SieveSingleMsgMbox-PT-d1m64-LTLFireability-07: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-09: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m64-LTLFireability-12: LTL unknown AGGR
SieveSingleMsgMbox-PT-d1m64-LTLFireability-14: LTL unknown AGGR


Time elapsed: 96 secs. Pages in use: 32

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-d1m64"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976700436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;