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.r425-tajo-167905978200428.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d1m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 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-d1m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679315951515

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:39:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:39:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:39:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-20 12:39:13] [INFO ] Transformed 1295 places.
[2023-03-20 12:39:13] [INFO ] Transformed 749 transitions.
[2023-03-20 12:39:13] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 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 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 307 place count 192 transition count 355
Iterating global reduction 1 with 50 rules applied. Total rules applied 357 place count 192 transition count 355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 364 place count 192 transition count 348
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 398 place count 158 transition count 314
Iterating global reduction 2 with 34 rules applied. Total rules applied 432 place count 158 transition count 314
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 443 place count 158 transition count 303
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 460 place count 141 transition count 284
Iterating global reduction 3 with 17 rules applied. Total rules applied 477 place count 141 transition count 284
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 504 place count 141 transition count 257
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 509 place count 136 transition count 249
Iterating global reduction 4 with 5 rules applied. Total rules applied 514 place count 136 transition count 249
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 518 place count 132 transition count 245
Iterating global reduction 4 with 4 rules applied. Total rules applied 522 place count 132 transition count 245
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 524 place count 130 transition count 242
Iterating global reduction 4 with 2 rules applied. Total rules applied 526 place count 130 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 527 place count 129 transition count 241
Iterating global reduction 4 with 1 rules applied. Total rules applied 528 place count 129 transition count 241
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 529 place count 128 transition count 240
Iterating global reduction 4 with 1 rules applied. Total rules applied 530 place count 128 transition count 240
Applied a total of 530 rules in 71 ms. Remains 128 /259 variables (removed 131) and now considering 240/749 (removed 509) transitions.
// Phase 1: matrix 240 rows 128 cols
[2023-03-20 12:39:13] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-20 12:39:13] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-20 12:39:13] [INFO ] Invariant cache hit.
[2023-03-20 12:39:13] [INFO ] State equation strengthened by 151 read => feed constraints.
[2023-03-20 12:39:13] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-20 12:39:13] [INFO ] Invariant cache hit.
[2023-03-20 12:39:14] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/259 places, 240/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 128/259 places, 240/749 transitions.
Support contains 24 out of 128 places after structural reductions.
[2023-03-20 12:39:14] [INFO ] Flatten gal took : 41 ms
[2023-03-20 12:39:14] [INFO ] Flatten gal took : 18 ms
[2023-03-20 12:39:14] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-20 12:39:15] [INFO ] Invariant cache hit.
[2023-03-20 12:39:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:39:15] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-20 12:39:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:39:15] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-20 12:39:15] [INFO ] State equation strengthened by 151 read => feed constraints.
[2023-03-20 12:39:16] [INFO ] After 808ms SMT Verify possible using 151 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-20 12:39:17] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 9 ms to minimize.
[2023-03-20 12:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-20 12:39:18] [INFO ] After 2422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1599 ms.
[2023-03-20 12:39:19] [INFO ] After 4498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 3 properties in 598 ms.
Support contains 16 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 240/240 transitions.
Graph (complete) has 443 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 127 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 124 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 124 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 121 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 121 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 118 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 118 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 118 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 116 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 116 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 115 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 115 transition count 213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 114 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 114 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 113 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 113 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 112 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 112 transition count 209
Applied a total of 35 rules in 72 ms. Remains 112 /128 variables (removed 16) and now considering 209/240 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 112/128 places, 209/240 transitions.
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) 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 15) seen :0
Interrupted probabilistic random walk after 468061 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{0=1, 1=1, 6=1, 9=1, 10=1, 11=1, 13=1}
Probabilistic random walk after 468061 steps, saw 212837 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :7
Running SMT prover for 8 properties.
// Phase 1: matrix 209 rows 112 cols
[2023-03-20 12:39:24] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 12:39:24] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-20 12:39:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:24] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 12:39:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:39:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:24] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 12:39:24] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-03-20 12:39:25] [INFO ] After 254ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 12:39:25] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-20 12:39:25] [INFO ] After 986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 173 ms.
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 209/209 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 14 place count 108 transition count 169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 105 transition count 166
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 105 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 105 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 103 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 103 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 103 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 102 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 102 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 101 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 101 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 100 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 100 transition count 157
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 40 place count 100 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 99 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 99 transition count 150
Applied a total of 42 rules in 30 ms. Remains 99 /112 variables (removed 13) and now considering 150/209 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 99/112 places, 150/209 transitions.
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1063 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 589268 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589268 steps, saw 258582 distinct states, run finished after 3003 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 150 rows 99 cols
[2023-03-20 12:39:29] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 12:39:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:29] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 12:39:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:29] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 12:39:29] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-20 12:39:29] [INFO ] After 209ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 12:39:30] [INFO ] After 405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-20 12:39:30] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 153 ms.
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 150/150 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 99/99 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 150/150 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-20 12:39:30] [INFO ] Invariant cache hit.
[2023-03-20 12:39:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 12:39:30] [INFO ] Invariant cache hit.
[2023-03-20 12:39:30] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-20 12:39:30] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-20 12:39:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 12:39:30] [INFO ] Invariant cache hit.
[2023-03-20 12:39:30] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 99/99 places, 150/150 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 99 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 95 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 9 place count 95 transition count 131
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 37 place count 81 transition count 131
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 73 transition count 123
Applied a total of 53 rules in 13 ms. Remains 73 /99 variables (removed 26) and now considering 123/150 (removed 27) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 123 rows 73 cols
[2023-03-20 12:39:30] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 12:39:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:31] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 12:39:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:31] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 12:39:31] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-20 12:39:31] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 25 stabilizing places and 40 stable transitions
Graph (complete) has 490 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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(G((G(p0)||(!(p0 U p1)&&p2)))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 107 transition count 139
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 98 transition count 130
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 98 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 76 place count 98 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 94 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 94 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 91 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 91 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 89 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 87 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 86 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 86 transition count 107
Applied a total of 103 rules in 20 ms. Remains 86 /128 variables (removed 42) and now considering 107/240 (removed 133) transitions.
// Phase 1: matrix 107 rows 86 cols
[2023-03-20 12:39:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 12:39:31] [INFO ] Invariant cache hit.
[2023-03-20 12:39:31] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:39:31] [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-20 12:39:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:39:31] [INFO ] Invariant cache hit.
[2023-03-20 12:39:31] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/128 places, 107/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 86/128 places, 107/240 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), 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 s1 1) (LT s81 1)), p2:(OR (LT s1 1) (LT s80 1)), p1:(OR (AND (GEQ s1 1) (GEQ s81 1)) (AND (GEQ s1 1) (GEQ s77 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22435 reset in 251 ms.
Product exploration explored 100000 steps with 22604 reset in 194 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 281 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (AND p2 (NOT p1))), true, (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 346 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Finished probabilistic random walk after 36354 steps, run visited all 4 properties in 116 ms. (steps per millisecond=313 )
Probabilistic random walk after 36354 steps, saw 16270 distinct states, run finished after 117 ms. (steps per millisecond=310 ) properties seen :4
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (AND p2 (NOT p1))), true, (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT p0)), (F (OR (AND p0 p1) (AND p0 (NOT p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 10 factoid took 167 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 finished in 1991 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((p0&&G(p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 147
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 116 transition count 145
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 106 transition count 135
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 106 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 106 transition count 130
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 98 transition count 122
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 98 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 95 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 95 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 93 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 93 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 91 transition count 109
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 91 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 88 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 90 place count 89 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 89 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 88 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 88 transition count 104
Applied a total of 94 rules in 15 ms. Remains 88 /128 variables (removed 40) and now considering 104/240 (removed 136) transitions.
// Phase 1: matrix 104 rows 88 cols
[2023-03-20 12:39:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:39:33] [INFO ] Invariant cache hit.
[2023-03-20 12:39:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:39:33] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-20 12:39:33] [INFO ] Invariant cache hit.
[2023-03-20 12:39:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/128 places, 104/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 88/128 places, 104/240 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s21 1) (LT s59 1)), p0:(OR (LT s1 1) (LT s83 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 22447 reset in 170 ms.
Product exploration explored 100000 steps with 22328 reset in 135 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 283 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2417106 steps, run timeout after 3001 ms. (steps per millisecond=805 ) properties seen :{}
Probabilistic random walk after 2417106 steps, saw 1001786 distinct states, run finished after 3002 ms. (steps per millisecond=805 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:39:37] [INFO ] Invariant cache hit.
[2023-03-20 12:39:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:39:37] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:39:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:39:37] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:37] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:39:37] [INFO ] After 11ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:37] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 12:39:37] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 104/104 transitions.
Graph (complete) has 251 edges and 88 vertex of which 87 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 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 93
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 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 84 transition count 91
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 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 83 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 82 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 82 transition count 88
Applied a total of 15 rules in 11 ms. Remains 82 /88 variables (removed 6) and now considering 88/104 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/88 places, 88/104 transitions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1002 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2667218 steps, run timeout after 3001 ms. (steps per millisecond=888 ) properties seen :{}
Probabilistic random walk after 2667218 steps, saw 1115615 distinct states, run finished after 3003 ms. (steps per millisecond=888 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 82 cols
[2023-03-20 12:39:40] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-20 12:39:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:40] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:39:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 12:39:40] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:40] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:39:40] [INFO ] After 11ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:40] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 12:39:40] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-20 12:39:40] [INFO ] Invariant cache hit.
[2023-03-20 12:39:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 12:39:40] [INFO ] Invariant cache hit.
[2023-03-20 12:39:40] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:39:40] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-20 12:39:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:39:41] [INFO ] Invariant cache hit.
[2023-03-20 12:39:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 82/82 places, 88/88 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 rules applied. Total rules applied 7 place count 82 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 77 transition count 81
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 77 transition count 68
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 38 place count 64 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 58 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 57 transition count 67
Applied a total of 52 rules in 9 ms. Remains 57 /82 variables (removed 25) and now considering 67/88 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 57 cols
[2023-03-20 12:39:41] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 12:39:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:41] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:41] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:39:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:41] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:41] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:41] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 12:39:41] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 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 63 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 88 cols
[2023-03-20 12:39:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 12:39:41] [INFO ] Invariant cache hit.
[2023-03-20 12:39:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:39:41] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-20 12:39:41] [INFO ] Invariant cache hit.
[2023-03-20 12:39:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 88/88 places, 104/104 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 283 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 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 68 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1001 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2618977 steps, run timeout after 3001 ms. (steps per millisecond=872 ) properties seen :{}
Probabilistic random walk after 2618977 steps, saw 1081601 distinct states, run finished after 3001 ms. (steps per millisecond=872 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:39:44] [INFO ] Invariant cache hit.
[2023-03-20 12:39:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:39:45] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:39:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:39:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:39:45] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:39:45] [INFO ] After 15ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:45] [INFO ] After 24ms 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-20 12:39:45] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 104/104 transitions.
Graph (complete) has 251 edges and 88 vertex of which 87 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 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 93
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 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 84 transition count 91
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 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 83 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 82 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 82 transition count 88
Applied a total of 15 rules in 9 ms. Remains 82 /88 variables (removed 6) and now considering 88/104 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/88 places, 88/104 transitions.
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1025 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2659096 steps, run timeout after 3001 ms. (steps per millisecond=886 ) properties seen :{}
Probabilistic random walk after 2659096 steps, saw 1112328 distinct states, run finished after 3001 ms. (steps per millisecond=886 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 82 cols
[2023-03-20 12:39:48] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 12:39:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:39:48] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:39:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:48] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:39:48] [INFO ] After 12ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:48] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 12:39:48] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-20 12:39:48] [INFO ] Invariant cache hit.
[2023-03-20 12:39:48] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 12:39:48] [INFO ] Invariant cache hit.
[2023-03-20 12:39:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:39:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-20 12:39:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:39:48] [INFO ] Invariant cache hit.
[2023-03-20 12:39:48] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 82/82 places, 88/88 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 rules applied. Total rules applied 7 place count 82 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 77 transition count 81
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 77 transition count 68
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 38 place count 64 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 58 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 57 transition count 67
Applied a total of 52 rules in 6 ms. Remains 57 /82 variables (removed 25) and now considering 67/88 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 57 cols
[2023-03-20 12:39:48] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-20 12:39:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:48] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:48] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:39:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:39:48] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:48] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:39:48] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 12:39:48] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 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 68 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22531 reset in 104 ms.
Product exploration explored 100000 steps with 22469 reset in 117 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 95
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 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 93
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 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 83 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 83 transition count 90
Applied a total of 12 rules in 13 ms. Remains 83 /88 variables (removed 5) and now considering 90/104 (removed 14) transitions.
[2023-03-20 12:39:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 83 cols
[2023-03-20 12:39:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/88 places, 90/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 83/88 places, 90/104 transitions.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 95
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 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 93
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 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 83 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 83 transition count 90
Applied a total of 12 rules in 7 ms. Remains 83 /88 variables (removed 5) and now considering 90/104 (removed 14) transitions.
[2023-03-20 12:39:49] [INFO ] Invariant cache hit.
[2023-03-20 12:39:49] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 12:39:49] [INFO ] Invariant cache hit.
[2023-03-20 12:39:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 12:39:49] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-20 12:39:49] [INFO ] Invariant cache hit.
[2023-03-20 12:39:49] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/88 places, 90/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 83/88 places, 90/104 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 finished in 16365 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))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 147
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 116 transition count 145
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 105 transition count 134
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 105 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 105 transition count 128
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 96 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 96 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 96 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 84 transition count 98
Applied a total of 104 rules in 38 ms. Remains 84 /128 variables (removed 44) and now considering 98/240 (removed 142) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-20 12:39:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:50] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-20 12:39:50] [INFO ] Invariant cache hit.
[2023-03-20 12:39:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:39:50] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-20 12:39:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:39:50] [INFO ] Invariant cache hit.
[2023-03-20 12:39:50] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/128 places, 98/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 516 ms. Remains : 84/128 places, 98/240 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 finished in 565 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))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 115 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 115 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 115 transition count 135
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 38 place count 104 transition count 124
Iterating global reduction 1 with 11 rules applied. Total rules applied 49 place count 104 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 104 transition count 118
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 95 transition count 109
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 95 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 95 transition count 104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 91 transition count 100
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 88 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 88 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 86 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 86 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 86 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 84 transition count 91
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 83 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 83 transition count 90
Applied a total of 103 rules in 17 ms. Remains 83 /128 variables (removed 45) and now considering 90/240 (removed 150) transitions.
// Phase 1: matrix 90 rows 83 cols
[2023-03-20 12:39:50] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 12:39:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:39:50] [INFO ] Invariant cache hit.
[2023-03-20 12:39:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 12:39:50] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-20 12:39:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:39:50] [INFO ] Invariant cache hit.
[2023-03-20 12:39:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/128 places, 90/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 83/128 places, 90/240 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s17 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 finished in 257 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 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 148
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 117 transition count 146
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 107 transition count 136
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 107 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 50 place count 107 transition count 130
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 122
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 99 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 96 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 93 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 92 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 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 88 place count 92 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 91 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 91 transition count 106
Applied a total of 90 rules in 9 ms. Remains 91 /128 variables (removed 37) and now considering 106/240 (removed 134) transitions.
// Phase 1: matrix 106 rows 91 cols
[2023-03-20 12:39:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 12:39:50] [INFO ] Invariant cache hit.
[2023-03-20 12:39:50] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:39:50] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-20 12:39:50] [INFO ] Invariant cache hit.
[2023-03-20 12:39:50] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/128 places, 106/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 91/128 places, 106/240 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 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 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1)), p1:(OR (LT s1 1) (LT s86 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 22373 reset in 122 ms.
Product exploration explored 100000 steps with 22447 reset in 129 ms.
Computed a total of 20 stabilizing places and 25 stable transitions
Graph (complete) has 291 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 20 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 99 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 52 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2489317 steps, run timeout after 3001 ms. (steps per millisecond=829 ) properties seen :{}
Probabilistic random walk after 2489317 steps, saw 1044182 distinct states, run finished after 3001 ms. (steps per millisecond=829 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:39:54] [INFO ] Invariant cache hit.
[2023-03-20 12:39:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:39:54] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:39:54] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 finished in 3971 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) U (p1 U p2))||(!X(X(p1)) U p1)))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 118 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 118 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 118 transition count 156
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 109 transition count 147
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 109 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 46 place count 109 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 102 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 102 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 102 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 99 transition count 129
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 99 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 97 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 97 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 95 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 95 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 80 place count 95 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 93 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 92 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 92 transition count 118
Applied a total of 86 rules in 11 ms. Remains 92 /128 variables (removed 36) and now considering 118/240 (removed 122) transitions.
// Phase 1: matrix 118 rows 92 cols
[2023-03-20 12:39:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 12:39:54] [INFO ] Invariant cache hit.
[2023-03-20 12:39:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:39:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-20 12:39:54] [INFO ] Invariant cache hit.
[2023-03-20 12:39:54] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/128 places, 118/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 92/128 places, 118/240 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), true, (OR (NOT p0) (NOT p2)), true, p1, (OR (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=7 dest: 7}, { cond=(AND p2 p0), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s73 1)), p2:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 finished in 551 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)&&X((F(p1)&&(p2||X(G(!p3)))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 119 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 119 transition count 170
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 110 transition count 161
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 110 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 110 transition count 157
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 103 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 103 transition count 150
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 103 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 100 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 100 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 98 transition count 138
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 98 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 97 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 97 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 96 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 96 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 95 transition count 134
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 95 transition count 134
Applied a total of 77 rules in 10 ms. Remains 95 /128 variables (removed 33) and now considering 134/240 (removed 106) transitions.
// Phase 1: matrix 134 rows 95 cols
[2023-03-20 12:39:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-20 12:39:55] [INFO ] Invariant cache hit.
[2023-03-20 12:39:55] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 12:39:55] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-20 12:39:55] [INFO ] Invariant cache hit.
[2023-03-20 12:39:55] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/128 places, 134/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 95/128 places, 134/240 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) p3)), (NOT p0), (OR (NOT p1) (AND (NOT p2) p3)), (NOT p1), p3, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s74 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s87 1)), p3:(OR (LT s1 1) (LT s90 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 finished in 541 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))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 115 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 115 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 115 transition count 135
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 103 transition count 123
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 103 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 103 transition count 116
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 93 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 93 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 93 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 89 transition count 96
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 89 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 86 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 86 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 84 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 84 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 82 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 81 transition count 86
Applied a total of 109 rules in 12 ms. Remains 81 /128 variables (removed 47) and now considering 86/240 (removed 154) transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-20 12:39:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:39:55] [INFO ] Invariant cache hit.
[2023-03-20 12:39:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 12:39:55] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-20 12:39:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:39:55] [INFO ] Invariant cache hit.
[2023-03-20 12:39:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/128 places, 86/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 81/128 places, 86/240 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 finished in 287 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(((p1||G(p2))&&p0))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 107 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 99 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 96 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 91 transition count 117
Applied a total of 88 rules in 17 ms. Remains 91 /128 variables (removed 37) and now considering 117/240 (removed 123) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:39:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:56] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 12:39:56] [INFO ] Invariant cache hit.
[2023-03-20 12:39:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:39:56] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-20 12:39:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:39:56] [INFO ] Invariant cache hit.
[2023-03-20 12:39:56] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/128 places, 117/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 91/128 places, 117/240 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s3 1) (GEQ s27 1)), p2:(OR (LT s1 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 finished in 403 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)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 138
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 116 transition count 137
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 105 transition count 126
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 105 transition count 126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 54 place count 105 transition count 119
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 96 transition count 110
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 96 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 77 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 92 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 92 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 89 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 89 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 87 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 87 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 87 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 85 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 85 transition count 92
Applied a total of 101 rules in 10 ms. Remains 85 /128 variables (removed 43) and now considering 92/240 (removed 148) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-20 12:39:56] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:39:56] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 12:39:56] [INFO ] Invariant cache hit.
[2023-03-20 12:39:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:39:56] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-20 12:39:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:39:56] [INFO ] Invariant cache hit.
[2023-03-20 12:39:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/128 places, 92/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 85/128 places, 92/240 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 finished in 330 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)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 147
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 116 transition count 145
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 105 transition count 134
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 105 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 105 transition count 128
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 96 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 96 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 96 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 84 transition count 98
Applied a total of 104 rules in 17 ms. Remains 84 /128 variables (removed 44) and now considering 98/240 (removed 142) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-20 12:39:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:39:56] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 12:39:56] [INFO ] Invariant cache hit.
[2023-03-20 12:39:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:39:56] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-20 12:39:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:39:57] [INFO ] Invariant cache hit.
[2023-03-20 12:39:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/128 places, 98/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 84/128 places, 98/240 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22566 reset in 85 ms.
Product exploration explored 100000 steps with 22432 reset in 98 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.2 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 122 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1275 ms. (steps per millisecond=878 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1275 ms. (steps per millisecond=878 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
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 2 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-20 12:39:58] [INFO ] Invariant cache hit.
[2023-03-20 12:39:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 12:39:58] [INFO ] Invariant cache hit.
[2023-03-20 12:39:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:39:59] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-20 12:39:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:39:59] [INFO ] Invariant cache hit.
[2023-03-20 12:39:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 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 113 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1311 ms. (steps per millisecond=854 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1313 ms. (steps per millisecond=852 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 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 :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22442 reset in 108 ms.
Product exploration explored 100000 steps with 22452 reset in 116 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 2 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-20 12:40:01] [INFO ] Invariant cache hit.
[2023-03-20 12:40:01] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:40:01] [INFO ] Invariant cache hit.
[2023-03-20 12:40:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:40:01] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-20 12:40:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:40:01] [INFO ] Invariant cache hit.
[2023-03-20 12:40:01] [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 299 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 finished in 4614 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||G(!p1)))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 107 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 73 place count 99 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 95 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 95 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 92 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 92 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 90 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 90 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 90 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 88 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 87 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 87 transition count 109
Applied a total of 100 rules in 13 ms. Remains 87 /128 variables (removed 41) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-20 12:40:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:40:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 12:40:01] [INFO ] Invariant cache hit.
[2023-03-20 12:40:01] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:40:01] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-20 12:40:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:40:01] [INFO ] Invariant cache hit.
[2023-03-20 12:40:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/128 places, 109/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 87/128 places, 109/240 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s81 1)), p0:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 finished in 410 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((G(p1)||p0))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 115 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 115 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 115 transition count 135
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 103 transition count 123
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 103 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 103 transition count 116
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 93 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 93 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 93 transition count 100
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 89 place count 88 transition count 95
Iterating global reduction 3 with 5 rules applied. Total rules applied 94 place count 88 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 84 transition count 91
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 84 transition count 91
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 81 transition count 87
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 81 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 81 transition count 85
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 78 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 77 transition count 81
Applied a total of 118 rules in 23 ms. Remains 77 /128 variables (removed 51) and now considering 81/240 (removed 159) transitions.
// Phase 1: matrix 81 rows 77 cols
[2023-03-20 12:40:01] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:40:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 12:40:01] [INFO ] Invariant cache hit.
[2023-03-20 12:40:01] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:40:01] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-20 12:40:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:40:01] [INFO ] Invariant cache hit.
[2023-03-20 12:40:02] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/128 places, 81/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 77/128 places, 81/240 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s23 1)), p0:(OR (LT s1 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22937 reset in 130 ms.
Product exploration explored 100000 steps with 22888 reset in 131 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:40:02] [INFO ] Invariant cache hit.
[2023-03-20 12:40:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:40:02] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:40:02] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-20 12:40:02] [INFO ] Invariant cache hit.
[2023-03-20 12:40:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 12:40:03] [INFO ] Invariant cache hit.
[2023-03-20 12:40:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:40:03] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-20 12:40:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:40:03] [INFO ] Invariant cache hit.
[2023-03-20 12:40:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 77/77 places, 81/81 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22931 reset in 79 ms.
Product exploration explored 100000 steps with 23017 reset in 186 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-20 12:40:03] [INFO ] Invariant cache hit.
[2023-03-20 12:40:03] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:40:03] [INFO ] Invariant cache hit.
[2023-03-20 12:40:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:40:03] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-20 12:40:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:40:03] [INFO ] Invariant cache hit.
[2023-03-20 12:40:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 77/77 places, 81/81 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 finished in 2233 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(G(p1))&&p0)))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 107 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 99 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 96 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 92 transition count 118
Applied a total of 86 rules in 5 ms. Remains 92 /128 variables (removed 36) and now considering 118/240 (removed 122) transitions.
// Phase 1: matrix 118 rows 92 cols
[2023-03-20 12:40:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:40:04] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-20 12:40:04] [INFO ] Invariant cache hit.
[2023-03-20 12:40:04] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:40:04] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-20 12:40:04] [INFO ] Invariant cache hit.
[2023-03-20 12:40:04] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/128 places, 118/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 92/128 places, 118/240 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s12 1) (GEQ s28 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], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 428 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((p0&&G(p1))))'
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)))'
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((G(p1)||p0))))'
[2023-03-20 12:40:04] [INFO ] Flatten gal took : 23 ms
[2023-03-20 12:40:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 12:40:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 240 transitions and 948 arcs took 4 ms.
Total runtime 51700 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1483/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1483/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1483/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13

BK_STOP 1679316005357

--------------------
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
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
ltl formula formula --ltl=/tmp/1483/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 128 places, 240 transitions and 948 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1483/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1483/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1483/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1483/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
ltl formula formula --ltl=/tmp/1483/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 128 places, 240 transitions and 948 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1483/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1483/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1483/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1483/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
ltl formula formula --ltl=/tmp/1483/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 128 places, 240 transitions and 948 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1483/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1483/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1483/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1483/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-d1m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r425-tajo-167905978200428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m36.tgz
mv SieveSingleMsgMbox-PT-d1m36 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 ;