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.r109-tall-171624208500433.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 DES-PT-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 DES-PT-20b-LTLFireability-00
FORMULA_NAME DES-PT-20b-LTLFireability-01
FORMULA_NAME DES-PT-20b-LTLFireability-02
FORMULA_NAME DES-PT-20b-LTLFireability-03
FORMULA_NAME DES-PT-20b-LTLFireability-04
FORMULA_NAME DES-PT-20b-LTLFireability-05
FORMULA_NAME DES-PT-20b-LTLFireability-06
FORMULA_NAME DES-PT-20b-LTLFireability-07
FORMULA_NAME DES-PT-20b-LTLFireability-08
FORMULA_NAME DES-PT-20b-LTLFireability-09
FORMULA_NAME DES-PT-20b-LTLFireability-10
FORMULA_NAME DES-PT-20b-LTLFireability-11
FORMULA_NAME DES-PT-20b-LTLFireability-12
FORMULA_NAME DES-PT-20b-LTLFireability-13
FORMULA_NAME DES-PT-20b-LTLFireability-14
FORMULA_NAME DES-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716336651910

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=DES-PT-20b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 00:10:53] [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-22 00:10:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:10:53] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-22 00:10:53] [INFO ] Transformed 360 places.
[2024-05-22 00:10:53] [INFO ] Transformed 311 transitions.
[2024-05-22 00:10:53] [INFO ] Found NUPN structural information;
[2024-05-22 00:10:53] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-20b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 357 transition count 311
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 336 transition count 290
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 336 transition count 290
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 323 transition count 277
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 323 transition count 277
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 323 transition count 266
Applied a total of 82 rules in 64 ms. Remains 323 /360 variables (removed 37) and now considering 266/311 (removed 45) transitions.
// Phase 1: matrix 266 rows 323 cols
[2024-05-22 00:10:53] [INFO ] Computed 62 invariants in 51 ms
[2024-05-22 00:10:54] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-22 00:10:54] [INFO ] Invariant cache hit.
[2024-05-22 00:10:54] [INFO ] Implicit Places using invariants and state equation in 344 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 887 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 322/360 places, 266/311 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /322 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 964 ms. Remains : 322/360 places, 266/311 transitions.
Support contains 43 out of 322 places after structural reductions.
[2024-05-22 00:10:54] [INFO ] Flatten gal took : 44 ms
[2024-05-22 00:10:54] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:10:54] [INFO ] Input system was already deterministic with 266 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 34) seen :25
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 266 rows 322 cols
[2024-05-22 00:10:55] [INFO ] Computed 61 invariants in 15 ms
[2024-05-22 00:10:55] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 00:10:55] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-22 00:10:55] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-22 00:10:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:10:55] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 36 ms returned sat
[2024-05-22 00:10:56] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 4 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 606 ms
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 4 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 17 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 668 ms
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-22 00:10:58] [INFO ] After 2697ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 240 ms.
[2024-05-22 00:10:58] [INFO ] After 3126ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 596 ms.
Support contains 14 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 266/266 transitions.
Graph (complete) has 662 edges and 322 vertex of which 315 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 315 transition count 243
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 299 transition count 243
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 299 transition count 231
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 287 transition count 231
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 285 transition count 229
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 285 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 285 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 284 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 283 transition count 225
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 283 transition count 225
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 215 place count 210 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 209 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 209 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 208 transition count 151
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 208 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 221 place count 207 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 207 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 206 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 224 place count 205 transition count 149
Applied a total of 224 rules in 85 ms. Remains 205 /322 variables (removed 117) and now considering 149/266 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 205/322 places, 149/266 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 782386 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :{}
Probabilistic random walk after 782386 steps, saw 102681 distinct states, run finished after 3002 ms. (steps per millisecond=260 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 149 rows 205 cols
[2024-05-22 00:11:03] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 00:11:03] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:11:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 00:11:03] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 00:11:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:11:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 47 ms returned sat
[2024-05-22 00:11:03] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 00:11:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:11:03] [INFO ] After 121ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-22 00:11:04] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-05-22 00:11:04] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 291 ms.
Support contains 14 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 149/149 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 149/149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 149/149 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-22 00:11:04] [INFO ] Invariant cache hit.
[2024-05-22 00:11:04] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 00:11:04] [INFO ] Invariant cache hit.
[2024-05-22 00:11:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:11:04] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-22 00:11:04] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 00:11:04] [INFO ] Invariant cache hit.
[2024-05-22 00:11:04] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 205/205 places, 149/149 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Running SMT prover for 8 properties.
[2024-05-22 00:11:04] [INFO ] Invariant cache hit.
[2024-05-22 00:11:05] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:11:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-22 00:11:05] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 00:11:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:11:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 70 ms returned sat
[2024-05-22 00:11:05] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-22 00:11:05] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 121 ms.
[2024-05-22 00:11:05] [INFO ] After 850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 140 stabilizing places and 133 stable transitions
Graph (complete) has 662 edges and 322 vertex of which 315 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
FORMULA DES-PT-20b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)))'
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 317 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 317 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 317 transition count 259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 314 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 314 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 314 transition count 255
Applied a total of 19 rules in 11 ms. Remains 314 /322 variables (removed 8) and now considering 255/266 (removed 11) transitions.
// Phase 1: matrix 255 rows 314 cols
[2024-05-22 00:11:06] [INFO ] Computed 61 invariants in 8 ms
[2024-05-22 00:11:06] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 00:11:06] [INFO ] Invariant cache hit.
[2024-05-22 00:11:06] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-22 00:11:06] [INFO ] Invariant cache hit.
[2024-05-22 00:11:06] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 314/322 places, 255/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 314/322 places, 255/266 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 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s282 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Computed a total of 137 stabilizing places and 130 stable transitions
Graph (complete) has 648 edges and 314 vertex of which 309 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 137 stabilizing places and 130 stable transitions
Detected a total of 137/314 stabilizing places and 130/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20b-LTLFireability-00 finished in 1445 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 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Graph (complete) has 662 edges and 322 vertex of which 315 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 314 transition count 244
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 298 transition count 244
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 298 transition count 232
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 286 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 282 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 282 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 282 transition count 225
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 281 transition count 224
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 280 transition count 223
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 280 transition count 223
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 222 place count 205 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 201 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 200 transition count 148
Applied a total of 229 rules in 74 ms. Remains 200 /322 variables (removed 122) and now considering 148/266 (removed 118) transitions.
// Phase 1: matrix 148 rows 200 cols
[2024-05-22 00:11:07] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:11:07] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 00:11:07] [INFO ] Invariant cache hit.
[2024-05-22 00:11:08] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-22 00:11:08] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 00:11:08] [INFO ] Invariant cache hit.
[2024-05-22 00:11:08] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/322 places, 148/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 200/322 places, 148/266 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s111 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 25 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-01 finished in 556 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((X(F(p1))&&p0)))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 316 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 316 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 313 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 313 transition count 254
Applied a total of 21 rules in 31 ms. Remains 313 /322 variables (removed 9) and now considering 254/266 (removed 12) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:11:08] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:11:08] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 00:11:08] [INFO ] Invariant cache hit.
[2024-05-22 00:11:08] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-22 00:11:08] [INFO ] Invariant cache hit.
[2024-05-22 00:11:08] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/322 places, 254/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 313/322 places, 254/266 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s171 1) (EQ s173 1)), p1:(AND (EQ s34 1) (EQ s305 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-02 finished in 717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(F(p1) U X((G(p2)||(p2&&F(p3)))))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 317 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 317 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 317 transition count 259
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 315 transition count 257
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 315 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 315 transition count 256
Applied a total of 17 rules in 22 ms. Remains 315 /322 variables (removed 7) and now considering 256/266 (removed 10) transitions.
// Phase 1: matrix 256 rows 315 cols
[2024-05-22 00:11:09] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 00:11:09] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 00:11:09] [INFO ] Invariant cache hit.
[2024-05-22 00:11:09] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-22 00:11:09] [INFO ] Invariant cache hit.
[2024-05-22 00:11:09] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 315/322 places, 256/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 315/322 places, 256/266 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-20b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s299 0), p1:(AND (EQ s51 1) (EQ s162 1)), p2:(NEQ s274 1), p3:(NEQ s299 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2690 reset in 258 ms.
Product exploration explored 100000 steps with 2640 reset in 224 ms.
Computed a total of 138 stabilizing places and 131 stable transitions
Graph (complete) has 651 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 138 stabilizing places and 131 stable transitions
Detected a total of 138/315 stabilizing places and 131/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND p2 (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p2), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 137 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 194 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=97 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND p2 (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p2), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 17 factoid took 272 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 315 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 : 315/315 places, 256/256 transitions.
Graph (complete) has 651 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 309 transition count 237
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 294 transition count 237
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 294 transition count 225
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 282 transition count 225
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 203 place count 208 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 206 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 204 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 203 transition count 151
Applied a total of 210 rules in 48 ms. Remains 203 /315 variables (removed 112) and now considering 151/256 (removed 105) transitions.
// Phase 1: matrix 151 rows 203 cols
[2024-05-22 00:11:11] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 00:11:11] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-22 00:11:11] [INFO ] Invariant cache hit.
[2024-05-22 00:11:11] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-22 00:11:11] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 00:11:11] [INFO ] Invariant cache hit.
[2024-05-22 00:11:11] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/315 places, 151/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 203/315 places, 151/256 transitions.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 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 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 232 steps, including 10 resets, run visited all 1 properties in 4 ms. (steps per millisecond=58 )
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 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5210 reset in 231 ms.
Product exploration explored 100000 steps with 5196 reset in 257 ms.
Built C files in :
/tmp/ltsmin5090700687021804375
[2024-05-22 00:11:12] [INFO ] Computing symmetric may disable matrix : 151 transitions.
[2024-05-22 00:11:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:12] [INFO ] Computing symmetric may enable matrix : 151 transitions.
[2024-05-22 00:11:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:12] [INFO ] Computing Do-Not-Accords matrix : 151 transitions.
[2024-05-22 00:11:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:12] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5090700687021804375
Running compilation step : cd /tmp/ltsmin5090700687021804375;'/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 407 ms.
Running link step : cd /tmp/ltsmin5090700687021804375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5090700687021804375;'/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/stateBased4021539896754804227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 151/151 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 200 transition count 148
Applied a total of 4 rules in 17 ms. Remains 200 /203 variables (removed 3) and now considering 148/151 (removed 3) transitions.
// Phase 1: matrix 148 rows 200 cols
[2024-05-22 00:11:27] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:11:27] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 00:11:27] [INFO ] Invariant cache hit.
[2024-05-22 00:11:28] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-22 00:11:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:11:28] [INFO ] Invariant cache hit.
[2024-05-22 00:11:28] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/203 places, 148/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 200/203 places, 148/151 transitions.
Built C files in :
/tmp/ltsmin6963973492347509823
[2024-05-22 00:11:28] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 00:11:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:28] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 00:11:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:28] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 00:11:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:28] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6963973492347509823
Running compilation step : cd /tmp/ltsmin6963973492347509823;'/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 330 ms.
Running link step : cd /tmp/ltsmin6963973492347509823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6963973492347509823;'/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/stateBased9509521007602254770.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:11:43] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:11:43] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:11:43] [INFO ] Time to serialize gal into /tmp/LTL7911481231536125763.gal : 4 ms
[2024-05-22 00:11:43] [INFO ] Time to serialize properties into /tmp/LTL8944650296937484206.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/LTL7911481231536125763.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5148739807948121614.hoa' '-atoms' '/tmp/LTL8944650296937484206.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...317
Loading property file /tmp/LTL8944650296937484206.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5148739807948121614.hoa
Detected timeout of ITS tools.
[2024-05-22 00:11:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:11:58] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:11:58] [INFO ] Time to serialize gal into /tmp/LTL11312249778154273572.gal : 3 ms
[2024-05-22 00:11:58] [INFO ] Time to serialize properties into /tmp/LTL7766274033545805365.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11312249778154273572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7766274033545805365.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 : !(((G(F("(p343==0)")))&&((F("((p53==1)&&(p204==1))"))U(X((G("(p316!=1)"))||(("(p316!=1)")&&(F("(p343!=1)"))))))))
Formula 0 simplified : FG!"(p343==0)" | (G!"((p53==1)&&(p204==1))" R X(F!"(p316!=1)" & (!"(p316!=1)" | G!"(p343!=1)")))
Detected timeout of ITS tools.
[2024-05-22 00:12:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:12:13] [INFO ] Applying decomposition
[2024-05-22 00:12:13] [INFO ] Flatten gal took : 16 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/graph5918599691817894513.txt' '-o' '/tmp/graph5918599691817894513.bin' '-w' '/tmp/graph5918599691817894513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5918599691817894513.bin' '-l' '-1' '-v' '-w' '/tmp/graph5918599691817894513.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:12:13] [INFO ] Decomposing Gal with order
[2024-05-22 00:12:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:12:13] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-22 00:12:13] [INFO ] Flatten gal took : 40 ms
[2024-05-22 00:12:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2024-05-22 00:12:13] [INFO ] Time to serialize gal into /tmp/LTL3949320178220269172.gal : 4 ms
[2024-05-22 00:12:13] [INFO ] Time to serialize properties into /tmp/LTL13256916181593064927.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/LTL3949320178220269172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13256916181593064927.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 : !(((G(F("(i13.u43.p343==0)")))&&((F("((u8.p53==1)&&(u8.p204==1))"))U(X((G("(i2.u39.p316!=1)"))||(("(i2.u39.p316!=1)")&&(F("(i13.u43.p3...170
Formula 0 simplified : FG!"(i13.u43.p343==0)" | (G!"((u8.p53==1)&&(u8.p204==1))" R X(F!"(i2.u39.p316!=1)" & (!"(i2.u39.p316!=1)" | G!"(i13.u43.p343!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t259, t80_t82_t83_t89_t90_t84, t7_t50_t41, t9_t36, t10_t36, t226_t36, t225_t26, t109_t110_t12...686
Computing Next relation with stutter on 3.04097e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8653245589612310399
[2024-05-22 00:12:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8653245589612310399
Running compilation step : cd /tmp/ltsmin8653245589612310399;'/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 274 ms.
Running link step : cd /tmp/ltsmin8653245589612310399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8653245589612310399;'/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)))&&(<>((LTLAPp1==true)) U X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-20b-LTLFireability-03 finished in 94906 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((p0&&X(X((p1&&G(p2)))))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 316 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 316 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 313 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 313 transition count 254
Applied a total of 21 rules in 15 ms. Remains 313 /322 variables (removed 9) and now considering 254/266 (removed 12) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:12:43] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:12:44] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 00:12:44] [INFO ] Invariant cache hit.
[2024-05-22 00:12:44] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-22 00:12:44] [INFO ] Invariant cache hit.
[2024-05-22 00:12:44] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/322 places, 254/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 313/322 places, 254/266 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(EQ s136 0), p2:(EQ s280 0), p1:(OR (EQ s145 0) (EQ s147 0))], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17907 steps with 157 reset in 36 ms.
FORMULA DES-PT-20b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-04 finished in 889 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&&(p1 U p2)))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Graph (complete) has 662 edges and 322 vertex of which 318 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 317 transition count 248
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 302 transition count 248
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 302 transition count 237
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 291 transition count 237
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 288 transition count 234
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 288 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 288 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 287 transition count 230
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 286 transition count 229
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 286 transition count 229
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 218 place count 210 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 222 place count 208 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 223 place count 208 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 206 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 205 transition count 153
Applied a total of 226 rules in 52 ms. Remains 205 /322 variables (removed 117) and now considering 153/266 (removed 113) transitions.
// Phase 1: matrix 153 rows 205 cols
[2024-05-22 00:12:44] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:12:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 00:12:44] [INFO ] Invariant cache hit.
[2024-05-22 00:12:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:12:45] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-22 00:12:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:12:45] [INFO ] Invariant cache hit.
[2024-05-22 00:12:45] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/322 places, 153/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 205/322 places, 153/266 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DES-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s97 1), p0:(OR (NOT (AND (EQ s62 1) (EQ s85 1))) (EQ s100 1)), p2:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-05 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Graph (complete) has 662 edges and 322 vertex of which 315 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 314 transition count 244
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 298 transition count 244
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 298 transition count 232
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 286 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 283 transition count 229
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 283 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 282 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 281 transition count 225
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 281 transition count 225
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 213 place count 209 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 208 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 206 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 205 transition count 151
Applied a total of 218 rules in 37 ms. Remains 205 /322 variables (removed 117) and now considering 151/266 (removed 115) transitions.
// Phase 1: matrix 151 rows 205 cols
[2024-05-22 00:12:45] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:12:45] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 00:12:45] [INFO ] Invariant cache hit.
[2024-05-22 00:12:45] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-22 00:12:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:12:45] [INFO ] Invariant cache hit.
[2024-05-22 00:12:45] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/322 places, 151/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 437 ms. Remains : 205/322 places, 151/266 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s142 1), p1:(AND (EQ s47 1) (EQ s114 1) (EQ s84 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-06 finished in 554 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&&F(G(p1)))))'
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Graph (complete) has 662 edges and 322 vertex of which 315 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 314 transition count 245
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 299 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 298 transition count 244
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 33 place count 298 transition count 232
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 57 place count 286 transition count 232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 61 place count 282 transition count 228
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 282 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 282 transition count 225
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 281 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 280 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 280 transition count 223
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 220 place count 206 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 204 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 202 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 201 transition count 149
Applied a total of 227 rules in 44 ms. Remains 201 /322 variables (removed 121) and now considering 149/266 (removed 117) transitions.
// Phase 1: matrix 149 rows 201 cols
[2024-05-22 00:12:46] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:12:46] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 00:12:46] [INFO ] Invariant cache hit.
[2024-05-22 00:12:46] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-22 00:12:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:12:46] [INFO ] Invariant cache hit.
[2024-05-22 00:12:46] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/322 places, 149/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 201/322 places, 149/266 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s196 0), p1:(EQ s137 0)], 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 4644 reset in 189 ms.
Product exploration explored 100000 steps with 4648 reset in 216 ms.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/201 stabilizing places and 93/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 320 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 396 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Support contains 1 out of 201 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 : 201/201 places, 149/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-22 00:12:47] [INFO ] Invariant cache hit.
[2024-05-22 00:12:47] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 00:12:47] [INFO ] Invariant cache hit.
[2024-05-22 00:12:48] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-22 00:12:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:12:48] [INFO ] Invariant cache hit.
[2024-05-22 00:12:48] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 387 ms. Remains : 201/201 places, 149/149 transitions.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/201 stabilizing places and 93/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 188 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 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4673 reset in 189 ms.
Product exploration explored 100000 steps with 4624 reset in 209 ms.
Built C files in :
/tmp/ltsmin1107784857101825176
[2024-05-22 00:12:49] [INFO ] Computing symmetric may disable matrix : 149 transitions.
[2024-05-22 00:12:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:12:49] [INFO ] Computing symmetric may enable matrix : 149 transitions.
[2024-05-22 00:12:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:12:49] [INFO ] Computing Do-Not-Accords matrix : 149 transitions.
[2024-05-22 00:12:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:12:49] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1107784857101825176
Running compilation step : cd /tmp/ltsmin1107784857101825176;'/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 321 ms.
Running link step : cd /tmp/ltsmin1107784857101825176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1107784857101825176;'/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/stateBased5957830208162196010.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 149/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 148
Applied a total of 2 rules in 10 ms. Remains 200 /201 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 200 cols
[2024-05-22 00:13:04] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:13:04] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 00:13:04] [INFO ] Invariant cache hit.
[2024-05-22 00:13:04] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-22 00:13:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:13:04] [INFO ] Invariant cache hit.
[2024-05-22 00:13:04] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 148/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 200/201 places, 148/149 transitions.
Built C files in :
/tmp/ltsmin7489118298923520627
[2024-05-22 00:13:04] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 00:13:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:13:04] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 00:13:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:13:04] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 00:13:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:13:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7489118298923520627
Running compilation step : cd /tmp/ltsmin7489118298923520627;'/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 310 ms.
Running link step : cd /tmp/ltsmin7489118298923520627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7489118298923520627;'/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/stateBased11498903511346851298.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:13:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:13:19] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:13:19] [INFO ] Time to serialize gal into /tmp/LTL552979393455431582.gal : 2 ms
[2024-05-22 00:13:19] [INFO ] Time to serialize properties into /tmp/LTL7687522749765660477.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/LTL552979393455431582.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16448065454430623948.hoa' '-atoms' '/tmp/LTL7687522749765660477.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...317
Loading property file /tmp/LTL7687522749765660477.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16448065454430623948.hoa
Detected timeout of ITS tools.
[2024-05-22 00:13:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:13:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:13:34] [INFO ] Time to serialize gal into /tmp/LTL13015154790925099850.gal : 2 ms
[2024-05-22 00:13:34] [INFO ] Time to serialize properties into /tmp/LTL18372187147140440793.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/LTL13015154790925099850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18372187147140440793.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("(p355==0)")&&(F(G("(p255==0)"))))))
Formula 0 simplified : GF!"(p255==0)" | G!"(p355==0)"
Detected timeout of ITS tools.
[2024-05-22 00:13:49] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:13:49] [INFO ] Applying decomposition
[2024-05-22 00:13:49] [INFO ] Flatten gal took : 10 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/graph9326888577529185255.txt' '-o' '/tmp/graph9326888577529185255.bin' '-w' '/tmp/graph9326888577529185255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9326888577529185255.bin' '-l' '-1' '-v' '-w' '/tmp/graph9326888577529185255.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:13:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:13:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:13:50] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-22 00:13:50] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2024-05-22 00:13:50] [INFO ] Time to serialize gal into /tmp/LTL5139887841087278913.gal : 2 ms
[2024-05-22 00:13:50] [INFO ] Time to serialize properties into /tmp/LTL1284563882061335899.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/LTL5139887841087278913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1284563882061335899.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 : !((F(("(u44.p355==0)")&&(F(G("(i10.i2.u28.p255==0)"))))))
Formula 0 simplified : GF!"(i10.i2.u28.p255==0)" | G!"(u44.p355==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12711321349239298970
[2024-05-22 00:14:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12711321349239298970
Running compilation step : cd /tmp/ltsmin12711321349239298970;'/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 268 ms.
Running link step : cd /tmp/ltsmin12711321349239298970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12711321349239298970;'/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)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-20b-LTLFireability-07 finished in 94218 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((p0||X((p1&&G(p2))))))'
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 316 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 316 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 315 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 315 transition count 257
Applied a total of 16 rules in 16 ms. Remains 315 /322 variables (removed 7) and now considering 257/266 (removed 9) transitions.
// Phase 1: matrix 257 rows 315 cols
[2024-05-22 00:14:20] [INFO ] Computed 61 invariants in 4 ms
[2024-05-22 00:14:20] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 00:14:20] [INFO ] Invariant cache hit.
[2024-05-22 00:14:20] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 00:14:20] [INFO ] Invariant cache hit.
[2024-05-22 00:14:20] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 315/322 places, 257/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 315/322 places, 257/266 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s142 1), p2:(EQ s105 1), p1:(EQ s105 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-08 finished in 803 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)))'
Support contains 3 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 316 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 316 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 313 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 313 transition count 254
Applied a total of 21 rules in 17 ms. Remains 313 /322 variables (removed 9) and now considering 254/266 (removed 12) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:14:21] [INFO ] Computed 61 invariants in 4 ms
[2024-05-22 00:14:21] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 00:14:21] [INFO ] Invariant cache hit.
[2024-05-22 00:14:21] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-22 00:14:21] [INFO ] Invariant cache hit.
[2024-05-22 00:14:21] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/322 places, 254/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 313/322 places, 254/266 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s123 0), p0:(OR (EQ s85 0) (EQ s102 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20b-LTLFireability-09 finished in 1335 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 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Graph (complete) has 662 edges and 322 vertex of which 315 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 314 transition count 244
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 298 transition count 244
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 298 transition count 232
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 286 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 282 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 282 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 282 transition count 225
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 281 transition count 224
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 280 transition count 223
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 280 transition count 223
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 224 place count 204 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 202 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 200 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 199 transition count 147
Applied a total of 231 rules in 42 ms. Remains 199 /322 variables (removed 123) and now considering 147/266 (removed 119) transitions.
// Phase 1: matrix 147 rows 199 cols
[2024-05-22 00:14:22] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:14:22] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 00:14:22] [INFO ] Invariant cache hit.
[2024-05-22 00:14:22] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-22 00:14:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:14:22] [INFO ] Invariant cache hit.
[2024-05-22 00:14:22] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/322 places, 147/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 445 ms. Remains : 199/322 places, 147/266 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s145 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-10 finished in 503 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) U (F(((p1&&X(F(p1)))||G(F(p1)))) U p2))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 316 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 316 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 313 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 313 transition count 254
Applied a total of 21 rules in 13 ms. Remains 313 /322 variables (removed 9) and now considering 254/266 (removed 12) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:14:22] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 00:14:23] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 00:14:23] [INFO ] Invariant cache hit.
[2024-05-22 00:14:23] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-22 00:14:23] [INFO ] Invariant cache hit.
[2024-05-22 00:14:23] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/322 places, 254/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 313/322 places, 254/266 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (NOT p2), false, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s29 1) (EQ s305 1)), p0:(EQ s97 1), p1:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17484 reset in 175 ms.
Product exploration explored 100000 steps with 17519 reset in 180 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 16 factoid took 1308 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:14:25] [INFO ] Invariant cache hit.
[2024-05-22 00:14:25] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:14:25] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 16 ms returned sat
[2024-05-22 00:14:25] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:14:25] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-22 00:14:26] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2024-05-22 00:14:26] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-22 00:14:26] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 308 transition count 233
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 292 transition count 233
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 292 transition count 220
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 279 transition count 220
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 213 place count 203 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 201 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 201 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 200 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 200 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 199 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 198 transition count 144
Applied a total of 222 rules in 34 ms. Remains 198 /313 variables (removed 115) and now considering 144/254 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 198/313 places, 144/254 transitions.
Incomplete random walk after 10000 steps, including 471 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1805640 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :{}
Probabilistic random walk after 1805640 steps, saw 254055 distinct states, run finished after 3003 ms. (steps per millisecond=601 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 198 cols
[2024-05-22 00:14:29] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:14:29] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 00:14:29] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:14:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2024-05-22 00:14:29] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:14:29] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-22 00:14:29] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 198/198 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-22 00:14:29] [INFO ] Invariant cache hit.
[2024-05-22 00:14:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 00:14:29] [INFO ] Invariant cache hit.
[2024-05-22 00:14:29] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-22 00:14:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:14:29] [INFO ] Invariant cache hit.
[2024-05-22 00:14:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 198/198 places, 144/144 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 144
Applied a total of 1 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 198 cols
[2024-05-22 00:14:30] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:14:30] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:14:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-22 00:14:30] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2024-05-22 00:14:30] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-22 00:14:30] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-22 00:14:30] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 1576 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:14:32] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 00:14:32] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2024-05-22 00:14:32] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-22 00:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:14:32] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2024-05-22 00:14:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:14:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 00:14:33] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 19 ms returned sat
[2024-05-22 00:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:14:33] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2024-05-22 00:14:33] [INFO ] Computed and/alt/rep : 248/493/248 causal constraints (skipped 5 transitions) in 16 ms.
[2024-05-22 00:14:35] [INFO ] Added : 230 causal constraints over 46 iterations in 1762 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 00:14:35] [INFO ] Invariant cache hit.
[2024-05-22 00:14:35] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 00:14:35] [INFO ] Invariant cache hit.
[2024-05-22 00:14:36] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-22 00:14:36] [INFO ] Invariant cache hit.
[2024-05-22 00:14:36] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 313/313 places, 254/254 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 4 factoid took 314 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 82 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:14:36] [INFO ] Invariant cache hit.
[2024-05-22 00:14:36] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:14:36] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 19 ms returned sat
[2024-05-22 00:14:36] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:14:36] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-22 00:14:37] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2024-05-22 00:14:37] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 00:14:37] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 308 transition count 233
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 292 transition count 233
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 292 transition count 220
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 61 place count 279 transition count 220
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 213 place count 203 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 201 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 201 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 200 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 200 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 199 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 198 transition count 144
Applied a total of 222 rules in 28 ms. Remains 198 /313 variables (removed 115) and now considering 144/254 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 198/313 places, 144/254 transitions.
Incomplete random walk after 10000 steps, including 457 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1798710 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :{}
Probabilistic random walk after 1798710 steps, saw 253035 distinct states, run finished after 3001 ms. (steps per millisecond=599 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 198 cols
[2024-05-22 00:14:40] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:14:40] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 00:14:40] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2024-05-22 00:14:40] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:14:40] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-22 00:14:40] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 198/198 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-22 00:14:40] [INFO ] Invariant cache hit.
[2024-05-22 00:14:40] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 00:14:40] [INFO ] Invariant cache hit.
[2024-05-22 00:14:41] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-22 00:14:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:14:41] [INFO ] Invariant cache hit.
[2024-05-22 00:14:41] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 198/198 places, 144/144 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 144
Applied a total of 1 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 198 cols
[2024-05-22 00:14:41] [INFO ] Computed 60 invariants in 1 ms
[2024-05-22 00:14:41] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 00:14:41] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:14:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2024-05-22 00:14:41] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-22 00:14:41] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-22 00:14:41] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 445 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:14:42] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 00:14:42] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 00:14:42] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-22 00:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:14:42] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2024-05-22 00:14:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:14:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 00:14:43] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 19 ms returned sat
[2024-05-22 00:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:14:43] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2024-05-22 00:14:43] [INFO ] Computed and/alt/rep : 248/493/248 causal constraints (skipped 5 transitions) in 15 ms.
[2024-05-22 00:14:45] [INFO ] Added : 230 causal constraints over 46 iterations in 1783 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 17218 reset in 167 ms.
Product exploration explored 100000 steps with 17243 reset in 170 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 308 transition count 251
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 15 place count 308 transition count 253
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 308 transition count 253
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 303 transition count 248
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 303 transition count 248
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 303 transition count 251
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 293 transition count 241
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 293 transition count 241
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 293 transition count 269
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 291 transition count 263
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 291 transition count 263
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 62 ms. Remains 291 /313 variables (removed 22) and now considering 263/254 (removed -9) transitions.
[2024-05-22 00:14:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 263 rows 291 cols
[2024-05-22 00:14:46] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:14:46] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/313 places, 263/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 291/313 places, 263/254 transitions.
Built C files in :
/tmp/ltsmin17209776279144392290
[2024-05-22 00:14:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17209776279144392290
Running compilation step : cd /tmp/ltsmin17209776279144392290;'/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 403 ms.
Running link step : cd /tmp/ltsmin17209776279144392290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17209776279144392290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5187122648652631229.hoa' '--buchi-type=spotba'
LTSmin run took 234 ms.
FORMULA DES-PT-20b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLFireability-12 finished in 24514 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(p0) U X(p1))||G(p2)||F(p3)))'
Support contains 8 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 316 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 316 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 313 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 313 transition count 254
Applied a total of 21 rules in 33 ms. Remains 313 /322 variables (removed 9) and now considering 254/266 (removed 12) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:14:47] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 00:14:47] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 00:14:47] [INFO ] Invariant cache hit.
[2024-05-22 00:14:47] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-22 00:14:47] [INFO ] Invariant cache hit.
[2024-05-22 00:14:48] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/322 places, 254/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 313/322 places, 254/266 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s305 1)), p2:(OR (EQ s240 0) (EQ s267 0)), p3:(AND (EQ s270 1) (EQ s272 1)), p1:(AND (EQ s292 1) (EQ s294 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 931 reset in 173 ms.
Product exploration explored 100000 steps with 933 reset in 189 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X (AND (NOT p3) (NOT p1))), (X (AND p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 27 factoid took 276 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:14:49] [INFO ] Invariant cache hit.
[2024-05-22 00:14:49] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:14:49] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-22 00:14:49] [INFO ] After 81ms SMT Verify possible using all constraints in natural 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) p2 (NOT p3) (NOT p1)), (X (AND (NOT p3) (NOT p1))), (X (AND p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p3)))]
False Knowledge obtained : [(F p3), (F (AND p2 p3)), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND p2 (NOT p3))))]
Knowledge based reduction with 28 factoid took 560 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 424 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 274 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), false, false, false]
Support contains 4 out of 313 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 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 307 transition count 238
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 295 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 294 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 27 place count 294 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 53 place count 281 transition count 224
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 201 place count 207 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 205 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 203 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 202 transition count 150
Applied a total of 208 rules in 21 ms. Remains 202 /313 variables (removed 111) and now considering 150/254 (removed 104) transitions.
// Phase 1: matrix 150 rows 202 cols
[2024-05-22 00:14:50] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:14:50] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 00:14:50] [INFO ] Invariant cache hit.
[2024-05-22 00:14:50] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-22 00:14:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:14:50] [INFO ] Invariant cache hit.
[2024-05-22 00:14:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/313 places, 150/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 409 ms. Remains : 202/313 places, 150/254 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND (NOT p3) p2), (X (AND p2 (NOT p3))), (X (NOT (AND p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X p2), (X (NOT (AND (NOT p2) p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 114 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 495 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:14:51] [INFO ] Invariant cache hit.
[2024-05-22 00:14:51] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:14:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:14:51] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2024-05-22 00:14:51] [INFO ] After 89ms SMT Verify possible using all constraints in natural 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 p3) p2), (X (AND p2 (NOT p3))), (X (NOT (AND p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X p2), (X (NOT (AND (NOT p2) p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p3)))), (G (NOT (AND (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3)))), (F (AND p2 p3)), (F p3), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 14 factoid took 306 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 279 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 278 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 5197 reset in 226 ms.
Product exploration explored 100000 steps with 5197 reset in 246 ms.
Built C files in :
/tmp/ltsmin11820608299621881831
[2024-05-22 00:14:53] [INFO ] Computing symmetric may disable matrix : 150 transitions.
[2024-05-22 00:14:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:53] [INFO ] Computing symmetric may enable matrix : 150 transitions.
[2024-05-22 00:14:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:53] [INFO ] Computing Do-Not-Accords matrix : 150 transitions.
[2024-05-22 00:14:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:14:53] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11820608299621881831
Running compilation step : cd /tmp/ltsmin11820608299621881831;'/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 328 ms.
Running link step : cd /tmp/ltsmin11820608299621881831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11820608299621881831;'/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/stateBased2041252636244349941.hoa' '--buchi-type=spotba'
LTSmin run took 9035 ms.
FORMULA DES-PT-20b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLFireability-13 finished in 15389 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((G(F(p0)) U p1)))'
Support contains 3 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 266/266 transitions.
Graph (complete) has 662 edges and 322 vertex of which 315 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 314 transition count 247
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 301 transition count 247
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 301 transition count 234
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 53 place count 288 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 284 transition count 230
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 284 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 284 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 283 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 282 transition count 225
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 282 transition count 225
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 220 place count 206 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 204 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 202 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 201 transition count 149
Applied a total of 227 rules in 28 ms. Remains 201 /322 variables (removed 121) and now considering 149/266 (removed 117) transitions.
// Phase 1: matrix 149 rows 201 cols
[2024-05-22 00:15:02] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:15:02] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 00:15:02] [INFO ] Invariant cache hit.
[2024-05-22 00:15:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:15:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-22 00:15:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:15:03] [INFO ] Invariant cache hit.
[2024-05-22 00:15:03] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/322 places, 149/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 201/322 places, 149/266 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s63 1) (EQ s85 1)), p0:(EQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-14 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(F(p1) U X((G(p2)||(p2&&F(p3)))))))'
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&&F(G(p1)))))'
[2024-05-22 00:15:03] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1911192066692772791
[2024-05-22 00:15:03] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 00:15:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:15:03] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 00:15:03] [INFO ] Applying decomposition
[2024-05-22 00:15:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:15:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:15:03] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 00:15:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:15:03] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1911192066692772791
Running compilation step : cd /tmp/ltsmin1911192066692772791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
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/graph3825585381977053339.txt' '-o' '/tmp/graph3825585381977053339.bin' '-w' '/tmp/graph3825585381977053339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3825585381977053339.bin' '-l' '-1' '-v' '-w' '/tmp/graph3825585381977053339.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:15:03] [INFO ] Decomposing Gal with order
[2024-05-22 00:15:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:15:03] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 00:15:03] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:15:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-22 00:15:03] [INFO ] Time to serialize gal into /tmp/LTLFireability10723476575185894064.gal : 10 ms
[2024-05-22 00:15:03] [INFO ] Time to serialize properties into /tmp/LTLFireability1081223320837628234.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/LTLFireability10723476575185894064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1081223320837628234.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...277
Read 2 LTL properties
Checking formula 0 : !(((G(F("(i11.i0.u74.p343==0)")))&&((F("((u32.p53==1)&&(u32.p204==1))"))U(X((G("(i8.i0.u66.p316!=1)"))||(("(i8.i0.u66.p316!=1)")&&(F("...184
Formula 0 simplified : FG!"(i11.i0.u74.p343==0)" | (G!"((u32.p53==1)&&(u32.p204==1))" R X(F!"(i8.i0.u66.p316!=1)" & (!"(i8.i0.u66.p316!=1)" | G!"(i11.i0.u7...169
Compilation finished in 518 ms.
Running link step : cd /tmp/ltsmin1911192066692772791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1911192066692772791;'/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)))&&(<>((LTLAPp1==true)) U X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t89, t196, t225, t226, u34.t78, u32.t81, u77.t17, u77.t157, i2.u11.t116, i2.u13...979
Computing Next relation with stutter on 5.81818e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: LTL layer: formula: ([](<>((LTLAPp0==true)))&&(<>((LTLAPp1==true)) U X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.009: "([](<>((LTLAPp0==true)))&&(<>((LTLAPp1==true)) U X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed 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( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.068: There are 273 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.068: State length is 323, there are 287 groups
pins2lts-mc-linux64( 0/ 8), 0.068: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.068: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.068: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.068: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.106: [Blue] ~107 levels ~960 states ~3880 transitions
pins2lts-mc-linux64( 5/ 8), 0.118: [Blue] ~88 levels ~1920 states ~7272 transitions
pins2lts-mc-linux64( 4/ 8), 0.141: [Blue] ~119 levels ~3840 states ~12264 transitions
pins2lts-mc-linux64( 4/ 8), 0.187: [Blue] ~119 levels ~7680 states ~25720 transitions
pins2lts-mc-linux64( 4/ 8), 0.285: [Blue] ~119 levels ~15360 states ~56624 transitions
pins2lts-mc-linux64( 2/ 8), 0.453: [Blue] ~118 levels ~30720 states ~132944 transitions
pins2lts-mc-linux64( 2/ 8), 0.793: [Blue] ~118 levels ~61440 states ~296368 transitions
pins2lts-mc-linux64( 2/ 8), 1.422: [Blue] ~118 levels ~122880 states ~606264 transitions
pins2lts-mc-linux64( 0/ 8), 2.580: [Blue] ~118 levels ~245760 states ~1340704 transitions
pins2lts-mc-linux64( 0/ 8), 4.727: [Blue] ~118 levels ~491520 states ~2976264 transitions
pins2lts-mc-linux64( 4/ 8), 8.250: [Blue] ~120 levels ~983040 states ~5770504 transitions
pins2lts-mc-linux64( 4/ 8), 14.491: [Blue] ~133 levels ~1966080 states ~11707240 transitions
pins2lts-mc-linux64( 4/ 8), 26.757: [Blue] ~161 levels ~3932160 states ~24246648 transitions
pins2lts-mc-linux64( 1/ 8), 52.248: [Blue] ~147 levels ~7864320 states ~50300512 transitions
pins2lts-mc-linux64( 4/ 8), 105.751: [Blue] ~161 levels ~15728640 states ~107232312 transitions
pins2lts-mc-linux64( 4/ 8), 212.026: [Blue] ~161 levels ~31457280 states ~227941760 transitions
pins2lts-mc-linux64( 1/ 8), 425.225: [Blue] ~160 levels ~62914560 states ~468043016 transitions
pins2lts-mc-linux64( 4/ 8), 861.333: [Blue] ~161 levels ~125829120 states ~952771760 transitions
pins2lts-mc-linux64( 1/ 8), 991.646: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 991.683:
pins2lts-mc-linux64( 0/ 8), 991.683: Explored 135017523 states 1069985987 transitions, fanout: 7.925
pins2lts-mc-linux64( 0/ 8), 991.683: Total exploration time 991.600 sec (991.570 sec minimum, 991.580 sec on average)
pins2lts-mc-linux64( 0/ 8), 991.683: States per second: 136161, Transitions per second: 1079050
pins2lts-mc-linux64( 0/ 8), 991.683:
pins2lts-mc-linux64( 0/ 8), 991.683: State space has 134217277 states, 868464 are accepting
pins2lts-mc-linux64( 0/ 8), 991.683: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 991.683: blue states: 135017523 (100.60%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 991.683: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 991.683: all-red states: 868465 (0.65%), bogus 11866 (0.01%)
pins2lts-mc-linux64( 0/ 8), 991.683:
pins2lts-mc-linux64( 0/ 8), 991.683: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 991.683:
pins2lts-mc-linux64( 0/ 8), 991.683: Queue width: 8B, total height: 1398, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 991.683: Tree memory: 1068.3MB, 8.3 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 991.683: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 991.683: Stored 271 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 991.683: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 991.683: Est. total memory use: 1068.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1911192066692772791;'/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)))&&(<>((LTLAPp1==true)) U X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1911192066692772791;'/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)))&&(<>((LTLAPp1==true)) U X(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==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-22 00:36:26] [INFO ] Applying decomposition
[2024-05-22 00:36:26] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:36:26] [INFO ] Decomposing Gal with order
[2024-05-22 00:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:36:27] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-22 00:36:27] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:36:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 11 ms.
[2024-05-22 00:36:27] [INFO ] Time to serialize gal into /tmp/LTLFireability1192472694351027665.gal : 3 ms
[2024-05-22 00:36:27] [INFO ] Time to serialize properties into /tmp/LTLFireability4225661479089339396.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/LTLFireability1192472694351027665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4225661479089339396.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 2 LTL properties
Checking formula 0 : !(((G(F("(i1.i1.i0.i1.u103.p343==0)")))&&((F("((i0.i0.u6.p53==1)&&(i1.i0.i1.u35.p204==1))"))U(X((G("(i1.i1.i0.i1.i0.i0.i1.u97.p316!=1)...240
Formula 0 simplified : FG!"(i1.i1.i0.i1.u103.p343==0)" | (G!"((i0.i0.u6.p53==1)&&(i1.i0.i1.u35.p204==1))" R X(F!"(i1.i1.i0.i1.i0.i0.i1.u97.p316!=1)" & (!"(...225
Detected timeout of ITS tools.
[2024-05-22 00:57:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:57:50] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-22 00:57:50] [INFO ] Transformed 322 places.
[2024-05-22 00:57:50] [INFO ] Transformed 266 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-22 00:57:50] [INFO ] Time to serialize gal into /tmp/LTLFireability16979353907623733460.gal : 2 ms
[2024-05-22 00:57:50] [INFO ] Time to serialize properties into /tmp/LTLFireability16805352987304149953.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/LTLFireability16979353907623733460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16805352987304149953.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...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F("(p343==0)")))&&((F("((p53==1)&&(p204==1))"))U(X((G("(p316!=1)"))||(("(p316!=1)")&&(F("(p343!=1)"))))))))
Formula 0 simplified : FG!"(p343==0)" | (G!"((p53==1)&&(p204==1))" R X(F!"(p316!=1)" & (!"(p316!=1)" | G!"(p343!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t24, t26, t32, t36, t39, t50, t52, t53, t54, t55, t56, t57, t58, t59, t60, t...529
Computing Next relation with stutter on 5.81818e+07 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4038964 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040788 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="DES-PT-20b"
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 DES-PT-20b, 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 r109-tall-171624208500433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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