Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282900908.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900908
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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-d1m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654951285755

Running Version 202205111006
[2022-06-11 12:41:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 12:41:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 12:41:27] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2022-06-11 12:41:27] [INFO ] Transformed 1295 places.
[2022-06-11 12:41:27] [INFO ] Transformed 749 transitions.
[2022-06-11 12:41:27] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 228 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 10 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 306 place count 193 transition count 368
Iterating global reduction 1 with 49 rules applied. Total rules applied 355 place count 193 transition count 368
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 362 place count 193 transition count 361
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 391 place count 164 transition count 332
Iterating global reduction 2 with 29 rules applied. Total rules applied 420 place count 164 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 426 place count 164 transition count 326
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 446 place count 144 transition count 304
Iterating global reduction 3 with 20 rules applied. Total rules applied 466 place count 144 transition count 304
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 505 place count 144 transition count 265
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 510 place count 139 transition count 254
Iterating global reduction 4 with 5 rules applied. Total rules applied 515 place count 139 transition count 254
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 520 place count 134 transition count 249
Iterating global reduction 4 with 5 rules applied. Total rules applied 525 place count 134 transition count 249
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 528 place count 131 transition count 245
Iterating global reduction 4 with 3 rules applied. Total rules applied 531 place count 131 transition count 245
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 533 place count 129 transition count 243
Iterating global reduction 4 with 2 rules applied. Total rules applied 535 place count 129 transition count 243
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 537 place count 127 transition count 241
Iterating global reduction 4 with 2 rules applied. Total rules applied 539 place count 127 transition count 241
Applied a total of 539 rules in 92 ms. Remains 127 /259 variables (removed 132) and now considering 241/749 (removed 508) transitions.
// Phase 1: matrix 241 rows 127 cols
[2022-06-11 12:41:27] [INFO ] Computed 5 place invariants in 19 ms
[2022-06-11 12:41:27] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 241 rows 127 cols
[2022-06-11 12:41:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 12:41:27] [INFO ] State equation strengthened by 153 read => feed constraints.
[2022-06-11 12:41:28] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 127 cols
[2022-06-11 12:41:28] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 12:41:28] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/259 places, 241/749 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/259 places, 241/749 transitions.
Support contains 23 out of 127 places after structural reductions.
[2022-06-11 12:41:28] [INFO ] Flatten gal took : 49 ms
[2022-06-11 12:41:28] [INFO ] Flatten gal took : 18 ms
[2022-06-11 12:41:28] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 21 out of 127 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 119 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 290796 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{1=1, 2=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 11=1, 14=1, 17=1, 18=1, 19=1}
Probabilistic random walk after 290796 steps, saw 133548 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :13
Running SMT prover for 7 properties.
// Phase 1: matrix 241 rows 127 cols
[2022-06-11 12:41:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:41:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:32] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-06-11 12:41:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 12:41:32] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-06-11 12:41:32] [INFO ] State equation strengthened by 153 read => feed constraints.
[2022-06-11 12:41:33] [INFO ] After 259ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2022-06-11 12:41:33] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 4 ms to minimize.
[2022-06-11 12:41:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-06-11 12:41:33] [INFO ] After 889ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 340 ms.
[2022-06-11 12:41:34] [INFO ] After 1514ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 241/241 transitions.
Graph (complete) has 441 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 239
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 117 transition count 167
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 117 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 117 transition count 163
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 109 transition count 155
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 109 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 48 place count 109 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 104 transition count 143
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 104 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 104 transition count 141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 103 transition count 140
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 102 transition count 139
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 102 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 101 transition count 138
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 101 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 70 place count 101 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 100 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 100 transition count 133
Applied a total of 72 rules in 47 ms. Remains 100 /127 variables (removed 27) and now considering 133/241 (removed 108) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/127 places, 133/241 transitions.
Incomplete random walk after 10000 steps, including 2181 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1057 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 472102 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{3=1}
Probabilistic random walk after 472102 steps, saw 198287 distinct states, run finished after 3002 ms. (steps per millisecond=157 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 133 rows 100 cols
[2022-06-11 12:41:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:38] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 12:41:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:38] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 12:41:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-11 12:41:38] [INFO ] After 102ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 12:41:38] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2022-06-11 12:41:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-06-11 12:41:38] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-11 12:41:38] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 78 ms.
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 133/133 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 124
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 98 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 97 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 97 transition count 122
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 97 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 96 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 96 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 95 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 95 transition count 119
Applied a total of 12 rules in 27 ms. Remains 95 /100 variables (removed 5) and now considering 119/133 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/100 places, 119/133 transitions.
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1078 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 367482 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367482 steps, saw 166612 distinct states, run finished after 3002 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 119 rows 95 cols
[2022-06-11 12:41:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:42] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 12:41:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:42] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 12:41:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-11 12:41:43] [INFO ] After 82ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 12:41:43] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2022-06-11 12:41:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-11 12:41:43] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-06-11 12:41:43] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 76 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 119/119 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 95 cols
[2022-06-11 12:41:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:43] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 119 rows 95 cols
[2022-06-11 12:41:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-11 12:41:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2022-06-11 12:41:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 119 rows 95 cols
[2022-06-11 12:41:43] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:41:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 119/119 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 95 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 90 transition count 113
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 90 transition count 100
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 77 transition count 100
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 69 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 55 place count 68 transition count 92
Applied a total of 55 rules in 14 ms. Remains 68 /95 variables (removed 27) and now considering 92/119 (removed 27) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 92 rows 68 cols
[2022-06-11 12:41:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:41:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:43] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 12:41:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 12:41:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:43] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 12:41:44] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-06-11 12:41:44] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-06-11 12:41:44] [INFO ] Flatten gal took : 13 ms
[2022-06-11 12:41:44] [INFO ] Flatten gal took : 9 ms
[2022-06-11 12:41:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10077545564530666923.gal : 3 ms
[2022-06-11 12:41:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9832205470709776666.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms327010230548683600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10077545564530666923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9832205470709776666.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9832205470709776666.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :8 after 22
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :22 after 35
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :35 after 131
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :131 after 230
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :230 after 311
Reachability property AtomicPropp16 is true.
Reachability property AtomicPropp3 is true.
Reachability property AtomicPropp0 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :311 after 1205
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1205 after 2219
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2219 after 10364
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10364 after 54674
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :54674 after 423528
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :423528 after 2.57755e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.57755e+06 after 5.65139e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.60536e+06,1.30866,40272,2,6395,20,127715,8,0,365,119510,0
Total reachable state count : 8605355

Verifying 5 reachability properties.
Reachability property AtomicPropp0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp0,266,1.31027,40272,2,440,20,127715,9,0,369,119510,0
Reachability property AtomicPropp3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp3,2,1.31074,40272,2,79,20,127715,10,0,372,119510,0
Reachability property AtomicPropp8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp8,200,1.31103,40272,2,321,20,127715,10,0,373,119510,0
Reachability property AtomicPropp13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp13,200,1.31125,40272,2,321,20,127715,10,0,374,119510,0
Reachability property AtomicPropp16 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp16,266,1.31151,40272,2,440,20,127715,10,0,374,119510,0
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 18 stabilizing places and 20 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(X(G(!p0))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 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 27 place count 114 transition count 137
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 102 transition count 125
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 102 transition count 125
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 61 place count 102 transition count 115
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 95 transition count 108
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 95 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 95 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 92 transition count 101
Iterating global reduction 3 with 3 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 21 ms. Remains 85 /127 variables (removed 42) and now considering 92/241 (removed 149) transitions.
// Phase 1: matrix 92 rows 85 cols
[2022-06-11 12:41:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:45] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 92 rows 85 cols
[2022-06-11 12:41:45] [INFO ] Computed 5 place invariants in 11 ms
[2022-06-11 12:41:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 12:41:45] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-06-11 12:41:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 85 cols
[2022-06-11 12:41:45] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 12:41:46] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/127 places, 92/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/127 places, 92/241 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 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 p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 finished in 523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&F((X(p2)||p1)))))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 115 transition count 146
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 115 transition count 146
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 115 transition count 144
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 104 transition count 133
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 104 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 55 place count 104 transition count 126
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 97 transition count 119
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 97 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 97 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 95 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 93 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 92 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 92 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 91 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 91 transition count 107
Applied a total of 87 rules in 18 ms. Remains 91 /127 variables (removed 36) and now considering 107/241 (removed 134) transitions.
// Phase 1: matrix 107 rows 91 cols
[2022-06-11 12:41:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:46] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 107 rows 91 cols
[2022-06-11 12:41:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:46] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 12:41:46] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 91 cols
[2022-06-11 12:41:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:46] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/127 places, 107/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/127 places, 107/241 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s28 1) (GEQ s1 1) (GEQ s86 1)) (AND (GEQ s1 1) (GEQ s77 1))), p0:(AND (GEQ s1 1) (GEQ s86 1)), p2:(AND (GEQ s8 1) (GEQ s28 1))...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 finished in 533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(p1)&&p0))||p1))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 145
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 143
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 102 transition count 131
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 102 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 102 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 95 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 95 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 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 96 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 84 transition count 98
Applied a total of 102 rules in 16 ms. Remains 84 /127 variables (removed 43) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:46] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:41:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:41:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:47] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/127 places, 98/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/127 places, 98/241 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s79 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][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 145
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 143
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 102 transition count 131
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 102 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 102 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 95 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 95 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 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 96 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 84 transition count 98
Applied a total of 102 rules in 27 ms. Remains 84 /127 variables (removed 43) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:47] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:41:47] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:41:47] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-06-11 12:41:47] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/127 places, 98/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/127 places, 98/241 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 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:(OR (LT s1 1) (LT s79 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]]
Product exploration explored 100000 steps with 22501 reset in 322 ms.
Product exploration explored 100000 steps with 22390 reset in 157 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2259 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 473 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4097 steps, run visited all 1 properties in 30 ms. (steps per millisecond=136 )
Probabilistic random walk after 4097 steps, saw 1879 distinct states, run finished after 30 ms. (steps per millisecond=136 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (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 4 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:48] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:41:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:41:48] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-06-11 12:41:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:41:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:41:48] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4097 steps, run visited all 1 properties in 15 ms. (steps per millisecond=273 )
Probabilistic random walk after 4097 steps, saw 1879 distinct states, run finished after 15 ms. (steps per millisecond=273 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22556 reset in 102 ms.
Product exploration explored 100000 steps with 22369 reset in 128 ms.
Built C files in :
/tmp/ltsmin277360639809367992
[2022-06-11 12:41:49] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2022-06-11 12:41:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:41:49] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2022-06-11 12:41:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:41:49] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2022-06-11 12:41:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:41:49] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin277360639809367992
Running compilation step : cd /tmp/ltsmin277360639809367992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin277360639809367992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin277360639809367992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6064241007580481922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:42:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:42:04] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:42:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:42:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:42:04] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-06-11 12:42:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:42:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:42:04] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 98/98 transitions.
Built C files in :
/tmp/ltsmin14897905495741091177
[2022-06-11 12:42:04] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2022-06-11 12:42:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:42:04] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2022-06-11 12:42:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:42:04] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2022-06-11 12:42:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:42:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14897905495741091177
Running compilation step : cd /tmp/ltsmin14897905495741091177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 211 ms.
Running link step : cd /tmp/ltsmin14897905495741091177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14897905495741091177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8978573779858393166.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 12:42:20] [INFO ] Flatten gal took : 7 ms
[2022-06-11 12:42:20] [INFO ] Flatten gal took : 6 ms
[2022-06-11 12:42:20] [INFO ] Time to serialize gal into /tmp/LTL15488339163665044546.gal : 1 ms
[2022-06-11 12:42:20] [INFO ] Time to serialize properties into /tmp/LTL616261308848086782.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15488339163665044546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL616261308848086782.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1548833...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1187<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l1187<1))"
Reverse transition relation is NOT exact ! Due to transitions t50, t51, t52, t59, t64, t95, t105, t202, t203, t204, t205, t206, t207, t208, t211, t214, t21...292
Computing Next relation with stutter on 1.22851e+10 deadlock states
Detected timeout of ITS tools.
[2022-06-11 12:42:35] [INFO ] Flatten gal took : 14 ms
[2022-06-11 12:42:35] [INFO ] Applying decomposition
[2022-06-11 12:42:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2688022588717583100.txt' '-o' '/tmp/graph2688022588717583100.bin' '-w' '/tmp/graph2688022588717583100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2688022588717583100.bin' '-l' '-1' '-v' '-w' '/tmp/graph2688022588717583100.weights' '-q' '0' '-e' '0.001'
[2022-06-11 12:42:35] [INFO ] Decomposing Gal with order
[2022-06-11 12:42:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 12:42:35] [INFO ] Removed a total of 87 redundant transitions.
[2022-06-11 12:42:35] [INFO ] Flatten gal took : 64 ms
[2022-06-11 12:42:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 7 ms.
[2022-06-11 12:42:35] [INFO ] Time to serialize gal into /tmp/LTL15624521828877963273.gal : 2 ms
[2022-06-11 12:42:35] [INFO ] Time to serialize properties into /tmp/LTL6142449812429004187.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15624521828877963273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6142449812429004187.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1562452...246
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i1.u0.s1<1)||(u17.l1187<1))"))))
Formula 0 simplified : !GF"((i4.i1.u0.s1<1)||(u17.l1187<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7814396787807732154
[2022-06-11 12:42:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7814396787807732154
Running compilation step : cd /tmp/ltsmin7814396787807732154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 174 ms.
Running link step : cd /tmp/ltsmin7814396787807732154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7814396787807732154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 finished in 78433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U X(F(G((!p1 U p0))))))) U p2))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 116 transition count 165
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 116 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 116 transition count 161
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 106 transition count 151
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 106 transition count 151
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 52 place count 106 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 101 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 101 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 99 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 99 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 97 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 94 transition count 129
Applied a total of 79 rules in 24 ms. Remains 94 /127 variables (removed 33) and now considering 129/241 (removed 112) transitions.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 12:43:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:05] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 12:43:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-11 12:43:05] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2022-06-11 12:43:05] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 12:43:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:05] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/127 places, 129/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/127 places, 129/241 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s1 1) (GEQ s89 1)) (AND (GEQ s1 1) (GEQ s87 1))), p0:(AND (GEQ s5 1) (GEQ s37 1)), p1:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 finished in 510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(G(X(F(X(F(X(p0)))))))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 transition count 136
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 101 transition count 123
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 101 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 101 transition count 114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 93 transition count 106
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 93 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 93 transition count 101
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 89 transition count 97
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 89 transition count 97
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 85 transition count 93
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 85 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 82 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 82 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 82 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 79 transition count 84
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 78 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 78 transition count 83
Applied a total of 114 rules in 22 ms. Remains 78 /127 variables (removed 49) and now considering 83/241 (removed 158) transitions.
// Phase 1: matrix 83 rows 78 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 83 rows 78 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-11 12:43:06] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2022-06-11 12:43:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 83 rows 78 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/127 places, 83/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/127 places, 83/241 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 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 s67 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-d1m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 finished in 329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(X(p0)) U !p1)))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 115 transition count 146
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 115 transition count 146
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 115 transition count 144
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 104 transition count 133
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 104 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 55 place count 104 transition count 126
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 97 transition count 119
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 97 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 97 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 94 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 94 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 91 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 91 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 89 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 86 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 86 transition count 101
Applied a total of 97 rules in 6 ms. Remains 86 /127 variables (removed 41) and now considering 101/241 (removed 140) transitions.
// Phase 1: matrix 101 rows 86 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 101 rows 86 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 12:43:06] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 86 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/127 places, 101/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/127 places, 101/241 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s81 1)), p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 finished in 392 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(p1) U p2)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 116 transition count 165
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 116 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 116 transition count 161
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 106 transition count 151
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 106 transition count 151
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 53 place count 106 transition count 144
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 100 transition count 138
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 100 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 100 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 98 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 98 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 96 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 95 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 94 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 93 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 93 transition count 127
Applied a total of 82 rules in 17 ms. Remains 93 /127 variables (removed 34) and now considering 127/241 (removed 114) transitions.
// Phase 1: matrix 127 rows 93 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 127 rows 93 cols
[2022-06-11 12:43:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-11 12:43:07] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2022-06-11 12:43:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 127 rows 93 cols
[2022-06-11 12:43:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:43:07] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/127 places, 127/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/127 places, 127/241 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p2:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (G(X(!p0))&&p1))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 115 transition count 148
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 115 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 26 place count 115 transition count 146
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 104 transition count 135
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 104 transition count 135
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 57 place count 104 transition count 126
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 98 transition count 120
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 98 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 98 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 96 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 96 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 94 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 94 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 93 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 93 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 92 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 92 transition count 109
Applied a total of 86 rules in 18 ms. Remains 92 /127 variables (removed 35) and now considering 109/241 (removed 132) transitions.
// Phase 1: matrix 109 rows 92 cols
[2022-06-11 12:43:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:07] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 109 rows 92 cols
[2022-06-11 12:43:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 12:43:07] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 92 cols
[2022-06-11 12:43:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:07] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/127 places, 109/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/127 places, 109/241 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 18 stabilizing places and 20 stable transitions
Computed a total of 18 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 finished in 999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(X(p0))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 145
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 143
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 102 transition count 131
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 102 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 102 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 95 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 95 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 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 96 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 84 transition count 98
Applied a total of 102 rules in 28 ms. Remains 84 /127 variables (removed 43) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:08] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:43:08] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-06-11 12:43:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/127 places, 98/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/127 places, 98/241 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&(!(G(!p1) U p0)||F(p2))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 145
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 143
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 102 transition count 131
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 102 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 102 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 95 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 95 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 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 96 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 84 transition count 98
Applied a total of 102 rules in 16 ms. Remains 84 /127 variables (removed 43) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:08] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:43:08] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:08] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/127 places, 98/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/127 places, 98/241 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s33 1)), p1:(AND (GEQ s1 1) (GEQ s79 1)), p2:(AND (GEQ s20 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 finished in 409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 145
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 143
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 102 transition count 131
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 102 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 102 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 95 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 95 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 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 96 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 84 transition count 98
Applied a total of 102 rules in 16 ms. Remains 84 /127 variables (removed 43) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:09] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:43:09] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:09] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/127 places, 98/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/127 places, 98/241 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 145
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 114 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 143
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 102 transition count 131
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 102 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 102 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 95 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 95 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 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 96 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 84 transition count 98
Applied a total of 102 rules in 11 ms. Remains 84 /127 variables (removed 43) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:09] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:43:09] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:43:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:43:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/127 places, 98/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/127 places, 98/241 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s78 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][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-06-11 12:43:09] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11651107234250859942
[2022-06-11 12:43:09] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2022-06-11 12:43:09] [INFO ] Applying decomposition
[2022-06-11 12:43:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:43:09] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2022-06-11 12:43:09] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:43:09] [INFO ] Flatten gal took : 14 ms
[2022-06-11 12:43:09] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11151152520600726443.txt' '-o' '/tmp/graph11151152520600726443.bin' '-w' '/tmp/graph11151152520600726443.weights'
[2022-06-11 12:43:09] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11151152520600726443.bin' '-l' '-1' '-v' '-w' '/tmp/graph11151152520600726443.weights' '-q' '0' '-e' '0.001'
[2022-06-11 12:43:09] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11651107234250859942
Running compilation step : cd /tmp/ltsmin11651107234250859942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 12:43:09] [INFO ] Decomposing Gal with order
[2022-06-11 12:43:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 12:43:09] [INFO ] Removed a total of 147 redundant transitions.
[2022-06-11 12:43:09] [INFO ] Flatten gal took : 25 ms
[2022-06-11 12:43:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 6 ms.
[2022-06-11 12:43:09] [INFO ] Time to serialize gal into /tmp/LTLFireability1584721865534036222.gal : 4 ms
[2022-06-11 12:43:09] [INFO ] Time to serialize properties into /tmp/LTLFireability917558443668905179.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1584721865534036222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability917558443668905179.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((u0.s1<1)||(u0.l1187<1))"))))
Formula 0 simplified : !GF"((u0.s1<1)||(u0.l1187<1))"
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin11651107234250859942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11651107234250859942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 13:03:44] [INFO ] Flatten gal took : 15 ms
[2022-06-11 13:03:44] [INFO ] Time to serialize gal into /tmp/LTLFireability17982880151710540892.gal : 2 ms
[2022-06-11 13:03:44] [INFO ] Time to serialize properties into /tmp/LTLFireability623117080944516650.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17982880151710540892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability623117080944516650.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1187<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l1187<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 242, guards 241
pins2lts-mc-linux64( 4/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.046: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.054: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.054: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.058: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.058: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.062: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.062: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.072: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.072: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.072: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.145: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.146: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.151: There are 244 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.151: State length is 128, there are 244 groups
pins2lts-mc-linux64( 0/ 8), 0.151: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.151: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.151: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.151: Visible groups: 0 / 244, labels: 1 / 244
pins2lts-mc-linux64( 0/ 8), 0.151: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.151: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.188: [Blue] ~48 levels ~960 states ~2392 transitions
pins2lts-mc-linux64( 5/ 8), 0.216: [Blue] ~47 levels ~1920 states ~5000 transitions
pins2lts-mc-linux64( 0/ 8), 0.257: [Blue] ~92 levels ~3840 states ~9392 transitions
pins2lts-mc-linux64( 1/ 8), 0.326: [Blue] ~104 levels ~7680 states ~18264 transitions
pins2lts-mc-linux64( 0/ 8), 0.616: [Blue] ~136 levels ~15360 states ~35720 transitions
pins2lts-mc-linux64( 0/ 8), 0.928: [Blue] ~136 levels ~30720 states ~67472 transitions
pins2lts-mc-linux64( 0/ 8), 1.588: [Blue] ~136 levels ~61440 states ~135000 transitions
pins2lts-mc-linux64( 0/ 8), 4.090: [Blue] ~180 levels ~122880 states ~265920 transitions
pins2lts-mc-linux64( 3/ 8), 9.587: [Blue] ~607 levels ~245760 states ~538904 transitions
pins2lts-mc-linux64( 3/ 8), 14.157: [Blue] ~607 levels ~491520 states ~1083096 transitions
pins2lts-mc-linux64( 6/ 8), 21.245: [Blue] ~2027 levels ~983040 states ~2079544 transitions
pins2lts-mc-linux64( 6/ 8), 32.478: [Blue] ~3333 levels ~1966080 states ~4191592 transitions
pins2lts-mc-linux64( 0/ 8), 59.746: [Blue] ~400 levels ~3932160 states ~8703664 transitions
pins2lts-mc-linux64( 2/ 8), 120.240: [Blue] ~10461 levels ~7864320 states ~16922248 transitions
pins2lts-mc-linux64( 2/ 8), 239.702: [Blue] ~13502 levels ~15728640 states ~33895224 transitions
pins2lts-mc-linux64( 2/ 8), 474.696: [Blue] ~29926 levels ~31457280 states ~68186872 transitions
pins2lts-mc-linux64( 2/ 8), 972.538: [Blue] ~83478 levels ~62914560 states ~138059176 transitions
pins2lts-mc-linux64( 0/ 8), 1812.721: [Blue] ~42290 levels ~125829120 states ~279562600 transitions
pins2lts-mc-linux64( 4/ 8), 1935.688: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1935.859:
pins2lts-mc-linux64( 0/ 8), 1935.859: Explored 128075982 states 295257959 transitions, fanout: 2.305
pins2lts-mc-linux64( 0/ 8), 1935.859: Total exploration time 1935.700 sec (1935.500 sec minimum, 1935.595 sec on average)
pins2lts-mc-linux64( 0/ 8), 1935.859: States per second: 66165, Transitions per second: 152533
pins2lts-mc-linux64( 0/ 8), 1935.859:
pins2lts-mc-linux64( 0/ 8), 1935.859: State space has 134217478 states, 66465 are accepting
pins2lts-mc-linux64( 0/ 8), 1935.859: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1935.859: blue states: 128075982 (95.42%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1935.859: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1935.859: all-red states: 66465 (0.05%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1935.859:
pins2lts-mc-linux64( 0/ 8), 1935.859: Total memory used for local state coloring: 19.0MB
pins2lts-mc-linux64( 0/ 8), 1935.859:
pins2lts-mc-linux64( 0/ 8), 1935.859: Queue width: 8B, total height: 1246393, memory: 9.51MB
pins2lts-mc-linux64( 0/ 8), 1935.859: Tree memory: 1214.9MB, 9.5 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 1935.859: Tree fill ratio (roots/leafs): 99.0%/74.0%
pins2lts-mc-linux64( 0/ 8), 1935.859: Stored 241 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1935.859: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1935.859: Est. total memory use: 1224.4MB (~1033.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11651107234250859942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11651107234250859942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 13:24:18] [INFO ] Flatten gal took : 11 ms
[2022-06-11 13:24:18] [INFO ] Input system was already deterministic with 241 transitions.
[2022-06-11 13:24:18] [INFO ] Transformed 127 places.
[2022-06-11 13:24:18] [INFO ] Transformed 241 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 13:24:18] [INFO ] Time to serialize gal into /tmp/LTLFireability10059481193286021546.gal : 2 ms
[2022-06-11 13:24:18] [INFO ] Time to serialize properties into /tmp/LTLFireability6027145206930958978.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10059481193286021546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6027145206930958978.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s1<1)||(l1187<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l1187<1))"

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d1m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m18, 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 r312-tall-165472282900908"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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