Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716921726146

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 18:42: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]
[2024-05-28 18:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:42:09] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-28 18:42:09] [INFO ] Transformed 1295 places.
[2024-05-28 18:42:09] [INFO ] Transformed 749 transitions.
[2024-05-28 18:42:09] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 11 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 306 place count 193 transition count 370
Iterating global reduction 1 with 49 rules applied. Total rules applied 355 place count 193 transition count 370
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 361 place count 193 transition count 364
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 392 place count 162 transition count 333
Iterating global reduction 2 with 31 rules applied. Total rules applied 423 place count 162 transition count 333
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 436 place count 162 transition count 320
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 453 place count 145 transition count 302
Iterating global reduction 3 with 17 rules applied. Total rules applied 470 place count 145 transition count 302
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 519 place count 145 transition count 253
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 522 place count 142 transition count 249
Iterating global reduction 4 with 3 rules applied. Total rules applied 525 place count 142 transition count 249
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 528 place count 139 transition count 246
Iterating global reduction 4 with 3 rules applied. Total rules applied 531 place count 139 transition count 246
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 533 place count 137 transition count 243
Iterating global reduction 4 with 2 rules applied. Total rules applied 535 place count 137 transition count 243
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 536 place count 136 transition count 242
Iterating global reduction 4 with 1 rules applied. Total rules applied 537 place count 136 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 538 place count 135 transition count 241
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 135 transition count 241
Applied a total of 539 rules in 123 ms. Remains 135 /259 variables (removed 124) and now considering 241/749 (removed 508) transitions.
// Phase 1: matrix 241 rows 135 cols
[2024-05-28 18:42:09] [INFO ] Computed 5 invariants in 26 ms
[2024-05-28 18:42:09] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-28 18:42:09] [INFO ] Invariant cache hit.
[2024-05-28 18:42:10] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-05-28 18:42:10] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2024-05-28 18:42:10] [INFO ] Invariant cache hit.
[2024-05-28 18:42:10] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/259 places, 241/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1494 ms. Remains : 135/259 places, 241/749 transitions.
Support contains 26 out of 135 places after structural reductions.
[2024-05-28 18:42:11] [INFO ] Flatten gal took : 70 ms
[2024-05-28 18:42:11] [INFO ] Flatten gal took : 32 ms
[2024-05-28 18:42:11] [INFO ] Input system was already deterministic with 241 transitions.
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 1013 ms. (steps per millisecond=9 ) properties (out of 25) seen :3
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2024-05-28 18:42:12] [INFO ] Invariant cache hit.
[2024-05-28 18:42:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 18:42:13] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-28 18:42:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 18:42:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 18:42:14] [INFO ] After 798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-28 18:42:14] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-05-28 18:42:16] [INFO ] After 1731ms SMT Verify possible using 148 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-28 18:42:16] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 6 ms to minimize.
[2024-05-28 18:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-28 18:42:17] [INFO ] After 3249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1478 ms.
[2024-05-28 18:42:19] [INFO ] After 5824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 3 properties in 468 ms.
Support contains 20 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 241/241 transitions.
Graph (complete) has 454 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 133 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 133 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 132 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 132 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 131 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 131 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 131 transition count 234
Applied a total of 10 rules in 52 ms. Remains 131 /135 variables (removed 4) and now considering 234/241 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 131/135 places, 234/241 transitions.
Incomplete random walk after 10000 steps, including 2210 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 359026 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 10=1, 14=1, 15=1, 16=1, 17=1, 18=1}
Probabilistic random walk after 359026 steps, saw 165729 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :13
Running SMT prover for 6 properties.
// Phase 1: matrix 234 rows 131 cols
[2024-05-28 18:42:23] [INFO ] Computed 4 invariants in 13 ms
[2024-05-28 18:42:23] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-28 18:42:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:23] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-28 18:42:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 18:42:24] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-28 18:42:24] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-28 18:42:24] [INFO ] After 270ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-28 18:42:24] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 2 ms to minimize.
[2024-05-28 18:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-28 18:42:24] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 346 ms.
[2024-05-28 18:42:25] [INFO ] After 1431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 150 ms.
Support contains 7 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 234/234 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 121 transition count 167
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 121 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 121 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 112 transition count 156
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 112 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 112 transition count 152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 107 transition count 147
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 107 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 103 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 103 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 101 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 101 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 71 place count 101 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 100 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 100 transition count 134
Applied a total of 73 rules in 55 ms. Remains 100 /131 variables (removed 31) and now considering 134/234 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 100/131 places, 134/234 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1061 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 575898 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 575898 steps, saw 244477 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 134 rows 100 cols
[2024-05-28 18:42:28] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 18:42:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:29] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 18:42:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 18:42:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:29] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-28 18:42:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-28 18:42:29] [INFO ] After 78ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-28 18:42:29] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-28 18:42:29] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 96 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 96 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 96 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 95 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 95 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 95 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 94 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 94 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 93 transition count 116
Applied a total of 17 rules in 25 ms. Remains 93 /100 variables (removed 7) and now considering 116/134 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 93/100 places, 116/134 transitions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 431682 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431682 steps, saw 195996 distinct states, run finished after 3002 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 116 rows 93 cols
[2024-05-28 18:42:33] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 18:42:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 18:42:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:33] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 18:42:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 18:42:33] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-28 18:42:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 18:42:33] [INFO ] After 96ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-28 18:42:33] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-28 18:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-28 18:42:33] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-28 18:42:34] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 93 /93 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 93/93 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-28 18:42:34] [INFO ] Invariant cache hit.
[2024-05-28 18:42:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 18:42:34] [INFO ] Invariant cache hit.
[2024-05-28 18:42:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 18:42:34] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-05-28 18:42:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 18:42:34] [INFO ] Invariant cache hit.
[2024-05-28 18:42:34] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 93/93 places, 116/116 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 93 transition count 110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 110
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 88 transition count 97
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 75 transition count 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 66 transition count 88
Applied a total of 55 rules in 18 ms. Remains 66 /93 variables (removed 27) and now considering 88/116 (removed 28) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 88 rows 66 cols
[2024-05-28 18:42:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 18:42:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:34] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 18:42:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:34] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-28 18:42:34] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 18:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-28 18:42:35] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-28 18:42:35] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 27 stabilizing places and 45 stable transitions
Graph (complete) has 504 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 38 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 18:42:35] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:42:35] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-28 18:42:35] [INFO ] Invariant cache hit.
[2024-05-28 18:42:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:42:35] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-28 18:42:36] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 18:42:36] [INFO ] Invariant cache hit.
[2024-05-28 18:42:36] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 629 ms. Remains : 91/135 places, 117/241 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (OR (LT s1 1) (LT s86 1)) (OR (LT s1 1) (LT s85 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22530 reset in 475 ms.
Product exploration explored 100000 steps with 22421 reset in 360 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.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 138 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 662046 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{0=1, 3=1}
Probabilistic random walk after 662046 steps, saw 297153 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :2
Running SMT prover for 2 properties.
[2024-05-28 18:42:41] [INFO ] Invariant cache hit.
[2024-05-28 18:42:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 18:42:41] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-28 18:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:41] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-28 18:42:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:42:41] [INFO ] After 37ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-28 18:42:41] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-28 18:42:41] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 6 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/91 places, 115/117 transitions.
Incomplete random walk after 10000 steps, including 2209 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 466 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2252443 steps, run timeout after 3001 ms. (steps per millisecond=750 ) properties seen :{}
Probabilistic random walk after 2252443 steps, saw 999609 distinct states, run finished after 3001 ms. (steps per millisecond=750 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 18:42:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 18:42:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:44] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 18:42:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:44] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 18:42:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 18:42:44] [INFO ] After 35ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 18:42:44] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-28 18:42:44] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 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 5 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 5 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 3 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 18:42:44] [INFO ] Invariant cache hit.
[2024-05-28 18:42:44] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 18:42:44] [INFO ] Invariant cache hit.
[2024-05-28 18:42:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 18:42:45] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-28 18:42:45] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 18:42:45] [INFO ] Invariant cache hit.
[2024-05-28 18:42:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 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 12 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 18:42:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 18:42:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 18:42:45] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 18:42:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 18:42:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:45] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 18:42:45] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-28 18:42:45] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 10 factoid took 198 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 18:42:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:42:45] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 18:42:45] [INFO ] Invariant cache hit.
[2024-05-28 18:42:45] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:42:46] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-28 18:42:46] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 18:42:46] [INFO ] Invariant cache hit.
[2024-05-28 18:42:46] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 492 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.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 504 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4289 steps, run visited all 1 properties in 36 ms. (steps per millisecond=119 )
Probabilistic random walk after 4289 steps, saw 1916 distinct states, run finished after 36 ms. (steps per millisecond=119 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22460 reset in 312 ms.
Product exploration explored 100000 steps with 22348 reset in 272 ms.
Built C files in :
/tmp/ltsmin14102831978338046054
[2024-05-28 18:42:47] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 18:42:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:42:47] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 18:42:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:42:47] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 18:42:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:42:47] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14102831978338046054
Running compilation step : cd /tmp/ltsmin14102831978338046054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 576 ms.
Running link step : cd /tmp/ltsmin14102831978338046054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14102831978338046054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10103076552553935325.hoa' '--buchi-type=spotba'
LTSmin run took 368 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 finished in 12885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(G(p1)||X(p2)))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 145
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 130
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 108 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 101 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 101 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 101 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 97 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 97 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 93 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 93 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 90 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 90 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 90 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 88 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 88 transition count 97
Applied a total of 108 rules in 17 ms. Remains 88 /135 variables (removed 47) and now considering 97/241 (removed 144) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-05-28 18:42:48] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 18:42:48] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 18:42:48] [INFO ] Invariant cache hit.
[2024-05-28 18:42:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 18:42:48] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-28 18:42:48] [INFO ] Invariant cache hit.
[2024-05-28 18:42:48] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/135 places, 97/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 88/135 places, 97/241 transitions.
Stuttering acceptance computed with spot in 288 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s54 1)), p2:(AND (GEQ s15 1) (GEQ s27 1)), p1:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&(X(G(!p0))||G(!p1))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 152
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 152
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 108 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 108 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 108 transition count 132
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 101 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 101 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 79 place count 101 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 98 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 95 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 94 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 94 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 93 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 93 transition count 110
Applied a total of 97 rules in 27 ms. Remains 93 /135 variables (removed 42) and now considering 110/241 (removed 131) transitions.
// Phase 1: matrix 110 rows 93 cols
[2024-05-28 18:42:49] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:42:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 18:42:49] [INFO ] Invariant cache hit.
[2024-05-28 18:42:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 18:42:49] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-28 18:42:49] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 18:42:49] [INFO ] Invariant cache hit.
[2024-05-28 18:42:49] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/135 places, 110/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 93/135 places, 110/241 transitions.
Stuttering acceptance computed with spot in 129 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22408 reset in 153 ms.
Product exploration explored 100000 steps with 22413 reset in 169 ms.
Computed a total of 22 stabilizing places and 29 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, (AND p1 p0), p0]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2038635 steps, run timeout after 3001 ms. (steps per millisecond=679 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2038635 steps, saw 946681 distinct states, run finished after 3001 ms. (steps per millisecond=679 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-28 18:42:53] [INFO ] Invariant cache hit.
[2024-05-28 18:42:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 18:42:53] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 18:42:53] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 8 factoid took 171 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 114 ms :[p0, (AND p1 p0), p0]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-28 18:42:54] [INFO ] Invariant cache hit.
[2024-05-28 18:42:54] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 18:42:54] [INFO ] Invariant cache hit.
[2024-05-28 18:42:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 18:42:54] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-28 18:42:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 18:42:54] [INFO ] Invariant cache hit.
[2024-05-28 18:42:54] [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 454 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 22 stabilizing places and 29 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, (AND p1 p0), p0]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 422 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1984535 steps, run timeout after 3001 ms. (steps per millisecond=661 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1984535 steps, saw 923438 distinct states, run finished after 3001 ms. (steps per millisecond=661 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-28 18:42:58] [INFO ] Invariant cache hit.
[2024-05-28 18:42:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:42:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 18:42:58] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 8 factoid took 168 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 124 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 113 ms :[p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 22490 reset in 168 ms.
Product exploration explored 100000 steps with 22579 reset in 170 ms.
Built C files in :
/tmp/ltsmin828598660206269230
[2024-05-28 18:42:59] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-28 18:42:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:42:59] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-28 18:42:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:42:59] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-28 18:42:59] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:42:59] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin828598660206269230
Running compilation step : cd /tmp/ltsmin828598660206269230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin828598660206269230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin828598660206269230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17083331700764570225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-28 18:43:14] [INFO ] Invariant cache hit.
[2024-05-28 18:43:14] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 18:43:14] [INFO ] Invariant cache hit.
[2024-05-28 18:43:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 18:43:14] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-28 18:43:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:43:14] [INFO ] Invariant cache hit.
[2024-05-28 18:43:14] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 93/93 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin15270466540378931953
[2024-05-28 18:43:14] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-28 18:43:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:43:14] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-28 18:43:14] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:43:14] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-28 18:43:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:43:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15270466540378931953
Running compilation step : cd /tmp/ltsmin15270466540378931953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin15270466540378931953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15270466540378931953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17523642221562318280.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 18:43:30] [INFO ] Flatten gal took : 13 ms
[2024-05-28 18:43:30] [INFO ] Flatten gal took : 10 ms
[2024-05-28 18:43:30] [INFO ] Time to serialize gal into /tmp/LTL6157671583577777494.gal : 4 ms
[2024-05-28 18:43:30] [INFO ] Time to serialize properties into /tmp/LTL5051644548241654530.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6157671583577777494.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14114260559889070253.hoa' '-atoms' '/tmp/LTL5051644548241654530.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5051644548241654530.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14114260559889070253.hoa
Detected timeout of ITS tools.
[2024-05-28 18:43:45] [INFO ] Flatten gal took : 9 ms
[2024-05-28 18:43:45] [INFO ] Flatten gal took : 12 ms
[2024-05-28 18:43:45] [INFO ] Time to serialize gal into /tmp/LTL9701812553315375897.gal : 3 ms
[2024-05-28 18:43:45] [INFO ] Time to serialize properties into /tmp/LTL11448728480784272433.ltl : 4 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9701812553315375897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11448728480784272433.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((s1<1)||(l125<1))")))||((F("((s1<1)||(l125<1))"))&&((X(G("((s1<1)||(l125<1))")))||(G("((s1<1)||(l1190<1))")))))))
Formula 0 simplified : G(FG!"((s1<1)||(l125<1))" & (G!"((s1<1)||(l125<1))" | (XF!"((s1<1)||(l125<1))" & F!"((s1<1)||(l1190<1))")))
Detected timeout of ITS tools.
[2024-05-28 18:44:00] [INFO ] Flatten gal took : 9 ms
[2024-05-28 18:44:00] [INFO ] Applying decomposition
[2024-05-28 18:44:00] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8616491587140140756.txt' '-o' '/tmp/graph8616491587140140756.bin' '-w' '/tmp/graph8616491587140140756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8616491587140140756.bin' '-l' '-1' '-v' '-w' '/tmp/graph8616491587140140756.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:44:00] [INFO ] Decomposing Gal with order
[2024-05-28 18:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:44:00] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-28 18:44:00] [INFO ] Flatten gal took : 60 ms
[2024-05-28 18:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 12 ms.
[2024-05-28 18:44:00] [INFO ] Time to serialize gal into /tmp/LTL3702475939264007186.gal : 4 ms
[2024-05-28 18:44:00] [INFO ] Time to serialize properties into /tmp/LTL17406837092460588647.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3702475939264007186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17406837092460588647.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i0.u0.s1<1)||(i6.u5.l125<1))")))||((F("((i0.u0.s1<1)||(i6.u5.l125<1))"))&&((X(G("((i0.u0.s1<1)||(i6.u5.l125<1))")))||(G("...195
Formula 0 simplified : G(FG!"((i0.u0.s1<1)||(i6.u5.l125<1))" & (G!"((i0.u0.s1<1)||(i6.u5.l125<1))" | (XF!"((i0.u0.s1<1)||(i6.u5.l125<1))" & F!"((i0.u0.s1<1...179
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9525591073629840260
[2024-05-28 18:44:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9525591073629840260
Running compilation step : cd /tmp/ltsmin9525591073629840260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin9525591073629840260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9525591073629840260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(X([]((LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 finished in 101584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||G((F(p3)&&p2))))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 153
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 122 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 40 place count 109 transition count 138
Iterating global reduction 1 with 13 rules applied. Total rules applied 53 place count 109 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 109 transition count 133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 101 transition count 125
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 101 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 93 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 93 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 93 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 91 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 90 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 89 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 89 transition count 106
Applied a total of 104 rules in 14 ms. Remains 89 /135 variables (removed 46) and now considering 106/241 (removed 135) transitions.
// Phase 1: matrix 106 rows 89 cols
[2024-05-28 18:44:30] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 18:44:30] [INFO ] Invariant cache hit.
[2024-05-28 18:44:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 18:44:30] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-28 18:44:30] [INFO ] Invariant cache hit.
[2024-05-28 18:44:31] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/135 places, 106/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 89/135 places, 106/241 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (GEQ s23 1) (GEQ s78 1)), p0:(AND (GEQ s1 1) (GEQ s31 1)), p2:(AND (GEQ s1 1) (GEQ s83 1)), p3:(AND (GEQ s1 1) (GEQ s74 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 99 transition count 121
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 99 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 99 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 96 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 93 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 92 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 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 100 place count 92 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 91 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 91 transition count 106
Applied a total of 102 rules in 13 ms. Remains 91 /135 variables (removed 44) and now considering 106/241 (removed 135) transitions.
// Phase 1: matrix 106 rows 91 cols
[2024-05-28 18:44:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:31] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 18:44:31] [INFO ] Invariant cache hit.
[2024-05-28 18:44:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 18:44:31] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-28 18:44:31] [INFO ] Invariant cache hit.
[2024-05-28 18:44:31] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/135 places, 106/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 91/135 places, 106/241 transitions.
Stuttering acceptance computed with spot in 232 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1)), p1:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22420 reset in 211 ms.
Product exploration explored 100000 steps with 22465 reset in 227 ms.
Computed a total of 20 stabilizing places and 25 stable transitions
Graph (complete) has 291 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 25 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 87 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 78 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2115128 steps, run timeout after 3001 ms. (steps per millisecond=704 ) properties seen :{}
Probabilistic random walk after 2115128 steps, saw 886098 distinct states, run finished after 3001 ms. (steps per millisecond=704 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 18:44:35] [INFO ] Invariant cache hit.
[2024-05-28 18:44:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:44:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 18:44:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 finished in 4396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 119 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 119 transition count 142
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 119 transition count 141
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 105 transition count 126
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 105 transition count 126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 105 transition count 119
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 97 transition count 111
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 97 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 97 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 94 place count 93 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 93 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 89 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 87 transition count 95
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 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 85 transition count 91
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 85 transition count 91
Applied a total of 116 rules in 25 ms. Remains 85 /135 variables (removed 50) and now considering 91/241 (removed 150) transitions.
// Phase 1: matrix 91 rows 85 cols
[2024-05-28 18:44:35] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 18:44:35] [INFO ] Invariant cache hit.
[2024-05-28 18:44:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 18:44:35] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-28 18:44:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 18:44:35] [INFO ] Invariant cache hit.
[2024-05-28 18:44:36] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/135 places, 91/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 85/135 places, 91/241 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 16 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 18:44:36] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 18:44:36] [INFO ] Invariant cache hit.
[2024-05-28 18:44:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 18:44:36] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-28 18:44:36] [INFO ] Invariant cache hit.
[2024-05-28 18:44:36] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 23 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 18:44:36] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:36] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 18:44:36] [INFO ] Invariant cache hit.
[2024-05-28 18:44:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 18:44:36] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-28 18:44:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 18:44:36] [INFO ] Invariant cache hit.
[2024-05-28 18:44:36] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 19 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 18:44:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 18:44:37] [INFO ] Invariant cache hit.
[2024-05-28 18:44:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 18:44:37] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-28 18:44:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 18:44:37] [INFO ] Invariant cache hit.
[2024-05-28 18:44:37] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 451 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22474 reset in 133 ms.
Product exploration explored 100000 steps with 22500 reset in 147 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2236 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 468 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1534 ms. (steps per millisecond=730 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1535 ms. (steps per millisecond=729 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
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.
[2024-05-28 18:44:39] [INFO ] Invariant cache hit.
[2024-05-28 18:44:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 18:44:39] [INFO ] Invariant cache hit.
[2024-05-28 18:44:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 18:44:39] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-28 18:44:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:44:39] [INFO ] Invariant cache hit.
[2024-05-28 18:44:40] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 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 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1523 ms. (steps per millisecond=735 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1523 ms. (steps per millisecond=735 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22382 reset in 127 ms.
Product exploration explored 100000 steps with 22491 reset in 138 ms.
Built C files in :
/tmp/ltsmin16943474829686645720
[2024-05-28 18:44:42] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 18:44:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:44:42] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 18:44:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:44:42] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 18:44:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:44:42] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16943474829686645720
Running compilation step : cd /tmp/ltsmin16943474829686645720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 313 ms.
Running link step : cd /tmp/ltsmin16943474829686645720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16943474829686645720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8713612293119622016.hoa' '--buchi-type=spotba'
LTSmin run took 309 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 finished in 5919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||p0))||F(p2)))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 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 27 place count 122 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 110 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 110 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 110 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 103 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 103 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 101 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 99 transition count 127
Applied a total of 82 rules in 7 ms. Remains 99 /135 variables (removed 36) and now considering 127/241 (removed 114) transitions.
// Phase 1: matrix 127 rows 99 cols
[2024-05-28 18:44:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 18:44:43] [INFO ] Invariant cache hit.
[2024-05-28 18:44:43] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 18:44:43] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-28 18:44:43] [INFO ] Invariant cache hit.
[2024-05-28 18:44:43] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/135 places, 127/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 99/135 places, 127/241 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (AND (GEQ s1 1) (GEQ s55 1)) (AND (GEQ s1 1) (GEQ s94 1))), p0:(OR (LT s1 1) (LT s93 1)), p1:(OR (LT s1 1) (LT s93 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 50000 reset in 391 ms.
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 326 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 finished in 1420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 119 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 119 transition count 142
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 119 transition count 141
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 48 place count 104 transition count 124
Iterating global reduction 1 with 15 rules applied. Total rules applied 63 place count 104 transition count 124
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 104 transition count 117
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 95 transition count 108
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 95 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 95 transition count 102
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 90 transition count 97
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 90 transition count 97
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 85 transition count 92
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 85 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 82 transition count 89
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 82 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 82 transition count 87
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 79 transition count 83
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 77 transition count 81
Applied a total of 132 rules in 18 ms. Remains 77 /135 variables (removed 58) and now considering 81/241 (removed 160) transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-05-28 18:44:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:44:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-28 18:44:44] [INFO ] Invariant cache hit.
[2024-05-28 18:44:44] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 18:44:44] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-28 18:44:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:44:44] [INFO ] Invariant cache hit.
[2024-05-28 18:44:44] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/135 places, 81/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 77/135 places, 81/241 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s23 1)), p0:(OR (LT s1 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22911 reset in 125 ms.
Product exploration explored 100000 steps with 23128 reset in 381 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 18:44:45] [INFO ] Invariant cache hit.
[2024-05-28 18:44:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 18:44:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-28 18:44:45] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-28 18:44:45] [INFO ] Invariant cache hit.
[2024-05-28 18:44:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 18:44:45] [INFO ] Invariant cache hit.
[2024-05-28 18:44:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 18:44:46] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-28 18:44:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:44:46] [INFO ] Invariant cache hit.
[2024-05-28 18:44:46] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 339 ms. Remains : 77/77 places, 81/81 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 10 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22928 reset in 110 ms.
Product exploration explored 100000 steps with 22926 reset in 128 ms.
Built C files in :
/tmp/ltsmin13504659865717447330
[2024-05-28 18:44:46] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-28 18:44:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:44:46] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-28 18:44:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:44:46] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-28 18:44:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:44:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13504659865717447330
Running compilation step : cd /tmp/ltsmin13504659865717447330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin13504659865717447330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13504659865717447330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4609354894692378249.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-28 18:45:02] [INFO ] Invariant cache hit.
[2024-05-28 18:45:02] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 18:45:02] [INFO ] Invariant cache hit.
[2024-05-28 18:45:02] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 18:45:02] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-28 18:45:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:45:02] [INFO ] Invariant cache hit.
[2024-05-28 18:45:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 77/77 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin13326672448681295091
[2024-05-28 18:45:02] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-28 18:45:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:45:02] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-28 18:45:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:45:02] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-28 18:45:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:45:02] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13326672448681295091
Running compilation step : cd /tmp/ltsmin13326672448681295091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 262 ms.
Running link step : cd /tmp/ltsmin13326672448681295091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13326672448681295091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4247576108672843876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 18:45:17] [INFO ] Flatten gal took : 7 ms
[2024-05-28 18:45:17] [INFO ] Flatten gal took : 7 ms
[2024-05-28 18:45:17] [INFO ] Time to serialize gal into /tmp/LTL9057117425987216567.gal : 2 ms
[2024-05-28 18:45:17] [INFO ] Time to serialize properties into /tmp/LTL3388299863748562633.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9057117425987216567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut516319449412151915.hoa' '-atoms' '/tmp/LTL3388299863748562633.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3388299863748562633.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut516319449412151915.hoa
Detected timeout of ITS tools.
[2024-05-28 18:45:32] [INFO ] Flatten gal took : 7 ms
[2024-05-28 18:45:32] [INFO ] Flatten gal took : 6 ms
[2024-05-28 18:45:32] [INFO ] Time to serialize gal into /tmp/LTL13287882055621881470.gal : 2 ms
[2024-05-28 18:45:32] [INFO ] Time to serialize properties into /tmp/LTL483516250794578472.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13287882055621881470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL483516250794578472.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l5<1))")||(G("((s4>=1)&&(l0>=1))"))))))
Formula 0 simplified : G(F!"((s4>=1)&&(l0>=1))" & FG!"((s1<1)||(l5<1))")
Detected timeout of ITS tools.
[2024-05-28 18:45:47] [INFO ] Flatten gal took : 6 ms
[2024-05-28 18:45:47] [INFO ] Applying decomposition
[2024-05-28 18:45:47] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph327531021093292702.txt' '-o' '/tmp/graph327531021093292702.bin' '-w' '/tmp/graph327531021093292702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph327531021093292702.bin' '-l' '-1' '-v' '-w' '/tmp/graph327531021093292702.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:45:47] [INFO ] Decomposing Gal with order
[2024-05-28 18:45:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:45:47] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 18:45:47] [INFO ] Flatten gal took : 19 ms
[2024-05-28 18:45:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2024-05-28 18:45:47] [INFO ] Time to serialize gal into /tmp/LTL8373711118311151375.gal : 4 ms
[2024-05-28 18:45:47] [INFO ] Time to serialize properties into /tmp/LTL8149232830789904091.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8373711118311151375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8149232830789904091.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i0.u0.s1<1)||(i1.u2.l5<1))")||(G("((i1.u2.s4>=1)&&(i0.u0.l0>=1))"))))))
Formula 0 simplified : G(F!"((i1.u2.s4>=1)&&(i0.u0.l0>=1))" & FG!"((i0.u0.s1<1)||(i1.u2.l5<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13897829984554830744
[2024-05-28 18:46:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13897829984554830744
Running compilation step : cd /tmp/ltsmin13897829984554830744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin13897829984554830744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13897829984554830744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 finished in 93500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 13 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 18:46:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:46:17] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 18:46:17] [INFO ] Invariant cache hit.
[2024-05-28 18:46:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:46:18] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-28 18:46:18] [INFO ] Invariant cache hit.
[2024-05-28 18:46:18] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 91/135 places, 117/241 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (OR (LT s1 1) (LT s84 1)) (OR (LT s1 1) (LT s86 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22377 reset in 171 ms.
Product exploration explored 100000 steps with 22321 reset in 184 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1680472 steps, run timeout after 3001 ms. (steps per millisecond=559 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1680472 steps, saw 733703 distinct states, run finished after 3001 ms. (steps per millisecond=559 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-28 18:46:22] [INFO ] Invariant cache hit.
[2024-05-28 18:46:22] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
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.
[2024-05-28 18:46:23] [INFO ] Invariant cache hit.
[2024-05-28 18:46:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 18:46:23] [INFO ] Invariant cache hit.
[2024-05-28 18:46:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:46:23] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-28 18:46:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 18:46:23] [INFO ] Invariant cache hit.
[2024-05-28 18:46:23] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 437 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1671618 steps, run timeout after 3006 ms. (steps per millisecond=556 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1671618 steps, saw 729560 distinct states, run finished after 3006 ms. (steps per millisecond=556 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-28 18:46:27] [INFO ] Invariant cache hit.
[2024-05-28 18:46:27] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 10 factoid took 232 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 22509 reset in 177 ms.
Product exploration explored 100000 steps with 22514 reset in 192 ms.
Built C files in :
/tmp/ltsmin13015476602406420726
[2024-05-28 18:46:28] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 18:46:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:46:28] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 18:46:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:46:28] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 18:46:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:46:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13015476602406420726
Running compilation step : cd /tmp/ltsmin13015476602406420726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 369 ms.
Running link step : cd /tmp/ltsmin13015476602406420726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13015476602406420726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17078012016703604385.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.
[2024-05-28 18:46:44] [INFO ] Invariant cache hit.
[2024-05-28 18:46:44] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 18:46:44] [INFO ] Invariant cache hit.
[2024-05-28 18:46:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:46:44] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-28 18:46:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:46:44] [INFO ] Invariant cache hit.
[2024-05-28 18:46:44] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 447 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin6110139566814938533
[2024-05-28 18:46:44] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 18:46:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:46:44] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 18:46:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:46:44] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 18:46:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:46:44] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6110139566814938533
Running compilation step : cd /tmp/ltsmin6110139566814938533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin6110139566814938533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6110139566814938533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17122918074920642757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 18:46:59] [INFO ] Flatten gal took : 9 ms
[2024-05-28 18:46:59] [INFO ] Flatten gal took : 8 ms
[2024-05-28 18:46:59] [INFO ] Time to serialize gal into /tmp/LTL13212045265761542754.gal : 1 ms
[2024-05-28 18:46:59] [INFO ] Time to serialize properties into /tmp/LTL4541851198579904262.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13212045265761542754.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2137766119096739917.hoa' '-atoms' '/tmp/LTL4541851198579904262.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4541851198579904262.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2137766119096739917.hoa
Detected timeout of ITS tools.
[2024-05-28 18:47:14] [INFO ] Flatten gal took : 7 ms
[2024-05-28 18:47:14] [INFO ] Flatten gal took : 6 ms
[2024-05-28 18:47:14] [INFO ] Time to serialize gal into /tmp/LTL5107500123497765546.gal : 1 ms
[2024-05-28 18:47:14] [INFO ] Time to serialize properties into /tmp/LTL8160527151946615319.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5107500123497765546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8160527151946615319.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")))||("((s1>=1)&&(l1189>=1))")))))
Formula 0 simplified : XG(!"((s1>=1)&&(l1189>=1))" & FG!"(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")
Detected timeout of ITS tools.
[2024-05-28 18:47:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 18:47:29] [INFO ] Applying decomposition
[2024-05-28 18:47:29] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16408576738142500784.txt' '-o' '/tmp/graph16408576738142500784.bin' '-w' '/tmp/graph16408576738142500784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16408576738142500784.bin' '-l' '-1' '-v' '-w' '/tmp/graph16408576738142500784.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:47:29] [INFO ] Decomposing Gal with order
[2024-05-28 18:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:47:29] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-28 18:47:29] [INFO ] Flatten gal took : 22 ms
[2024-05-28 18:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2024-05-28 18:47:29] [INFO ] Time to serialize gal into /tmp/LTL7021463586319060380.gal : 3 ms
[2024-05-28 18:47:29] [INFO ] Time to serialize properties into /tmp/LTL12882331682192230657.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7021463586319060380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12882331682192230657.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((i6.u0.s1<1)||(i5.u15.l1186<1))&&((i6.u0.s1<1)||(i5.u17.l1189<1)))")))||("((i6.u0.s1>=1)&&(i5.u17.l1189>=1))")))))
Formula 0 simplified : XG(!"((i6.u0.s1>=1)&&(i5.u17.l1189>=1))" & FG!"(((i6.u0.s1<1)||(i5.u15.l1186<1))&&((i6.u0.s1<1)||(i5.u17.l1189<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1633360430378397910
[2024-05-28 18:47:44] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1633360430378397910
Running compilation step : cd /tmp/ltsmin1633360430378397910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 306 ms.
Running link step : cd /tmp/ltsmin1633360430378397910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1633360430378397910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp0==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 102132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 109 transition count 146
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 109 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 109 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 101 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 101 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 101 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 97 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 93 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 93 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 91 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 91 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 89 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 88 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 87 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 87 transition count 110
Applied a total of 110 rules in 42 ms. Remains 87 /135 variables (removed 48) and now considering 110/241 (removed 131) transitions.
// Phase 1: matrix 110 rows 87 cols
[2024-05-28 18:48:00] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:48:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 18:48:00] [INFO ] Invariant cache hit.
[2024-05-28 18:48:00] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 18:48:00] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-28 18:48:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:48:00] [INFO ] Invariant cache hit.
[2024-05-28 18:48:00] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/135 places, 110/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 87/135 places, 110/241 transitions.
Stuttering acceptance computed with spot in 174 ms :[p1, true, (AND p1 p2), p1, (AND p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s80 1)), p0:(OR (AND (GEQ s1 1) (GEQ s80 1)) (AND (GEQ s1 1) (GEQ s82 1))), p2:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 22340 reset in 163 ms.
Product exploration explored 100000 steps with 22434 reset in 178 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 286 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 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 351 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, p1]
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4088 steps, run visited all 1 properties in 9 ms. (steps per millisecond=454 )
Probabilistic random walk after 4088 steps, saw 1897 distinct states, run finished after 9 ms. (steps per millisecond=454 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 22 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 finished in 1806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&(X(G(!p0))||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 20 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 18:48:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 18:48:02] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 18:48:02] [INFO ] Invariant cache hit.
[2024-05-28 18:48:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:48:02] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-28 18:48:02] [INFO ] Invariant cache hit.
[2024-05-28 18:48:02] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 472 ms. Remains : 91/135 places, 117/241 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (OR (LT s1 1) (LT s84 1)) (OR (LT s1 1) (LT s86 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22429 reset in 168 ms.
Product exploration explored 100000 steps with 22454 reset in 185 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1713455 steps, run timeout after 3001 ms. (steps per millisecond=570 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1713455 steps, saw 748268 distinct states, run finished after 3001 ms. (steps per millisecond=570 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-28 18:48:06] [INFO ] Invariant cache hit.
[2024-05-28 18:48:06] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
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.
[2024-05-28 18:48:07] [INFO ] Invariant cache hit.
[2024-05-28 18:48:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 18:48:07] [INFO ] Invariant cache hit.
[2024-05-28 18:48:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:48:07] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-28 18:48:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 18:48:07] [INFO ] Invariant cache hit.
[2024-05-28 18:48:07] [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 443 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 p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1708611 steps, run timeout after 3001 ms. (steps per millisecond=569 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1708611 steps, saw 746273 distinct states, run finished after 3006 ms. (steps per millisecond=568 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-28 18:48:11] [INFO ] Invariant cache hit.
[2024-05-28 18:48:11] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 10 factoid took 239 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 22386 reset in 178 ms.
Product exploration explored 100000 steps with 22441 reset in 187 ms.
Built C files in :
/tmp/ltsmin17208949734611126562
[2024-05-28 18:48:12] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 18:48:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:48:12] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 18:48:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:48:12] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 18:48:12] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:48:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17208949734611126562
Running compilation step : cd /tmp/ltsmin17208949734611126562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin17208949734611126562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17208949734611126562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12243140461094543743.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 2 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 18:48:27] [INFO ] Invariant cache hit.
[2024-05-28 18:48:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 18:48:27] [INFO ] Invariant cache hit.
[2024-05-28 18:48:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 18:48:28] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-28 18:48:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 18:48:28] [INFO ] Invariant cache hit.
[2024-05-28 18:48:28] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin9905429294520950827
[2024-05-28 18:48:28] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 18:48:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:48:28] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 18:48:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:48:28] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 18:48:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:48:28] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9905429294520950827
Running compilation step : cd /tmp/ltsmin9905429294520950827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 558 ms.
Running link step : cd /tmp/ltsmin9905429294520950827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9905429294520950827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13455062927667053661.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 18:48:43] [INFO ] Flatten gal took : 7 ms
[2024-05-28 18:48:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 18:48:43] [INFO ] Time to serialize gal into /tmp/LTL7319232740012980954.gal : 1 ms
[2024-05-28 18:48:43] [INFO ] Time to serialize properties into /tmp/LTL15790433364068809966.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7319232740012980954.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16397873886059312922.hoa' '-atoms' '/tmp/LTL15790433364068809966.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15790433364068809966.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16397873886059312922.hoa
Detected timeout of ITS tools.
[2024-05-28 18:48:58] [INFO ] Flatten gal took : 6 ms
[2024-05-28 18:48:58] [INFO ] Flatten gal took : 7 ms
[2024-05-28 18:48:58] [INFO ] Time to serialize gal into /tmp/LTL10304179995098890688.gal : 2 ms
[2024-05-28 18:48:58] [INFO ] Time to serialize properties into /tmp/LTL2980365957873090048.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10304179995098890688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2980365957873090048.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")))||("((s1>=1)&&(l1189>=1))")))))
Formula 0 simplified : XG(!"((s1>=1)&&(l1189>=1))" & FG!"(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")
Detected timeout of ITS tools.
[2024-05-28 18:49:13] [INFO ] Flatten gal took : 5 ms
[2024-05-28 18:49:13] [INFO ] Applying decomposition
[2024-05-28 18:49:13] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7237135782193971050.txt' '-o' '/tmp/graph7237135782193971050.bin' '-w' '/tmp/graph7237135782193971050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7237135782193971050.bin' '-l' '-1' '-v' '-w' '/tmp/graph7237135782193971050.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:49:13] [INFO ] Decomposing Gal with order
[2024-05-28 18:49:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:49:13] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-28 18:49:13] [INFO ] Flatten gal took : 14 ms
[2024-05-28 18:49:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 3 ms.
[2024-05-28 18:49:13] [INFO ] Time to serialize gal into /tmp/LTL4081316940989084399.gal : 2 ms
[2024-05-28 18:49:13] [INFO ] Time to serialize properties into /tmp/LTL2372597488274526061.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4081316940989084399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2372597488274526061.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((i0.u0.s1<1)||(u14.l1186<1))&&((i0.u0.s1<1)||(u14.l1189<1)))")))||("((i0.u0.s1>=1)&&(u14.l1189>=1))")))))
Formula 0 simplified : XG(!"((i0.u0.s1>=1)&&(u14.l1189>=1))" & FG!"(((i0.u0.s1<1)||(u14.l1186<1))&&((i0.u0.s1<1)||(u14.l1189<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18413298395381849374
[2024-05-28 18:49:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18413298395381849374
Running compilation step : cd /tmp/ltsmin18413298395381849374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin18413298395381849374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18413298395381849374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp0==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 101659 ms.
[2024-05-28 18:49:43] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4379495612949736314
[2024-05-28 18:49:43] [INFO ] Applying decomposition
[2024-05-28 18:49:43] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 18:49:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:49:43] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 18:49:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:49:43] [INFO ] Flatten gal took : 9 ms
[2024-05-28 18:49:43] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 18:49:43] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:49:43] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4379495612949736314
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18251422142238058377.txt' '-o' '/tmp/graph18251422142238058377.bin' '-w' '/tmp/graph18251422142238058377.weights'
Running compilation step : cd /tmp/ltsmin4379495612949736314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18251422142238058377.bin' '-l' '-1' '-v' '-w' '/tmp/graph18251422142238058377.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:49:43] [INFO ] Decomposing Gal with order
[2024-05-28 18:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:49:43] [INFO ] Removed a total of 326 redundant transitions.
[2024-05-28 18:49:43] [INFO ] Flatten gal took : 25 ms
[2024-05-28 18:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 24 ms.
[2024-05-28 18:49:43] [INFO ] Time to serialize gal into /tmp/LTLFireability12289277909615942295.gal : 2 ms
[2024-05-28 18:49:43] [INFO ] Time to serialize properties into /tmp/LTLFireability991904827804744021.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12289277909615942295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability991904827804744021.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F((G(F(!("((i7.u0.s1>=1)&&(i10.u8.l125>=1))"))))||((F(!("((i7.u0.s1>=1)&&(i10.u8.l125>=1))")))&&((X(G(!("((i7.u0.s1>=1)&&(i10.u8.l1...218
Formula 0 simplified : G(FG"((i7.u0.s1>=1)&&(i10.u8.l125>=1))" & (G"((i7.u0.s1>=1)&&(i10.u8.l125>=1))" | (XF"((i7.u0.s1>=1)&&(i10.u8.l125>=1))" & F"((i7.u0...186
Compilation finished in 734 ms.
Running link step : cd /tmp/ltsmin4379495612949736314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4379495612949736314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: LTL layer: formula: <>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: "<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.047: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.086: DFS-FIFO for weak LTL, using special progress label 248
pins2lts-mc-linux64( 0/ 8), 0.087: There are 249 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.087: State length is 136, there are 248 groups
pins2lts-mc-linux64( 0/ 8), 0.087: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.087: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.087: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.087: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.096: ~1 levels ~960 states ~1888 transitions
pins2lts-mc-linux64( 3/ 8), 0.102: ~1 levels ~1920 states ~3696 transitions
pins2lts-mc-linux64( 3/ 8), 0.116: ~1 levels ~3840 states ~7864 transitions
pins2lts-mc-linux64( 3/ 8), 0.172: ~1 levels ~7680 states ~17456 transitions
pins2lts-mc-linux64( 3/ 8), 0.290: ~1 levels ~15360 states ~33512 transitions
pins2lts-mc-linux64( 3/ 8), 0.580: ~1 levels ~30720 states ~68912 transitions
pins2lts-mc-linux64( 3/ 8), 1.020: ~1 levels ~61440 states ~136088 transitions
pins2lts-mc-linux64( 3/ 8), 1.864: ~1 levels ~122880 states ~277904 transitions
pins2lts-mc-linux64( 1/ 8), 3.176: ~1 levels ~245760 states ~590136 transitions
pins2lts-mc-linux64( 1/ 8), 5.485: ~1 levels ~491520 states ~1196720 transitions
pins2lts-mc-linux64( 1/ 8), 9.278: ~1 levels ~983040 states ~2500640 transitions
pins2lts-mc-linux64( 1/ 8), 14.981: ~1 levels ~1966080 states ~4687560 transitions
pins2lts-mc-linux64( 2/ 8), 26.499: ~1 levels ~3932160 states ~9655512 transitions
pins2lts-mc-linux64( 2/ 8), 49.196: ~1 levels ~7864320 states ~19857424 transitions
pins2lts-mc-linux64( 2/ 8), 93.648: ~1 levels ~15728640 states ~40260672 transitions
pins2lts-mc-linux64( 2/ 8), 180.551: ~1 levels ~31457280 states ~78112032 transitions
pins2lts-mc-linux64( 1/ 8), 357.293: ~1 levels ~62914560 states ~159532064 transitions
pins2lts-mc-linux64( 1/ 8), 718.326: ~1 levels ~125829120 states ~327574552 transitions
pins2lts-mc-linux64( 1/ 8), 827.078: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 827.198:
pins2lts-mc-linux64( 0/ 8), 827.198: mean standard work distribution: 8.3% (states) 8.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 827.198:
pins2lts-mc-linux64( 0/ 8), 827.198: Explored 126258185 states 346045331 transitions, fanout: 2.741
pins2lts-mc-linux64( 0/ 8), 827.198: Total exploration time 827.090 sec (827.000 sec minimum, 827.052 sec on average)
pins2lts-mc-linux64( 0/ 8), 827.198: States per second: 152654, Transitions per second: 418389
pins2lts-mc-linux64( 0/ 8), 827.198:
pins2lts-mc-linux64( 0/ 8), 827.198: Progress states detected: 134217206
pins2lts-mc-linux64( 0/ 8), 827.198: Redundant explorations: -5.9300
pins2lts-mc-linux64( 0/ 8), 827.198:
pins2lts-mc-linux64( 0/ 8), 827.198: Queue width: 8B, total height: 17534023, memory: 133.77MB
pins2lts-mc-linux64( 0/ 8), 827.198: Tree memory: 1036.7MB, 8.1 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 827.198: Tree fill ratio (roots/leafs): 99.0%/4.0%
pins2lts-mc-linux64( 0/ 8), 827.198: Stored 284 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 827.198: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 827.198: Est. total memory use: 1170.5MB (~1157.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4379495612949736314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4379495612949736314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(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.
[2024-05-28 19:12:15] [INFO ] Flatten gal took : 13 ms
[2024-05-28 19:12:15] [INFO ] Time to serialize gal into /tmp/LTLFireability16423447933243534887.gal : 3 ms
[2024-05-28 19:12:15] [INFO ] Time to serialize properties into /tmp/LTLFireability12978100537361979556.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16423447933243534887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12978100537361979556.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((F((G(F(!("((s1>=1)&&(l125>=1))"))))||((F(!("((s1>=1)&&(l125>=1))")))&&((X(G(!("((s1>=1)&&(l125>=1))"))))||(G(!("((s1>=1)&&(l1190>=1...166
Formula 0 simplified : G(FG"((s1>=1)&&(l125>=1))" & (G"((s1>=1)&&(l125>=1))" | (XF"((s1>=1)&&(l125>=1))" & F"((s1>=1)&&(l1190>=1))")))
Detected timeout of ITS tools.
[2024-05-28 19:34:48] [INFO ] Flatten gal took : 389 ms
[2024-05-28 19:34:50] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-28 19:34:50] [INFO ] Transformed 135 places.
[2024-05-28 19:34:50] [INFO ] Transformed 241 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
[2024-05-28 19:34:50] [INFO ] Time to serialize gal into /tmp/LTLFireability3561641771088485504.gal : 38 ms
[2024-05-28 19:34:50] [INFO ] Time to serialize properties into /tmp/LTLFireability11313046120475719967.ltl : 15 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3561641771088485504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11313046120475719967.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F(!("((s1>=1)&&(l125>=1))"))))||((F(!("((s1>=1)&&(l125>=1))")))&&((X(G(!("((s1>=1)&&(l125>=1))"))))||(G(!("((s1>=1)&&(l1190>=1...166
Formula 0 simplified : G(FG"((s1>=1)&&(l125>=1))" & (G"((s1>=1)&&(l125>=1))" | (XF"((s1>=1)&&(l125>=1))" & F"((s1>=1)&&(l1190>=1))")))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12882676 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15712160 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d1m36, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-smll-171683823900048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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