Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r395-smll-171683823900078.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823900078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 19:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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-d2m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716938873964

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 23:27:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 23:27:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:27:56] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2024-05-28 23:27:56] [INFO ] Transformed 2398 places.
[2024-05-28 23:27:56] [INFO ] Transformed 1954 transitions.
[2024-05-28 23:27:56] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 85 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 958 place count 284 transition count 558
Iterating global reduction 1 with 105 rules applied. Total rules applied 1063 place count 284 transition count 558
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1071 place count 284 transition count 550
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1149 place count 206 transition count 472
Iterating global reduction 2 with 78 rules applied. Total rules applied 1227 place count 206 transition count 472
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1260 place count 206 transition count 439
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1286 place count 180 transition count 408
Iterating global reduction 3 with 26 rules applied. Total rules applied 1312 place count 180 transition count 408
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 1357 place count 180 transition count 363
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1362 place count 175 transition count 354
Iterating global reduction 4 with 5 rules applied. Total rules applied 1367 place count 175 transition count 354
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1372 place count 170 transition count 349
Iterating global reduction 4 with 5 rules applied. Total rules applied 1377 place count 170 transition count 349
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1379 place count 168 transition count 347
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 168 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1382 place count 167 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 1383 place count 167 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1384 place count 166 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 1385 place count 166 transition count 345
Applied a total of 1385 rules in 141 ms. Remains 166 /414 variables (removed 248) and now considering 345/1954 (removed 1609) transitions.
// Phase 1: matrix 345 rows 166 cols
[2024-05-28 23:27:57] [INFO ] Computed 5 invariants in 36 ms
[2024-05-28 23:27:58] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-28 23:27:58] [INFO ] Invariant cache hit.
[2024-05-28 23:27:58] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-05-28 23:27:59] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2024-05-28 23:27:59] [INFO ] Invariant cache hit.
[2024-05-28 23:27:59] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/414 places, 345/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2009 ms. Remains : 166/414 places, 345/1954 transitions.
Support contains 24 out of 166 places after structural reductions.
[2024-05-28 23:27:59] [INFO ] Flatten gal took : 78 ms
[2024-05-28 23:27:59] [INFO ] Flatten gal took : 37 ms
[2024-05-28 23:27:59] [INFO ] Input system was already deterministic with 345 transitions.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 876 ms. (steps per millisecond=11 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 198786 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{0=1, 1=1, 2=1, 3=1, 7=1, 9=1, 12=1, 13=1, 19=1, 22=1}
Probabilistic random walk after 198786 steps, saw 88944 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :10
Running SMT prover for 13 properties.
[2024-05-28 23:28:04] [INFO ] Invariant cache hit.
[2024-05-28 23:28:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:04] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 23:28:05] [INFO ] After 1003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-28 23:28:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 23:28:06] [INFO ] After 694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-28 23:28:06] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-05-28 23:28:07] [INFO ] After 1389ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-28 23:28:08] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 7 ms to minimize.
[2024-05-28 23:28:08] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-28 23:28:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2024-05-28 23:28:09] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 23:28:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-28 23:28:09] [INFO ] After 3422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1511 ms.
[2024-05-28 23:28:11] [INFO ] After 5852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 374 ms.
Support contains 13 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 345/345 transitions.
Graph (complete) has 612 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 165 transition count 343
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 155 transition count 276
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 155 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 29 place count 155 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 150 transition count 264
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 150 transition count 264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 150 transition count 261
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 148 transition count 257
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 148 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 148 transition count 255
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 147 transition count 254
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 147 transition count 254
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 146 transition count 253
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 146 transition count 253
Applied a total of 52 rules in 82 ms. Remains 146 /166 variables (removed 20) and now considering 253/345 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 146/166 places, 253/345 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1015 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 234674 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{6=1, 10=1}
Probabilistic random walk after 234674 steps, saw 102079 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :2
Running SMT prover for 11 properties.
// Phase 1: matrix 253 rows 146 cols
[2024-05-28 23:28:16] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 23:28:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 23:28:17] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 23:28:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 23:28:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 23:28:17] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 23:28:17] [INFO ] State equation strengthened by 146 read => feed constraints.
[2024-05-28 23:28:18] [INFO ] After 694ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-28 23:28:18] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 4 ms to minimize.
[2024-05-28 23:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-28 23:28:19] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2024-05-28 23:28:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-28 23:28:19] [INFO ] After 2072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 574 ms.
[2024-05-28 23:28:20] [INFO ] After 3259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 12 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 253/253 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 145 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 144 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 144 transition count 238
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 144 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 143 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 143 transition count 235
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 143 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 142 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 142 transition count 233
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 141 transition count 232
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 141 transition count 232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 140 transition count 231
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 140 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 140 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 139 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 139 transition count 224
Applied a total of 22 rules in 53 ms. Remains 139 /146 variables (removed 7) and now considering 224/253 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 139/146 places, 224/253 transitions.
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 226660 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226660 steps, saw 100819 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 224 rows 139 cols
[2024-05-28 23:28:25] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 23:28:25] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 23:28:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:28:25] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 23:28:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 23:28:26] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 23:28:26] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-28 23:28:26] [INFO ] After 750ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-28 23:28:27] [INFO ] After 1756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1004 ms.
[2024-05-28 23:28:28] [INFO ] After 3279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 121 ms.
Support contains 12 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 224/224 transitions.
Applied a total of 0 rules in 13 ms. Remains 139 /139 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 139/139 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 224/224 transitions.
Applied a total of 0 rules in 12 ms. Remains 139 /139 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-28 23:28:29] [INFO ] Invariant cache hit.
[2024-05-28 23:28:29] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 23:28:29] [INFO ] Invariant cache hit.
[2024-05-28 23:28:29] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-28 23:28:29] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2024-05-28 23:28:29] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 23:28:29] [INFO ] Invariant cache hit.
[2024-05-28 23:28:30] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 967 ms. Remains : 139/139 places, 224/224 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 139 transition count 217
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 133 transition count 217
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 13 place count 133 transition count 196
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 55 place count 112 transition count 196
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 105 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 104 transition count 199
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 104 transition count 199
Applied a total of 73 rules in 36 ms. Remains 104 /139 variables (removed 35) and now considering 199/224 (removed 25) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 199 rows 104 cols
[2024-05-28 23:28:30] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 23:28:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:28:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:28:30] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 23:28:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:28:31] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 23:28:31] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-28 23:28:31] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-28 23:28:31] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-28 23:28:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2024-05-28 23:28:31] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 23:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-28 23:28:31] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-28 23:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-28 23:28:31] [INFO ] After 1074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 325 ms.
[2024-05-28 23:28:32] [INFO ] After 1506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Computed a total of 44 stabilizing places and 65 stable transitions
Graph (complete) has 671 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G((p1&&F(p2))))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 205
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 149 transition count 200
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 136 transition count 186
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 136 transition count 186
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 136 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 127 transition count 167
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 127 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 95 place count 127 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 122 transition count 155
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 122 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 117 transition count 149
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 117 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 114 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 114 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 111 transition count 139
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 109 transition count 137
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 109 transition count 137
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 108 transition count 136
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 108 transition count 136
Applied a total of 135 rules in 18 ms. Remains 108 /166 variables (removed 58) and now considering 136/345 (removed 209) transitions.
// Phase 1: matrix 136 rows 108 cols
[2024-05-28 23:28:32] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:28:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 23:28:32] [INFO ] Invariant cache hit.
[2024-05-28 23:28:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 23:28:33] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-28 23:28:33] [INFO ] Invariant cache hit.
[2024-05-28 23:28:33] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/166 places, 136/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 108/166 places, 136/345 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 375 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(OR (LT s1 1) (LT s107 1)), p0:(AND (GEQ s28 1) (GEQ s53 1)), p2:(AND (GEQ s1 1) (GEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 1144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(!X(X(p0)))) U X(p1))&&F(p1)))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 148 transition count 191
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 148 transition count 191
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 148 transition count 186
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 134 transition count 170
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 134 transition count 170
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 134 transition count 163
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 125 transition count 148
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 125 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 101 place count 125 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 121 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 121 transition count 137
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 113 place count 117 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 117 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 115 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 115 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 115 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 124 place count 113 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 113 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 112 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 112 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 111 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 111 transition count 124
Applied a total of 130 rules in 21 ms. Remains 111 /166 variables (removed 55) and now considering 124/345 (removed 221) transitions.
// Phase 1: matrix 124 rows 111 cols
[2024-05-28 23:28:33] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:28:33] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 23:28:33] [INFO ] Invariant cache hit.
[2024-05-28 23:28:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 23:28:34] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-28 23:28:34] [INFO ] Invariant cache hit.
[2024-05-28 23:28:34] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/166 places, 124/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 111/166 places, 124/345 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s32 1)), p0:(AND (GEQ s1 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 finished in 796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 147 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 133 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 133 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 133 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 124 transition count 160
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 124 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 124 transition count 153
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 119 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 119 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 114 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 105 transition count 129
Applied a total of 143 rules in 41 ms. Remains 105 /166 variables (removed 61) and now considering 129/345 (removed 216) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 23:28:34] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 23:28:34] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-28 23:28:34] [INFO ] Invariant cache hit.
[2024-05-28 23:28:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:28:35] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-28 23:28:35] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 23:28:35] [INFO ] Invariant cache hit.
[2024-05-28 23:28:35] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/166 places, 129/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 833 ms. Remains : 105/166 places, 129/345 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22440 reset in 377 ms.
Product exploration explored 100000 steps with 22353 reset in 301 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 2091 ms. (steps per millisecond=609 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 2098 ms. (steps per millisecond=607 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-28 23:28:38] [INFO ] Invariant cache hit.
[2024-05-28 23:28:38] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 23:28:38] [INFO ] Invariant cache hit.
[2024-05-28 23:28:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:28:38] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-28 23:28:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 23:28:38] [INFO ] Invariant cache hit.
[2024-05-28 23:28:39] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 2165 ms. (steps per millisecond=588 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 2165 ms. (steps per millisecond=588 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22381 reset in 154 ms.
Product exploration explored 100000 steps with 22491 reset in 168 ms.
Built C files in :
/tmp/ltsmin16517578952603400196
[2024-05-28 23:28:41] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2024-05-28 23:28:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:28:41] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2024-05-28 23:28:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:28:41] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2024-05-28 23:28:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:28:41] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16517578952603400196
Running compilation step : cd /tmp/ltsmin16517578952603400196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 594 ms.
Running link step : cd /tmp/ltsmin16517578952603400196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16517578952603400196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10048822248681418363.hoa' '--buchi-type=spotba'
LTSmin run took 921 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 9166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G(p1))||p0))&&F(p2))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 148 transition count 204
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 148 transition count 204
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 148 transition count 199
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 134 transition count 183
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 134 transition count 183
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 134 transition count 177
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 125 transition count 163
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 125 transition count 163
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 125 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 121 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 121 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 117 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 117 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 114 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 114 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 111 transition count 137
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 109 transition count 135
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 108 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 108 transition count 134
Applied a total of 136 rules in 15 ms. Remains 108 /166 variables (removed 58) and now considering 134/345 (removed 211) transitions.
// Phase 1: matrix 134 rows 108 cols
[2024-05-28 23:28:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:28:43] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 23:28:43] [INFO ] Invariant cache hit.
[2024-05-28 23:28:43] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 23:28:44] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-28 23:28:44] [INFO ] Invariant cache hit.
[2024-05-28 23:28:44] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/166 places, 134/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 108/166 places, 134/345 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (LT s1 1) (LT s103 1)), p1:(AND (GEQ s1 1) (GEQ s96 1)), p0:(OR (LT s1 1) (LT s103 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22427 reset in 311 ms.
Product exploration explored 100000 steps with 22489 reset in 305 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 160 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1909464 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{0=1}
Probabilistic random walk after 1909464 steps, saw 795473 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-28 23:28:48] [INFO ] Invariant cache hit.
[2024-05-28 23:28:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:28:48] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:28:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:28:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:28:48] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:28:48] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 23:28:48] [INFO ] After 29ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:28:48] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 23:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-28 23:28:48] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-28 23:28:48] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 15 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1966121 steps, run timeout after 3001 ms. (steps per millisecond=655 ) properties seen :{}
Probabilistic random walk after 1966121 steps, saw 826840 distinct states, run finished after 3001 ms. (steps per millisecond=655 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2024-05-28 23:28:51] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 23:28:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:28:52] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:28:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:28:52] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:28:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:28:52] [INFO ] After 29ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:28:52] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-28 23:28:52] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-28 23:28:52] [INFO ] Invariant cache hit.
[2024-05-28 23:28:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 23:28:52] [INFO ] Invariant cache hit.
[2024-05-28 23:28:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:28:52] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-28 23:28:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 23:28:52] [INFO ] Invariant cache hit.
[2024-05-28 23:28:52] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 12 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2024-05-28 23:28:52] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 23:28:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:28:52] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:28:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:28:52] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:28:53] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-28 23:28:53] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 13 factoid took 195 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 108 cols
[2024-05-28 23:28:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:28:53] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 23:28:53] [INFO ] Invariant cache hit.
[2024-05-28 23:28:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 23:28:53] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-28 23:28:53] [INFO ] Invariant cache hit.
[2024-05-28 23:28:54] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 108/108 places, 134/134 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 508 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1906034 steps, run timeout after 3001 ms. (steps per millisecond=635 ) properties seen :{0=1}
Probabilistic random walk after 1906034 steps, saw 793958 distinct states, run finished after 3001 ms. (steps per millisecond=635 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-28 23:28:57] [INFO ] Invariant cache hit.
[2024-05-28 23:28:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:28:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:28:57] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:28:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:28:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:28:57] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:28:57] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 23:28:57] [INFO ] After 27ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:28:57] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2024-05-28 23:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-28 23:28:57] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-28 23:28:58] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 14 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1903549 steps, run timeout after 3001 ms. (steps per millisecond=634 ) properties seen :{}
Probabilistic random walk after 1903549 steps, saw 801661 distinct states, run finished after 3001 ms. (steps per millisecond=634 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2024-05-28 23:29:01] [INFO ] Computed 4 invariants in 7 ms
[2024-05-28 23:29:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:29:01] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:29:01] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:29:01] [INFO ] After 30ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:01] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-28 23:29:01] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 13 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-28 23:29:01] [INFO ] Invariant cache hit.
[2024-05-28 23:29:01] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-28 23:29:01] [INFO ] Invariant cache hit.
[2024-05-28 23:29:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:29:02] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-05-28 23:29:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:29:02] [INFO ] Invariant cache hit.
[2024-05-28 23:29:02] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 994 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 74 transition count 106
Applied a total of 61 rules in 16 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2024-05-28 23:29:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 23:29:02] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2024-05-28 23:29:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:29:02] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:29:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:29:02] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:02] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 23:29:02] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22457 reset in 149 ms.
Product exploration explored 100000 steps with 22554 reset in 199 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-28 23:29:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 134 rows 108 cols
[2024-05-28 23:29:04] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:29:04] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 108/108 places, 134/134 transitions.
Built C files in :
/tmp/ltsmin3982815872035804757
[2024-05-28 23:29:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3982815872035804757
Running compilation step : cd /tmp/ltsmin3982815872035804757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 353 ms.
Running link step : cd /tmp/ltsmin3982815872035804757;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3982815872035804757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7546163037991837628.hoa' '--buchi-type=spotba'
LTSmin run took 10286 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 finished in 31607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 147 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 133 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 133 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 133 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 124 transition count 160
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 124 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 124 transition count 153
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 119 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 119 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 114 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 105 transition count 129
Applied a total of 143 rules in 30 ms. Remains 105 /166 variables (removed 61) and now considering 129/345 (removed 216) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 23:29:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:29:15] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-28 23:29:15] [INFO ] Invariant cache hit.
[2024-05-28 23:29:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:29:15] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-28 23:29:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:29:15] [INFO ] Invariant cache hit.
[2024-05-28 23:29:15] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/166 places, 129/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 611 ms. Remains : 105/166 places, 129/345 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 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 s100 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 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 147 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 133 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 133 transition count 180
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 133 transition count 173
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 88 place count 124 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 97 place count 124 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 104 place count 124 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 119 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 119 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 114 transition count 141
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 114 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 111 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 111 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 111 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 108 transition count 131
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 105 transition count 128
Applied a total of 144 rules in 38 ms. Remains 105 /166 variables (removed 61) and now considering 128/345 (removed 217) transitions.
// Phase 1: matrix 128 rows 105 cols
[2024-05-28 23:29:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:29:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 23:29:15] [INFO ] Invariant cache hit.
[2024-05-28 23:29:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:29:16] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-28 23:29:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 23:29:16] [INFO ] Invariant cache hit.
[2024-05-28 23:29:16] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/166 places, 128/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 105/166 places, 128/345 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22512 reset in 160 ms.
Product exploration explored 100000 steps with 22227 reset in 168 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1884611 steps, run timeout after 3001 ms. (steps per millisecond=627 ) properties seen :{}
Probabilistic random walk after 1884611 steps, saw 810609 distinct states, run finished after 3001 ms. (steps per millisecond=627 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 23:29:19] [INFO ] Invariant cache hit.
[2024-05-28 23:29:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:29:20] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:29:20] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:29:20] [INFO ] After 27ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:20] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 23:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-28 23:29:20] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-28 23:29:20] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 128/128 transitions.
Graph (complete) has 306 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 126
Applied a total of 3 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 104/105 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1899279 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :{}
Probabilistic random walk after 1899279 steps, saw 817528 distinct states, run finished after 3001 ms. (steps per millisecond=632 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 126 rows 104 cols
[2024-05-28 23:29:23] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 23:29:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:29:23] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:29:23] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:23] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:29:23] [INFO ] After 39ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:23] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 23:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-28 23:29:23] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-28 23:29:23] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 23:29:23] [INFO ] Invariant cache hit.
[2024-05-28 23:29:23] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 23:29:23] [INFO ] Invariant cache hit.
[2024-05-28 23:29:23] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:29:24] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-28 23:29:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:29:24] [INFO ] Invariant cache hit.
[2024-05-28 23:29:24] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 104/104 places, 126/126 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 119
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 119
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 102
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 74 transition count 105
Applied a total of 61 rules in 11 ms. Remains 74 /104 variables (removed 30) and now considering 105/126 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 74 cols
[2024-05-28 23:29:24] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 23:29:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:29:24] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:29:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:29:24] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:24] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 23:29:24] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 105 cols
[2024-05-28 23:29:24] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:29:24] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-28 23:29:24] [INFO ] Invariant cache hit.
[2024-05-28 23:29:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:29:25] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-28 23:29:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 23:29:25] [INFO ] Invariant cache hit.
[2024-05-28 23:29:25] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 105/105 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1912902 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :{}
Probabilistic random walk after 1912902 steps, saw 821799 distinct states, run finished after 3001 ms. (steps per millisecond=637 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 23:29:28] [INFO ] Invariant cache hit.
[2024-05-28 23:29:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:29:28] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:29:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:29:28] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:29:28] [INFO ] After 27ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:28] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 23:29:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-28 23:29:28] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-28 23:29:28] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 128/128 transitions.
Graph (complete) has 306 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 126
Applied a total of 3 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/105 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 425 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1846873 steps, run timeout after 3001 ms. (steps per millisecond=615 ) properties seen :{}
Probabilistic random walk after 1846873 steps, saw 795647 distinct states, run finished after 3005 ms. (steps per millisecond=614 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 126 rows 104 cols
[2024-05-28 23:29:31] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 23:29:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:29:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:29:32] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:29:32] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:32] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:29:32] [INFO ] After 39ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-28 23:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-28 23:29:32] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-28 23:29:32] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/104 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 23:29:32] [INFO ] Invariant cache hit.
[2024-05-28 23:29:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 23:29:32] [INFO ] Invariant cache hit.
[2024-05-28 23:29:32] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:29:32] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-28 23:29:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:29:32] [INFO ] Invariant cache hit.
[2024-05-28 23:29:32] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 104/104 places, 126/126 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 119
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 119
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 102
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 74 transition count 105
Applied a total of 61 rules in 15 ms. Remains 74 /104 variables (removed 30) and now considering 105/126 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 74 cols
[2024-05-28 23:29:32] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 23:29:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:29:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:29:33] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:29:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:29:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:29:33] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:29:33] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 23:29:33] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22476 reset in 155 ms.
Product exploration explored 100000 steps with 22370 reset in 175 ms.
Built C files in :
/tmp/ltsmin9992990062420007482
[2024-05-28 23:29:33] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-28 23:29:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:29:33] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-28 23:29:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:29:33] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-28 23:29:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:29:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9992990062420007482
Running compilation step : cd /tmp/ltsmin9992990062420007482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin9992990062420007482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9992990062420007482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10983037490644812326.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 105 cols
[2024-05-28 23:29:48] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:29:49] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 23:29:49] [INFO ] Invariant cache hit.
[2024-05-28 23:29:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:29:49] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-28 23:29:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:29:49] [INFO ] Invariant cache hit.
[2024-05-28 23:29:49] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 582 ms. Remains : 105/105 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin8472618580562819983
[2024-05-28 23:29:49] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-28 23:29:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:29:49] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-28 23:29:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:29:49] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-28 23:29:49] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:29:49] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8472618580562819983
Running compilation step : cd /tmp/ltsmin8472618580562819983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 416 ms.
Running link step : cd /tmp/ltsmin8472618580562819983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8472618580562819983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8400774214588407487.hoa' '--buchi-type=spotba'
LTSmin run took 14119 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 finished in 48318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 146 transition count 188
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 146 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 146 transition count 182
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 61 place count 131 transition count 165
Iterating global reduction 1 with 15 rules applied. Total rules applied 76 place count 131 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 131 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 93 place count 121 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 103 place count 121 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 121 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 116 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 116 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 125 place count 111 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 111 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 107 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 107 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 107 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 143 place count 104 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 146 place count 104 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 103 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 103 transition count 114
Applied a total of 148 rules in 23 ms. Remains 103 /166 variables (removed 63) and now considering 114/345 (removed 231) transitions.
// Phase 1: matrix 114 rows 103 cols
[2024-05-28 23:30:04] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:30:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 23:30:04] [INFO ] Invariant cache hit.
[2024-05-28 23:30:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 23:30:05] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2024-05-28 23:30:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:30:05] [INFO ] Invariant cache hit.
[2024-05-28 23:30:05] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/166 places, 114/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1018 ms. Remains : 103/166 places, 114/345 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 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 s59 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-d2m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 finished in 1122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 147 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 133 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 133 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 133 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 124 transition count 160
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 124 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 124 transition count 153
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 119 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 119 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 114 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 105 transition count 129
Applied a total of 143 rules in 28 ms. Remains 105 /166 variables (removed 61) and now considering 129/345 (removed 216) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 23:30:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 23:30:05] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-28 23:30:05] [INFO ] Invariant cache hit.
[2024-05-28 23:30:05] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:30:05] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-28 23:30:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:30:05] [INFO ] Invariant cache hit.
[2024-05-28 23:30:06] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/166 places, 129/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 831 ms. Remains : 105/166 places, 129/345 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-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 s100 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 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 190
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 147 transition count 184
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 132 transition count 167
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 132 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 132 transition count 160
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 122 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 122 transition count 144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 122 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 116 transition count 131
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 116 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 110 transition count 124
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 110 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 106 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 106 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 106 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 102 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 102 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 100 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 99 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 99 transition count 109
Applied a total of 156 rules in 24 ms. Remains 99 /166 variables (removed 67) and now considering 109/345 (removed 236) transitions.
// Phase 1: matrix 109 rows 99 cols
[2024-05-28 23:30:06] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:30:06] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-28 23:30:06] [INFO ] Invariant cache hit.
[2024-05-28 23:30:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 23:30:07] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-28 23:30:07] [INFO ] Invariant cache hit.
[2024-05-28 23:30:07] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/166 places, 109/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 99/166 places, 109/345 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22525 reset in 156 ms.
Product exploration explored 100000 steps with 22547 reset in 156 ms.
Computed a total of 22 stabilizing places and 26 stable transitions
Graph (complete) has 313 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1654 steps, run visited all 1 properties in 9 ms. (steps per millisecond=183 )
Probabilistic random walk after 1654 steps, saw 793 distinct states, run finished after 9 ms. (steps per millisecond=183 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 23:30:08] [INFO ] Invariant cache hit.
[2024-05-28 23:30:08] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 23:30:08] [INFO ] Invariant cache hit.
[2024-05-28 23:30:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 23:30:09] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-28 23:30:09] [INFO ] Invariant cache hit.
[2024-05-28 23:30:09] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 99/99 places, 109/109 transitions.
Computed a total of 22 stabilizing places and 26 stable transitions
Graph (complete) has 313 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 22 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1654 steps, run visited all 1 properties in 8 ms. (steps per millisecond=206 )
Probabilistic random walk after 1654 steps, saw 793 distinct states, run finished after 9 ms. (steps per millisecond=183 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22611 reset in 135 ms.
Product exploration explored 100000 steps with 22410 reset in 140 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 23:30:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:30:10] [INFO ] Invariant cache hit.
[2024-05-28 23:30:10] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 99/99 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin17495823233264224516
[2024-05-28 23:30:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17495823233264224516
Running compilation step : cd /tmp/ltsmin17495823233264224516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin17495823233264224516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17495823233264224516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased323925051039785008.hoa' '--buchi-type=spotba'
LTSmin run took 4400 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 finished in 9303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1)||G(p2))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 205
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 149 transition count 200
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 137 transition count 187
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 137 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 137 transition count 181
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 130 transition count 169
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 130 transition count 169
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 89 place count 130 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 127 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 127 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 124 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 124 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 122 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 122 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 122 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 120 transition count 150
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 120 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 119 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 119 transition count 149
Applied a total of 113 rules in 12 ms. Remains 119 /166 variables (removed 47) and now considering 149/345 (removed 196) transitions.
// Phase 1: matrix 149 rows 119 cols
[2024-05-28 23:30:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:30:15] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 23:30:15] [INFO ] Invariant cache hit.
[2024-05-28 23:30:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-28 23:30:16] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-28 23:30:16] [INFO ] Invariant cache hit.
[2024-05-28 23:30:16] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/166 places, 149/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 119/166 places, 149/345 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s65 1)), p2:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 finished in 717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F((p2&&X(!p3)))&&p1))&&p0)))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 230
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 149 transition count 224
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 137 transition count 210
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 137 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 70 place count 137 transition count 204
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 129 transition count 192
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 129 transition count 192
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 94 place count 129 transition count 184
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 125 transition count 180
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 125 transition count 180
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 121 transition count 175
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 121 transition count 175
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 119 transition count 173
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 119 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 117 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 117 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 115 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 115 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 114 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 114 transition count 166
Applied a total of 124 rules in 17 ms. Remains 114 /166 variables (removed 52) and now considering 166/345 (removed 179) transitions.
// Phase 1: matrix 166 rows 114 cols
[2024-05-28 23:30:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:30:16] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 23:30:16] [INFO ] Invariant cache hit.
[2024-05-28 23:30:16] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-28 23:30:17] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-28 23:30:17] [INFO ] Invariant cache hit.
[2024-05-28 23:30:17] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/166 places, 166/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 741 ms. Remains : 114/166 places, 166/345 transitions.
Stuttering acceptance computed with spot in 248 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) (NOT p1) p3), (OR (NOT p2) (NOT p0) (NOT p1) p3), (OR (NOT p2) (NOT p1) (NOT p0) p3), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (LT s1 1) (LT s108 1)), p3:(AND (GEQ s1 1) (GEQ s106 1)), p1:(AND (GEQ s1 1) (GEQ s106 1)), p0:(AND (GEQ s1 1) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 finished in 1009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((X(p0)||(G(p2)&&p1))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 218
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 149 transition count 211
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 137 transition count 197
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 137 transition count 197
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 137 transition count 192
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 130 transition count 181
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 130 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 130 transition count 177
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 126 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 126 transition count 173
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 122 transition count 168
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 122 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 120 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 120 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 118 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 118 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 116 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 116 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 115 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 115 transition count 159
Applied a total of 118 rules in 17 ms. Remains 115 /166 variables (removed 51) and now considering 159/345 (removed 186) transitions.
// Phase 1: matrix 159 rows 115 cols
[2024-05-28 23:30:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:30:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 23:30:17] [INFO ] Invariant cache hit.
[2024-05-28 23:30:17] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-28 23:30:17] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-28 23:30:17] [INFO ] Invariant cache hit.
[2024-05-28 23:30:18] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/166 places, 159/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 115/166 places, 159/345 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 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=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s110 1)), p1:(AND (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 147 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 133 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 133 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 133 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 124 transition count 160
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 124 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 124 transition count 153
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 119 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 119 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 114 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 105 transition count 129
Applied a total of 143 rules in 21 ms. Remains 105 /166 variables (removed 61) and now considering 129/345 (removed 216) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 23:30:18] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 23:30:18] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 23:30:18] [INFO ] Invariant cache hit.
[2024-05-28 23:30:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:30:18] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-28 23:30:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:30:18] [INFO ] Invariant cache hit.
[2024-05-28 23:30:18] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/166 places, 129/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 105/166 places, 129/345 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22371 reset in 215 ms.
Product exploration explored 100000 steps with 22406 reset in 221 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1921561 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :{}
Probabilistic random walk after 1921561 steps, saw 807743 distinct states, run finished after 3004 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 23:30:22] [INFO ] Invariant cache hit.
[2024-05-28 23:30:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 23:30:22] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:30:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 23:30:22] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:30:22] [INFO ] After 27ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:22] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 23:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-28 23:30:22] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-28 23:30:22] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1869065 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :{}
Probabilistic random walk after 1869065 steps, saw 787534 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2024-05-28 23:30:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 23:30:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:30:26] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:30:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:30:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:30:26] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:30:26] [INFO ] After 32ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:26] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-28 23:30:26] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-28 23:30:26] [INFO ] Invariant cache hit.
[2024-05-28 23:30:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 23:30:26] [INFO ] Invariant cache hit.
[2024-05-28 23:30:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:30:26] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-28 23:30:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:30:26] [INFO ] Invariant cache hit.
[2024-05-28 23:30:26] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 74 transition count 106
Applied a total of 61 rules in 9 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2024-05-28 23:30:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 23:30:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:30:26] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:30:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:30:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:30:27] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:27] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 23:30:27] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 23:30:27] [INFO ] Computed 5 invariants in 6 ms
[2024-05-28 23:30:27] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 23:30:27] [INFO ] Invariant cache hit.
[2024-05-28 23:30:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:30:27] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-28 23:30:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:30:27] [INFO ] Invariant cache hit.
[2024-05-28 23:30:27] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[p0]
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1875412 steps, run timeout after 3001 ms. (steps per millisecond=624 ) properties seen :{}
Probabilistic random walk after 1875412 steps, saw 789007 distinct states, run finished after 3001 ms. (steps per millisecond=624 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 23:30:31] [INFO ] Invariant cache hit.
[2024-05-28 23:30:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 23:30:31] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:30:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 23:30:31] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 23:30:31] [INFO ] After 28ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 23:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 23:30:31] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-28 23:30:31] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1817437 steps, run timeout after 3001 ms. (steps per millisecond=605 ) properties seen :{}
Probabilistic random walk after 1817437 steps, saw 766605 distinct states, run finished after 3001 ms. (steps per millisecond=605 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2024-05-28 23:30:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 23:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:30:34] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 23:30:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:30:34] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:30:34] [INFO ] After 32ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:34] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-28 23:30:34] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-28 23:30:34] [INFO ] Invariant cache hit.
[2024-05-28 23:30:34] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 23:30:34] [INFO ] Invariant cache hit.
[2024-05-28 23:30:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 23:30:35] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-28 23:30:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 23:30:35] [INFO ] Invariant cache hit.
[2024-05-28 23:30:35] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 61 place count 74 transition count 106
Applied a total of 61 rules in 25 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2024-05-28 23:30:35] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 23:30:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:30:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 23:30:35] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 23:30:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 23:30:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 23:30:35] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 23:30:35] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 23:30:35] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 41 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Product exploration explored 100000 steps with 22395 reset in 147 ms.
Product exploration explored 100000 steps with 22402 reset in 164 ms.
Built C files in :
/tmp/ltsmin13601873424333772149
[2024-05-28 23:30:36] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2024-05-28 23:30:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:30:36] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2024-05-28 23:30:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:30:36] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2024-05-28 23:30:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:30:36] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13601873424333772149
Running compilation step : cd /tmp/ltsmin13601873424333772149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin13601873424333772149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13601873424333772149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2157942973622573898.hoa' '--buchi-type=spotba'
LTSmin run took 9703 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 finished in 27946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 345/345 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 190
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 147 transition count 185
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 132 transition count 168
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 132 transition count 168
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 132 transition count 161
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 122 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 122 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 107 place count 122 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 113 place count 116 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 116 transition count 132
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 125 place count 110 transition count 125
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 110 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 106 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 106 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 106 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 102 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 102 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 100 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 99 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 99 transition count 110
Applied a total of 155 rules in 11 ms. Remains 99 /166 variables (removed 67) and now considering 110/345 (removed 235) transitions.
// Phase 1: matrix 110 rows 99 cols
[2024-05-28 23:30:46] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 23:30:46] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-28 23:30:46] [INFO ] Invariant cache hit.
[2024-05-28 23:30:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 23:30:46] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-28 23:30:46] [INFO ] Invariant cache hit.
[2024-05-28 23:30:46] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/166 places, 110/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 99/166 places, 110/345 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-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 s95 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-d2m36-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 finished in 604 ms.
All properties solved by simple procedures.
Total runtime 170528 ms.

BK_STOP 1716939047938

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d2m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d2m36, 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 r395-smll-171683823900078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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