Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975200436.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679179747049

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 22:49:08] [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]
[2023-03-18 22:49:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:49:08] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-18 22:49:08] [INFO ] Transformed 1295 places.
[2023-03-18 22:49:08] [INFO ] Transformed 749 transitions.
[2023-03-18 22:49:08] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1036 places in 6 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 393
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 393
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 357 place count 196 transition count 385
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 385 place count 168 transition count 357
Iterating global reduction 2 with 28 rules applied. Total rules applied 413 place count 168 transition count 357
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 420 place count 168 transition count 350
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 434 place count 154 transition count 335
Iterating global reduction 3 with 14 rules applied. Total rules applied 448 place count 154 transition count 335
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 493 place count 154 transition count 290
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 495 place count 152 transition count 287
Iterating global reduction 4 with 2 rules applied. Total rules applied 497 place count 152 transition count 287
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 499 place count 150 transition count 285
Iterating global reduction 4 with 2 rules applied. Total rules applied 501 place count 150 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 502 place count 149 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 503 place count 149 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 148 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 148 transition count 283
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 506 place count 147 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 147 transition count 282
Applied a total of 507 rules in 92 ms. Remains 147 /259 variables (removed 112) and now considering 282/749 (removed 467) transitions.
// Phase 1: matrix 282 rows 147 cols
[2023-03-18 22:49:09] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-18 22:49:09] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-18 22:49:09] [INFO ] Invariant cache hit.
[2023-03-18 22:49:09] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-18 22:49:09] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-18 22:49:09] [INFO ] Invariant cache hit.
[2023-03-18 22:49:10] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/259 places, 282/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1046 ms. Remains : 147/259 places, 282/749 transitions.
Support contains 24 out of 147 places after structural reductions.
[2023-03-18 22:49:10] [INFO ] Flatten gal took : 58 ms
[2023-03-18 22:49:10] [INFO ] Flatten gal took : 22 ms
[2023-03-18 22:49:10] [INFO ] Input system was already deterministic with 282 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 239499 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{0=1, 2=1, 3=1, 5=1, 6=1, 7=1, 8=1, 10=1, 12=1, 17=1, 18=1, 19=1, 20=1}
Probabilistic random walk after 239499 steps, saw 111784 distinct states, run finished after 3005 ms. (steps per millisecond=79 ) properties seen :13
Running SMT prover for 8 properties.
[2023-03-18 22:49:14] [INFO ] Invariant cache hit.
[2023-03-18 22:49:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:49:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 22:49:14] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 22:49:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:49:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:49:15] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 22:49:15] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-18 22:49:15] [INFO ] After 464ms SMT Verify possible using 178 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 22:49:15] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 9 ms to minimize.
[2023-03-18 22:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-18 22:49:16] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2023-03-18 22:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-18 22:49:16] [INFO ] After 1274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 491 ms.
[2023-03-18 22:49:17] [INFO ] After 2198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 218 ms.
Support contains 10 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 282/282 transitions.
Graph (complete) has 512 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 146 transition count 280
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 135 transition count 196
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 135 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 135 transition count 195
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 35 place count 126 transition count 186
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 126 transition count 186
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 126 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 56 place count 123 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 123 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 123 transition count 172
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 122 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 122 transition count 171
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 121 transition count 170
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 121 transition count 170
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 120 transition count 169
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 120 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 72 place count 120 transition count 164
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 73 place count 119 transition count 163
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 119 transition count 163
Applied a total of 74 rules in 60 ms. Remains 119 /147 variables (removed 28) and now considering 163/282 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 119/147 places, 163/282 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 960 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 163 rows 119 cols
[2023-03-18 22:49:18] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 22:49:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:49:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:49:18] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 22:49:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:49:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:49:18] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 22:49:18] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-18 22:49:18] [INFO ] After 228ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 22:49:18] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-03-18 22:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-18 22:49:19] [INFO ] After 532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-18 22:49:19] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 294 ms.
Support contains 9 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 163/163 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 118 transition count 161
Applied a total of 3 rules in 17 ms. Remains 118 /119 variables (removed 1) and now considering 161/163 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 118/119 places, 161/163 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1031 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 333954 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333954 steps, saw 143852 distinct states, run finished after 3003 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 161 rows 118 cols
[2023-03-18 22:49:23] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:49:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:49:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:49:23] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 22:49:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:49:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:49:23] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 22:49:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-18 22:49:23] [INFO ] After 138ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 22:49:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2023-03-18 22:49:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-18 22:49:24] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-18 22:49:24] [INFO ] After 712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 285 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 161/161 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 161/161 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-18 22:49:24] [INFO ] Invariant cache hit.
[2023-03-18 22:49:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 22:49:24] [INFO ] Invariant cache hit.
[2023-03-18 22:49:24] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-18 22:49:24] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-18 22:49:24] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 22:49:24] [INFO ] Invariant cache hit.
[2023-03-18 22:49:25] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 118/118 places, 161/161 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 118 transition count 156
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 114 transition count 156
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 9 place count 114 transition count 138
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 45 place count 96 transition count 138
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 67 place count 85 transition count 127
Applied a total of 67 rules in 17 ms. Remains 85 /118 variables (removed 33) and now considering 127/161 (removed 34) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 127 rows 85 cols
[2023-03-18 22:49:25] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:49:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:49:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 22:49:25] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 22:49:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 22:49:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:49:25] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 22:49:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2023-03-18 22:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-18 22:49:25] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2023-03-18 22:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-18 22:49:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-18 22:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-18 22:49:25] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2023-03-18 22:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-18 22:49:25] [INFO ] After 606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-18 22:49:26] [INFO ] After 781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 32 stabilizing places and 52 stable transitions
Graph (complete) has 566 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 173
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 118 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 109 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 109 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 109 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 105 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 105 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 102 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 102 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 100 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 95 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 93 transition count 122
Applied a total of 119 rules in 38 ms. Remains 93 /147 variables (removed 54) and now considering 122/282 (removed 160) transitions.
// Phase 1: matrix 122 rows 93 cols
[2023-03-18 22:49:26] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-18 22:49:26] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 22:49:26] [INFO ] Invariant cache hit.
[2023-03-18 22:49:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 22:49:26] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-18 22:49:26] [INFO ] Invariant cache hit.
[2023-03-18 22:49:26] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/147 places, 122/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 93/147 places, 122/282 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s17 1) (LT s28 1)) (OR (LT s1 1) (LT s88 1)) (OR (LT s1 1) (LT s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22377 reset in 352 ms.
Product exploration explored 100000 steps with 22433 reset in 256 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1066 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 10 ms. (steps per millisecond=373 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 11 ms. (steps per millisecond=339 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-18 22:49:28] [INFO ] Invariant cache hit.
[2023-03-18 22:49:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 22:49:28] [INFO ] Invariant cache hit.
[2023-03-18 22:49:28] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 22:49:28] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-18 22:49:28] [INFO ] Invariant cache hit.
[2023-03-18 22:49:28] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 93/93 places, 122/122 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1024 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 32 ms. (steps per millisecond=116 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 33 ms. (steps per millisecond=113 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22420 reset in 204 ms.
Product exploration explored 100000 steps with 22400 reset in 136 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 12 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-18 22:49:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 22:49:30] [INFO ] Invariant cache hit.
[2023-03-18 22:49:30] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 93/93 places, 122/122 transitions.
Built C files in :
/tmp/ltsmin8136518840598547095
[2023-03-18 22:49:30] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8136518840598547095
Running compilation step : cd /tmp/ltsmin8136518840598547095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 398 ms.
Running link step : cd /tmp/ltsmin8136518840598547095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8136518840598547095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18117323356173402083.hoa' '--buchi-type=spotba'
LTSmin run took 2129 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 finished in 6711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&(!p0 U X((p2 U p0))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 71 place count 118 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 109 transition count 148
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 109 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 109 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 105 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 105 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 102 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 102 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 100 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 100 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 98 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 98 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 96 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 95 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 94 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 93 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 127
Applied a total of 123 rules in 13 ms. Remains 93 /147 variables (removed 54) and now considering 127/282 (removed 155) transitions.
// Phase 1: matrix 127 rows 93 cols
[2023-03-18 22:49:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:49:33] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 22:49:33] [INFO ] Invariant cache hit.
[2023-03-18 22:49:33] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-18 22:49:33] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-18 22:49:33] [INFO ] Invariant cache hit.
[2023-03-18 22:49:33] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/147 places, 127/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 93/147 places, 127/282 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s87 1)), p0:(AND (GEQ s1 1) (GEQ s86 1)), p2:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p0||F(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 163
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 149
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 149
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 116 transition count 140
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 107 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 107 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 107 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 103 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 103 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 97 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 97 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 95 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 94 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 94 transition count 111
Applied a total of 122 rules in 14 ms. Remains 94 /147 variables (removed 53) and now considering 111/282 (removed 171) transitions.
// Phase 1: matrix 111 rows 94 cols
[2023-03-18 22:49:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:49:34] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-18 22:49:34] [INFO ] Invariant cache hit.
[2023-03-18 22:49:34] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:49:34] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-18 22:49:34] [INFO ] Invariant cache hit.
[2023-03-18 22:49:34] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/147 places, 111/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 94/147 places, 111/282 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s10 1) (GEQ s29 1)), p1:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p2))&&(!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 110 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 107 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 101 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 96 transition count 132
Applied a total of 115 rules in 28 ms. Remains 96 /147 variables (removed 51) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 96 cols
[2023-03-18 22:49:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:49:34] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-18 22:49:34] [INFO ] Invariant cache hit.
[2023-03-18 22:49:34] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-18 22:49:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-18 22:49:34] [INFO ] Invariant cache hit.
[2023-03-18 22:49:35] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/147 places, 132/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 96/147 places, 132/282 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND p0 (NOT p1)), true, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s89 1))) (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 31038 reset in 280 ms.
Product exploration explored 100000 steps with 31067 reset in 293 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 504 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1779 ms. (steps per millisecond=655 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1781 ms. (steps per millisecond=654 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 401 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-18 22:49:38] [INFO ] Invariant cache hit.
[2023-03-18 22:49:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 22:49:38] [INFO ] Invariant cache hit.
[2023-03-18 22:49:39] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-18 22:49:39] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-18 22:49:39] [INFO ] Invariant cache hit.
[2023-03-18 22:49:39] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 96/96 places, 132/132 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1900 ms. (steps per millisecond=613 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1900 ms. (steps per millisecond=613 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22525 reset in 171 ms.
Product exploration explored 100000 steps with 22447 reset in 233 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 29 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-18 22:49:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 89 cols
[2023-03-18 22:49:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:49:43] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 89/96 places, 112/132 transitions.
Built C files in :
/tmp/ltsmin16764831834912442480
[2023-03-18 22:49:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16764831834912442480
Running compilation step : cd /tmp/ltsmin16764831834912442480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 252 ms.
Running link step : cd /tmp/ltsmin16764831834912442480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16764831834912442480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15860940171857765954.hoa' '--buchi-type=spotba'
LTSmin run took 3667 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 12505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 14 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-18 22:49:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:49:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-18 22:49:47] [INFO ] Invariant cache hit.
[2023-03-18 22:49:47] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:49:47] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-18 22:49:47] [INFO ] Invariant cache hit.
[2023-03-18 22:49:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 87/147 places, 102/282 transitions.
Stuttering acceptance computed with spot in 265 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22446 reset in 217 ms.
Product exploration explored 100000 steps with 22452 reset in 243 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 11 ms. (steps per millisecond=226 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 12 ms. (steps per millisecond=207 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 63 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 9 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-18 22:49:48] [INFO ] Invariant cache hit.
[2023-03-18 22:49:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-18 22:49:48] [INFO ] Invariant cache hit.
[2023-03-18 22:49:48] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:49:48] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-18 22:49:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:49:48] [INFO ] Invariant cache hit.
[2023-03-18 22:49:48] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 8 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22373 reset in 160 ms.
Product exploration explored 100000 steps with 22569 reset in 144 ms.
Built C files in :
/tmp/ltsmin5816751665644200020
[2023-03-18 22:49:49] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2023-03-18 22:49:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:49:49] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2023-03-18 22:49:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:49:49] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2023-03-18 22:49:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:49:49] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5816751665644200020
Running compilation step : cd /tmp/ltsmin5816751665644200020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 313 ms.
Running link step : cd /tmp/ltsmin5816751665644200020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5816751665644200020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7347057006660408901.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-18 22:50:05] [INFO ] Invariant cache hit.
[2023-03-18 22:50:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 22:50:05] [INFO ] Invariant cache hit.
[2023-03-18 22:50:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:50:05] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-18 22:50:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:50:05] [INFO ] Invariant cache hit.
[2023-03-18 22:50:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin14159869387352379331
[2023-03-18 22:50:05] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2023-03-18 22:50:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:50:05] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2023-03-18 22:50:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:50:05] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2023-03-18 22:50:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:50:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14159869387352379331
Running compilation step : cd /tmp/ltsmin14159869387352379331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin14159869387352379331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14159869387352379331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2202359479095656202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 22:50:20] [INFO ] Flatten gal took : 12 ms
[2023-03-18 22:50:20] [INFO ] Flatten gal took : 10 ms
[2023-03-18 22:50:20] [INFO ] Time to serialize gal into /tmp/LTL4443612896678818614.gal : 3 ms
[2023-03-18 22:50:20] [INFO ] Time to serialize properties into /tmp/LTL13521799173781064249.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4443612896678818614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6984369767071410310.hoa' '-atoms' '/tmp/LTL13521799173781064249.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13521799173781064249.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6984369767071410310.hoa
Detected timeout of ITS tools.
[2023-03-18 22:50:35] [INFO ] Flatten gal took : 9 ms
[2023-03-18 22:50:35] [INFO ] Flatten gal took : 8 ms
[2023-03-18 22:50:35] [INFO ] Time to serialize gal into /tmp/LTL2854007425873590952.gal : 3 ms
[2023-03-18 22:50:35] [INFO ] Time to serialize properties into /tmp/LTL3211742153653563705.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2854007425873590952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3211742153653563705.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((s1<1)||(l1191<1))")))||((F("((s1<1)||(l1191<1))"))&&(G(F("(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))))))))
Formula 0 simplified : XX(FG!"((s1<1)||(l1191<1))" & (G!"((s1<1)||(l1191<1))" | FG!"(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))
Detected timeout of ITS tools.
[2023-03-18 22:50:50] [INFO ] Flatten gal took : 14 ms
[2023-03-18 22:50:50] [INFO ] Applying decomposition
[2023-03-18 22:50:50] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16250419590934196457.txt' '-o' '/tmp/graph16250419590934196457.bin' '-w' '/tmp/graph16250419590934196457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16250419590934196457.bin' '-l' '-1' '-v' '-w' '/tmp/graph16250419590934196457.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:50:50] [INFO ] Decomposing Gal with order
[2023-03-18 22:50:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:50:50] [INFO ] Removed a total of 86 redundant transitions.
[2023-03-18 22:50:50] [INFO ] Flatten gal took : 65 ms
[2023-03-18 22:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 23 ms.
[2023-03-18 22:50:50] [INFO ] Time to serialize gal into /tmp/LTL7196235442312284374.gal : 7 ms
[2023-03-18 22:50:50] [INFO ] Time to serialize properties into /tmp/LTL10333136227186271971.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7196235442312284374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10333136227186271971.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i5.i1.u0.s1<1)||(i6.u20.l1191<1))")))||((F("((i5.i1.u0.s1<1)||(i6.u20.l1191<1))"))&&(G(F("(((i5.i1.u0.s1<1)||(i5.i1.u0....210
Formula 0 simplified : XX(FG!"((i5.i1.u0.s1<1)||(i6.u20.l1191<1))" & (G!"((i5.i1.u0.s1<1)||(i6.u20.l1191<1))" | FG!"(((i5.i1.u0.s1<1)||(i5.i1.u0.l354<1))||...194
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5886203018367500197
[2023-03-18 22:51:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5886203018367500197
Running compilation step : cd /tmp/ltsmin5886203018367500197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 156 ms.
Running link step : cd /tmp/ltsmin5886203018367500197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5886203018367500197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 94076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F((!p1&&X(X(G(!p0))))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 16 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-18 22:51:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 22:51:21] [INFO ] Invariant cache hit.
[2023-03-18 22:51:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:51:21] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-18 22:51:21] [INFO ] Invariant cache hit.
[2023-03-18 22:51:21] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 87/147 places, 102/282 transitions.
Stuttering acceptance computed with spot in 248 ms :[p0, true, p0, p0, (OR p1 p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={0} source=5 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22579 reset in 149 ms.
Product exploration explored 100000 steps with 22529 reset in 150 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 484 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 423 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 5 properties in 13 ms. (steps per millisecond=216 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 13 ms. (steps per millisecond=216 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 580 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 192 ms :[p0, p0, p0, (OR p1 p0), p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-18 22:51:23] [INFO ] Invariant cache hit.
[2023-03-18 22:51:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-18 22:51:24] [INFO ] Invariant cache hit.
[2023-03-18 22:51:24] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:51:24] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-18 22:51:24] [INFO ] Invariant cache hit.
[2023-03-18 22:51:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 5 properties in 24 ms. (steps per millisecond=117 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 24 ms. (steps per millisecond=117 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 367 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 167 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, (OR p1 p0), p0]
Product exploration explored 100000 steps with 22448 reset in 125 ms.
Product exploration explored 100000 steps with 22501 reset in 140 ms.
Built C files in :
/tmp/ltsmin8993039791158028590
[2023-03-18 22:51:26] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8993039791158028590
Running compilation step : cd /tmp/ltsmin8993039791158028590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin8993039791158028590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8993039791158028590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8183992167265234079.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 finished in 5755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(F(p1))||F(p2)))&&p0)))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 163
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 149
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 149
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 139
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 108 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 108 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 108 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 104 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 101 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 101 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 99 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 99 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 99 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 97 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 97 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 96 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 96 transition count 112
Applied a total of 119 rules in 7 ms. Remains 96 /147 variables (removed 51) and now considering 112/282 (removed 170) transitions.
// Phase 1: matrix 112 rows 96 cols
[2023-03-18 22:51:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-18 22:51:26] [INFO ] Invariant cache hit.
[2023-03-18 22:51:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:51:27] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-18 22:51:27] [INFO ] Invariant cache hit.
[2023-03-18 22:51:27] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/147 places, 112/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 96/147 places, 112/282 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p2:(OR (LT s1 1) (LT s59 1)), p1:(OR (LT s1 1) (LT s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 155
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 113 transition count 137
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 113 transition count 137
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 113 transition count 128
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 103 transition count 117
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 103 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 103 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 96 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 93 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 90 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 88 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 87 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 86 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 85 transition count 92
Applied a total of 139 rules in 13 ms. Remains 85 /147 variables (removed 62) and now considering 92/282 (removed 190) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-18 22:51:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 22:51:27] [INFO ] Invariant cache hit.
[2023-03-18 22:51:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-18 22:51:27] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-18 22:51:27] [INFO ] Invariant cache hit.
[2023-03-18 22:51:27] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/147 places, 92/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 85/147 places, 92/282 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s20 1) (LT s58 1) (AND (GEQ s1 1) (GEQ s71 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22457 reset in 117 ms.
Product exploration explored 100000 steps with 22484 reset in 118 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2240 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 1026 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 11 ms. (steps per millisecond=350 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 12 ms. (steps per millisecond=321 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 0 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-18 22:51:28] [INFO ] Invariant cache hit.
[2023-03-18 22:51:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 22:51:28] [INFO ] Invariant cache hit.
[2023-03-18 22:51:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-18 22:51:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-18 22:51:29] [INFO ] Invariant cache hit.
[2023-03-18 22:51:29] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 85/85 places, 92/92 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 9 ms. (steps per millisecond=428 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 10 ms. (steps per millisecond=385 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22439 reset in 95 ms.
Product exploration explored 100000 steps with 22405 reset in 102 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-18 22:51:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:51:30] [INFO ] Invariant cache hit.
[2023-03-18 22:51:30] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 85/85 places, 92/92 transitions.
Built C files in :
/tmp/ltsmin7008032488932272347
[2023-03-18 22:51:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7008032488932272347
Running compilation step : cd /tmp/ltsmin7008032488932272347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 140 ms.
Running link step : cd /tmp/ltsmin7008032488932272347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7008032488932272347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17151145932438100077.hoa' '--buchi-type=spotba'
LTSmin run took 861 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 3806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1&&F(p2)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 110 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 106 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 106 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 101 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 99 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 99 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 94 transition count 129
Applied a total of 120 rules in 17 ms. Remains 94 /147 variables (removed 53) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 94 cols
[2023-03-18 22:51:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-18 22:51:31] [INFO ] Invariant cache hit.
[2023-03-18 22:51:31] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-18 22:51:31] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-18 22:51:31] [INFO ] Invariant cache hit.
[2023-03-18 22:51:31] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/147 places, 129/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 94/147 places, 129/282 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p1:(OR (LT s1 1) (LT s89 1)), p2:(OR (LT s1 1) (LT s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 208 ms.
Product exploration explored 100000 steps with 33333 reset in 259 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 317 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 finished in 1127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 166
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 165
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 117 transition count 151
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 117 transition count 151
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 117 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 108 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 108 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 104 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 104 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 101 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 101 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 99 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 99 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 99 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 98 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 98 transition count 115
Applied a total of 114 rules in 18 ms. Remains 98 /147 variables (removed 49) and now considering 115/282 (removed 167) transitions.
// Phase 1: matrix 115 rows 98 cols
[2023-03-18 22:51:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 22:51:32] [INFO ] Invariant cache hit.
[2023-03-18 22:51:32] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-18 22:51:32] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-18 22:51:32] [INFO ] Invariant cache hit.
[2023-03-18 22:51:32] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/147 places, 115/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 98/147 places, 115/282 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s41 1)), p0:(OR (AND (GEQ s1 1) (GEQ s67 1)) (AND (GEQ s1 1) (GEQ s93 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 84 transition count 98
Applied a total of 143 rules in 20 ms. Remains 84 /147 variables (removed 63) and now considering 98/282 (removed 184) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-18 22:51:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 22:51:33] [INFO ] Invariant cache hit.
[2023-03-18 22:51:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:51:33] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-18 22:51:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:51:33] [INFO ] Invariant cache hit.
[2023-03-18 22:51:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/147 places, 98/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 84/147 places, 98/282 transitions.
Stuttering acceptance computed with spot in 31 ms :[false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22426 reset in 132 ms.
Product exploration explored 100000 steps with 22534 reset in 241 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 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 29 ms :[false]
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 57 ms. (steps per millisecond=633 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 57 ms. (steps per millisecond=633 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[false]
Stuttering acceptance computed with spot in 29 ms :[false]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 22:51:34] [INFO ] Invariant cache hit.
[2023-03-18 22:51:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 22:51:34] [INFO ] Invariant cache hit.
[2023-03-18 22:51:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:51:34] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-18 22:51:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:51:34] [INFO ] Invariant cache hit.
[2023-03-18 22:51:34] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 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 38 ms :[false]
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 74 ms. (steps per millisecond=488 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 74 ms. (steps per millisecond=488 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 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 27 ms :[false]
Stuttering acceptance computed with spot in 28 ms :[false]
Stuttering acceptance computed with spot in 23 ms :[false]
Product exploration explored 100000 steps with 22420 reset in 139 ms.
Product exploration explored 100000 steps with 22299 reset in 147 ms.
Built C files in :
/tmp/ltsmin14511641121418338913
[2023-03-18 22:51:35] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2023-03-18 22:51:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:51:35] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2023-03-18 22:51:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:51:35] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2023-03-18 22:51:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:51:35] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14511641121418338913
Running compilation step : cd /tmp/ltsmin14511641121418338913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 317 ms.
Running link step : cd /tmp/ltsmin14511641121418338913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14511641121418338913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2440645636992902791.hoa' '--buchi-type=spotba'
LTSmin run took 3103 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 finished in 5852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U X(X(p2)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 175
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 117 transition count 161
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 117 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 117 transition count 151
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 108 transition count 141
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 108 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 108 transition count 139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 104 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 104 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 101 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 101 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 97 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 97 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 95 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 94 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 94 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 93 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 93 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 92 transition count 120
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 92 transition count 120
Applied a total of 123 rules in 8 ms. Remains 92 /147 variables (removed 55) and now considering 120/282 (removed 162) transitions.
// Phase 1: matrix 120 rows 92 cols
[2023-03-18 22:51:38] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-18 22:51:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 22:51:38] [INFO ] Invariant cache hit.
[2023-03-18 22:51:39] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-18 22:51:39] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-18 22:51:39] [INFO ] Invariant cache hit.
[2023-03-18 22:51:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/147 places, 120/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 92/147 places, 120/282 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1)), p2:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 finished in 595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&F(!p1)) U (G((p0&&F(!p1)))||(p0&&G(!p1)))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 107 transition count 138
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 107 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 107 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 103 transition count 131
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 100 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 100 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 91 transition count 117
Applied a total of 126 rules in 24 ms. Remains 91 /147 variables (removed 56) and now considering 117/282 (removed 165) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:51:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 22:51:39] [INFO ] Invariant cache hit.
[2023-03-18 22:51:39] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:51:39] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-18 22:51:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:51:39] [INFO ] Invariant cache hit.
[2023-03-18 22:51:39] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/147 places, 117/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 91/147 places, 117/282 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22439 reset in 181 ms.
Product exploration explored 100000 steps with 22478 reset in 146 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 408 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 738210 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{0=1, 1=1, 3=1, 6=1}
Probabilistic random walk after 738210 steps, saw 317265 distinct states, run finished after 3003 ms. (steps per millisecond=245 ) properties seen :4
Running SMT prover for 3 properties.
[2023-03-18 22:51:44] [INFO ] Invariant cache hit.
[2023-03-18 22:51:44] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 22:51:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:44] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 22:51:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:51:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:44] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 22:51:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:51:44] [INFO ] After 27ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-18 22:51:44] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-18 22:51:44] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 3 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/91 places, 115/117 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 685833 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685833 steps, saw 295583 distinct states, run finished after 3002 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 90 cols
[2023-03-18 22:51:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 22:51:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:51:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:47] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 22:51:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 22:51:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:47] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 22:51:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-18 22:51:47] [INFO ] After 25ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 22:51:47] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-18 22:51:47] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-18 22:51:48] [INFO ] Invariant cache hit.
[2023-03-18 22:51:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 22:51:48] [INFO ] Invariant cache hit.
[2023-03-18 22:51:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-18 22:51:48] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-18 22:51:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:51:48] [INFO ] Invariant cache hit.
[2023-03-18 22:51:48] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 90/90 places, 115/115 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 22 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2023-03-18 22:51:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 22:51:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:51:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:48] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 22:51:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 22:51:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:51:48] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 22:51:48] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-18 22:51:48] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (OR (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 12 factoid took 512 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:51:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:51:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 22:51:49] [INFO ] Invariant cache hit.
[2023-03-18 22:51:49] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:51:49] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-18 22:51:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:51:49] [INFO ] Invariant cache hit.
[2023-03-18 22:51:49] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 2597975 steps, run timeout after 3001 ms. (steps per millisecond=865 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 2597975 steps, saw 1076950 distinct states, run finished after 3002 ms. (steps per millisecond=865 ) properties seen :4
Running SMT prover for 1 properties.
[2023-03-18 22:51:53] [INFO ] Invariant cache hit.
[2023-03-18 22:51:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:51:53] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:53] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:51:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:51:53] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-18 22:51:53] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:51:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:51:53] [INFO ] After 16ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:51:53] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-18 22:51:53] [INFO ] After 122ms 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 86 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 85 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 84 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 83 transition count 96
Applied a total of 21 rules in 16 ms. Remains 83 /91 variables (removed 8) and now considering 96/117 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 83/91 places, 96/117 transitions.
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2849754 steps, run timeout after 3001 ms. (steps per millisecond=949 ) properties seen :{}
Probabilistic random walk after 2849754 steps, saw 1192232 distinct states, run finished after 3001 ms. (steps per millisecond=949 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 83 cols
[2023-03-18 22:51:56] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:51:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:51:56] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-18 22:51:56] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:51:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:51:56] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:56] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:51:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-18 22:51:56] [INFO ] After 14ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:51:56] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-18 22:51:56] [INFO ] After 138ms 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 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-18 22:51:56] [INFO ] Invariant cache hit.
[2023-03-18 22:51:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 22:51:57] [INFO ] Invariant cache hit.
[2023-03-18 22:51:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-18 22:51:57] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-18 22:51:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:51:57] [INFO ] Invariant cache hit.
[2023-03-18 22:51:57] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 83/83 places, 96/96 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 90
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 78 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 65 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 58 transition count 70
Applied a total of 51 rules in 11 ms. Remains 58 /83 variables (removed 25) and now considering 70/96 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 58 cols
[2023-03-18 22:51:57] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 22:51:57] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-18 22:51:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:57] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:51:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:51:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:51:57] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:51:57] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 22:51:57] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (OR (NOT p0) p1)), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 22269 reset in 112 ms.
Product exploration explored 100000 steps with 22420 reset in 123 ms.
Built C files in :
/tmp/ltsmin7325802568869763985
[2023-03-18 22:51:58] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2023-03-18 22:51:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:51:58] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2023-03-18 22:51:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:51:58] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2023-03-18 22:51:58] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:51:58] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7325802568869763985
Running compilation step : cd /tmp/ltsmin7325802568869763985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin7325802568869763985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7325802568869763985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6770807840236221615.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:52:13] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-18 22:52:13] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-18 22:52:13] [INFO ] Invariant cache hit.
[2023-03-18 22:52:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:52:13] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-18 22:52:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:52:13] [INFO ] Invariant cache hit.
[2023-03-18 22:52:13] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin16818362072481063611
[2023-03-18 22:52:13] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2023-03-18 22:52:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:13] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2023-03-18 22:52:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:13] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2023-03-18 22:52:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16818362072481063611
Running compilation step : cd /tmp/ltsmin16818362072481063611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 247 ms.
Running link step : cd /tmp/ltsmin16818362072481063611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin16818362072481063611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10561225311303876654.hoa' '--buchi-type=spotba'
LTSmin run took 7123 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 finished in 41770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 107 transition count 138
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 107 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 107 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 102 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 102 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 95 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 95 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 95 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 92 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 90 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 89 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 88 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 87 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 87 transition count 109
Applied a total of 138 rules in 19 ms. Remains 87 /147 variables (removed 60) and now considering 109/282 (removed 173) transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-18 22:52:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:52:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 22:52:21] [INFO ] Invariant cache hit.
[2023-03-18 22:52:21] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:52:21] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-18 22:52:21] [INFO ] Invariant cache hit.
[2023-03-18 22:52:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 109/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 87/147 places, 109/282 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s82 1)), p0:(AND (GEQ s1 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Stuttering acceptance computed with spot in 138 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 13 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-18 22:52:21] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 22:52:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 22:52:21] [INFO ] Invariant cache hit.
[2023-03-18 22:52:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:52:22] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-18 22:52:22] [INFO ] Invariant cache hit.
[2023-03-18 22:52:22] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 299 ms. Remains : 87/147 places, 102/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22540 reset in 89 ms.
Product exploration explored 100000 steps with 22424 reset in 93 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 5 ms. (steps per millisecond=497 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 5 ms. (steps per millisecond=497 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 40 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-18 22:52:22] [INFO ] Invariant cache hit.
[2023-03-18 22:52:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-18 22:52:22] [INFO ] Invariant cache hit.
[2023-03-18 22:52:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:52:22] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-18 22:52:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:52:22] [INFO ] Invariant cache hit.
[2023-03-18 22:52:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 6 ms. (steps per millisecond=414 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 6 ms. (steps per millisecond=414 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 40 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 46 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22443 reset in 90 ms.
Product exploration explored 100000 steps with 22451 reset in 95 ms.
Built C files in :
/tmp/ltsmin939611280856806483
[2023-03-18 22:52:23] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2023-03-18 22:52:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:23] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2023-03-18 22:52:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:23] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2023-03-18 22:52:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin939611280856806483
Running compilation step : cd /tmp/ltsmin939611280856806483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin939611280856806483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 19 ms.
Running LTSmin : cd /tmp/ltsmin939611280856806483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4035607102255756316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-18 22:52:38] [INFO ] Invariant cache hit.
[2023-03-18 22:52:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-18 22:52:38] [INFO ] Invariant cache hit.
[2023-03-18 22:52:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:52:38] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-18 22:52:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:52:38] [INFO ] Invariant cache hit.
[2023-03-18 22:52:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 339 ms. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin8608614362821648154
[2023-03-18 22:52:39] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2023-03-18 22:52:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:39] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2023-03-18 22:52:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:39] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2023-03-18 22:52:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:52:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8608614362821648154
Running compilation step : cd /tmp/ltsmin8608614362821648154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin8608614362821648154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8608614362821648154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11065667656728269562.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 22:52:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 22:52:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 22:52:54] [INFO ] Time to serialize gal into /tmp/LTL4135578486375945536.gal : 2 ms
[2023-03-18 22:52:54] [INFO ] Time to serialize properties into /tmp/LTL495651437740374363.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4135578486375945536.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16293112800397226581.hoa' '-atoms' '/tmp/LTL495651437740374363.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL495651437740374363.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16293112800397226581.hoa
Detected timeout of ITS tools.
[2023-03-18 22:53:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 22:53:09] [INFO ] Flatten gal took : 25 ms
[2023-03-18 22:53:09] [INFO ] Time to serialize gal into /tmp/LTL11535677014616105602.gal : 1 ms
[2023-03-18 22:53:09] [INFO ] Time to serialize properties into /tmp/LTL12547100832700489003.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11535677014616105602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12547100832700489003.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((s1<1)||(l1191<1))")))||((F("((s1<1)||(l1191<1))"))&&(G(F("(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))))))))
Formula 0 simplified : XX(FG!"((s1<1)||(l1191<1))" & (G!"((s1<1)||(l1191<1))" | FG!"(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))
Detected timeout of ITS tools.
[2023-03-18 22:53:24] [INFO ] Flatten gal took : 9 ms
[2023-03-18 22:53:24] [INFO ] Applying decomposition
[2023-03-18 22:53:24] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4666640233775395086.txt' '-o' '/tmp/graph4666640233775395086.bin' '-w' '/tmp/graph4666640233775395086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4666640233775395086.bin' '-l' '-1' '-v' '-w' '/tmp/graph4666640233775395086.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:53:24] [INFO ] Decomposing Gal with order
[2023-03-18 22:53:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:53:24] [INFO ] Removed a total of 89 redundant transitions.
[2023-03-18 22:53:24] [INFO ] Flatten gal took : 31 ms
[2023-03-18 22:53:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 4 ms.
[2023-03-18 22:53:24] [INFO ] Time to serialize gal into /tmp/LTL16661322501499808161.gal : 11 ms
[2023-03-18 22:53:24] [INFO ] Time to serialize properties into /tmp/LTL5005406787851234777.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16661322501499808161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5005406787851234777.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i2.u0.s1<1)||(i5.u13.l1191<1))")))||((F("((i2.u0.s1<1)||(i5.u13.l1191<1))"))&&(G(F("(((i2.u0.s1<1)||(i2.u0.l354<1))||((...195
Formula 0 simplified : XX(FG!"((i2.u0.s1<1)||(i5.u13.l1191<1))" & (G!"((i2.u0.s1<1)||(i5.u13.l1191<1))" | FG!"(((i2.u0.s1<1)||(i2.u0.l354<1))||((i2.u0.s1<1...179
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4511300435628480180
[2023-03-18 22:53:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4511300435628480180
Running compilation step : cd /tmp/ltsmin4511300435628480180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin4511300435628480180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4511300435628480180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 92947 ms.
[2023-03-18 22:53:54] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18230066024115359515
[2023-03-18 22:53:54] [INFO ] Computing symmetric may disable matrix : 282 transitions.
[2023-03-18 22:53:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:53:54] [INFO ] Computing symmetric may enable matrix : 282 transitions.
[2023-03-18 22:53:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:53:54] [INFO ] Applying decomposition
[2023-03-18 22:53:54] [INFO ] Flatten gal took : 18 ms
[2023-03-18 22:53:54] [INFO ] Computing Do-Not-Accords matrix : 282 transitions.
[2023-03-18 22:53:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:53:54] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18230066024115359515
Running compilation step : cd /tmp/ltsmin18230066024115359515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13181634081365887531.txt' '-o' '/tmp/graph13181634081365887531.bin' '-w' '/tmp/graph13181634081365887531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13181634081365887531.bin' '-l' '-1' '-v' '-w' '/tmp/graph13181634081365887531.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:53:54] [INFO ] Decomposing Gal with order
[2023-03-18 22:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:53:54] [INFO ] Removed a total of 174 redundant transitions.
[2023-03-18 22:53:54] [INFO ] Flatten gal took : 26 ms
[2023-03-18 22:53:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 7 ms.
[2023-03-18 22:53:54] [INFO ] Time to serialize gal into /tmp/LTLFireability9210010664993941477.gal : 3 ms
[2023-03-18 22:53:54] [INFO ] Time to serialize properties into /tmp/LTLFireability14956078352617605008.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9210010664993941477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14956078352617605008.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(!("((u0.s1>=1)&&(u0.l1191>=1))"))))||((F(!("((u0.s1>=1)&&(u0.l1191>=1))")))&&(G(F(!("(((u0.s1>=1)&&(i3.i1.u17.l354>=1))&&(...192
Formula 0 simplified : XX(FG"((u0.s1>=1)&&(u0.l1191>=1))" & (G"((u0.s1>=1)&&(u0.l1191>=1))" | FG"(((u0.s1>=1)&&(i3.i1.u17.l354>=1))&&((u0.s1>=1)&&(u0.l1191...164
Compilation finished in 558 ms.
Running link step : cd /tmp/ltsmin18230066024115359515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18230066024115359515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: LTL layer: formula: X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: "X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.031: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.067: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.159: DFS-FIFO for weak LTL, using special progress label 285
pins2lts-mc-linux64( 0/ 8), 0.159: There are 286 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.159: State length is 148, there are 290 groups
pins2lts-mc-linux64( 0/ 8), 0.159: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.159: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.159: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.159: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.162: ~1 levels ~960 states ~1888 transitions
pins2lts-mc-linux64( 4/ 8), 0.166: ~1 levels ~1920 states ~3744 transitions
pins2lts-mc-linux64( 4/ 8), 0.177: ~1 levels ~3840 states ~7976 transitions
pins2lts-mc-linux64( 4/ 8), 0.572: ~1 levels ~7680 states ~16704 transitions
pins2lts-mc-linux64( 4/ 8), 0.815: ~1 levels ~15360 states ~34472 transitions
pins2lts-mc-linux64( 3/ 8), 1.112: ~4 levels ~30720 states ~71072 transitions
pins2lts-mc-linux64( 3/ 8), 1.829: ~4 levels ~61440 states ~142880 transitions
pins2lts-mc-linux64( 5/ 8), 2.966: ~1 levels ~122880 states ~291064 transitions
pins2lts-mc-linux64( 7/ 8), 4.985: ~4 levels ~245760 states ~591800 transitions
pins2lts-mc-linux64( 6/ 8), 10.453: ~6 levels ~491520 states ~1237216 transitions
pins2lts-mc-linux64( 6/ 8), 16.406: ~6 levels ~983040 states ~2549584 transitions
pins2lts-mc-linux64( 6/ 8), 25.526: ~6 levels ~1966080 states ~4879032 transitions
pins2lts-mc-linux64( 4/ 8), 38.859: ~7 levels ~3932160 states ~9882088 transitions
pins2lts-mc-linux64( 4/ 8), 64.264: ~8 levels ~7864320 states ~20330456 transitions
pins2lts-mc-linux64( 4/ 8), 105.526: ~8 levels ~15728640 states ~41203864 transitions
pins2lts-mc-linux64( 4/ 8), 178.495: ~8 levels ~31457280 states ~80318680 transitions
pins2lts-mc-linux64( 4/ 8), 297.594: ~9 levels ~62914560 states ~160183448 transitions
pins2lts-mc-linux64( 4/ 8), 559.990: ~9 levels ~125829120 states ~327837040 transitions
pins2lts-mc-linux64( 3/ 8), 589.790: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 589.803:
pins2lts-mc-linux64( 0/ 8), 589.803: mean standard work distribution: 2.4% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 589.803:
pins2lts-mc-linux64( 0/ 8), 589.803: Explored 126395452 states 333522424 transitions, fanout: 2.639
pins2lts-mc-linux64( 0/ 8), 589.803: Total exploration time 589.640 sec (589.580 sec minimum, 589.606 sec on average)
pins2lts-mc-linux64( 0/ 8), 589.803: States per second: 214360, Transitions per second: 565637
pins2lts-mc-linux64( 0/ 8), 589.803:
pins2lts-mc-linux64( 0/ 8), 589.803: Progress states detected: 132890815
pins2lts-mc-linux64( 0/ 8), 589.803: Redundant explorations: -5.8224
pins2lts-mc-linux64( 0/ 8), 589.803:
pins2lts-mc-linux64( 0/ 8), 589.803: Queue width: 8B, total height: 16020986, memory: 122.23MB
pins2lts-mc-linux64( 0/ 8), 589.803: Tree memory: 1032.3MB, 8.1 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 589.803: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 589.803: Stored 286 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 589.803: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 589.803: Est. total memory use: 1154.5MB (~1146.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18230066024115359515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18230066024115359515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 23:15:30] [INFO ] Flatten gal took : 37 ms
[2023-03-18 23:15:30] [INFO ] Time to serialize gal into /tmp/LTLFireability6093586432797073191.gal : 4 ms
[2023-03-18 23:15:30] [INFO ] Time to serialize properties into /tmp/LTLFireability9571611565100065234.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6093586432797073191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9571611565100065234.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(!("((s1>=1)&&(l1191>=1))"))))||((F(!("((s1>=1)&&(l1191>=1))")))&&(G(F(!("(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))")))...161
Formula 0 simplified : XX(FG"((s1>=1)&&(l1191>=1))" & (G"((s1>=1)&&(l1191>=1))" | FG"(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))"))
Detected timeout of ITS tools.
[2023-03-18 23:37:07] [INFO ] Flatten gal took : 291 ms
[2023-03-18 23:37:08] [INFO ] Input system was already deterministic with 282 transitions.
[2023-03-18 23:37:08] [INFO ] Transformed 147 places.
[2023-03-18 23:37:08] [INFO ] Transformed 282 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 23:37:08] [INFO ] Time to serialize gal into /tmp/LTLFireability17880855582123606132.gal : 5 ms
[2023-03-18 23:37:08] [INFO ] Time to serialize properties into /tmp/LTLFireability6807871017784930601.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17880855582123606132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6807871017784930601.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G(F(!("((s1>=1)&&(l1191>=1))"))))||((F(!("((s1>=1)&&(l1191>=1))")))&&(G(F(!("(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))")))...161
Formula 0 simplified : XX(FG"((s1>=1)&&(l1191>=1))" & (G"((s1>=1)&&(l1191>=1))" | FG"(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 13071972 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16071604 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-d1m64"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905975200436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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