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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 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.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 103K 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-30b-LTLFireability-00
FORMULA_NAME DES-PT-30b-LTLFireability-01
FORMULA_NAME DES-PT-30b-LTLFireability-02
FORMULA_NAME DES-PT-30b-LTLFireability-03
FORMULA_NAME DES-PT-30b-LTLFireability-04
FORMULA_NAME DES-PT-30b-LTLFireability-05
FORMULA_NAME DES-PT-30b-LTLFireability-06
FORMULA_NAME DES-PT-30b-LTLFireability-07
FORMULA_NAME DES-PT-30b-LTLFireability-08
FORMULA_NAME DES-PT-30b-LTLFireability-09
FORMULA_NAME DES-PT-30b-LTLFireability-10
FORMULA_NAME DES-PT-30b-LTLFireability-11
FORMULA_NAME DES-PT-30b-LTLFireability-12
FORMULA_NAME DES-PT-30b-LTLFireability-13
FORMULA_NAME DES-PT-30b-LTLFireability-14
FORMULA_NAME DES-PT-30b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716337438925

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-30b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 00:24:00] [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:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:24:00] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-22 00:24:00] [INFO ] Transformed 399 places.
[2024-05-22 00:24:00] [INFO ] Transformed 350 transitions.
[2024-05-22 00:24:00] [INFO ] Found NUPN structural information;
[2024-05-22 00:24:00] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 48 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 373 transition count 327
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 373 transition count 327
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 362 transition count 316
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 362 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 362 transition count 307
Applied a total of 80 rules in 83 ms. Remains 362 /399 variables (removed 37) and now considering 307/350 (removed 43) transitions.
// Phase 1: matrix 307 rows 362 cols
[2024-05-22 00:24:00] [INFO ] Computed 62 invariants in 29 ms
[2024-05-22 00:24:01] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-22 00:24:01] [INFO ] Invariant cache hit.
[2024-05-22 00:24:01] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2024-05-22 00:24:01] [INFO ] Invariant cache hit.
[2024-05-22 00:24:01] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/399 places, 307/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1215 ms. Remains : 362/399 places, 307/350 transitions.
Support contains 48 out of 362 places after structural reductions.
[2024-05-22 00:24:02] [INFO ] Flatten gal took : 52 ms
[2024-05-22 00:24:02] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:24:02] [INFO ] Input system was already deterministic with 307 transitions.
Support contains 46 out of 362 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 33) seen :20
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-22 00:24:03] [INFO ] Invariant cache hit.
[2024-05-22 00:24:03] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 00:24:03] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2024-05-22 00:24:03] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 00:24:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 00:24:03] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2024-05-22 00:24:04] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 6 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 511 ms
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-22 00:24:05] [INFO ] After 2093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 400 ms.
[2024-05-22 00:24:06] [INFO ] After 2775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 1182 ms.
Support contains 17 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 17 rules applied. Total rules applied 18 place count 355 transition count 286
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 340 transition count 285
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 340 transition count 274
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 329 transition count 274
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 323 transition count 268
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 323 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 323 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 323 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 322 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 321 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 321 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 321 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 76 place count 321 transition count 261
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 78 place count 320 transition count 261
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 224 place count 247 transition count 188
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 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 242 transition count 188
Applied a total of 232 rules in 88 ms. Remains 242 /362 variables (removed 120) and now considering 188/307 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 242/362 places, 188/307 transitions.
Incomplete random walk after 10000 steps, including 383 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 663371 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663371 steps, saw 101054 distinct states, run finished after 3002 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 188 rows 242 cols
[2024-05-22 00:24:11] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 00:24:11] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 00:24:11] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 00:24:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2024-05-22 00:24:12] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-22 00:24:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:24:12] [INFO ] After 245ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-22 00:24:12] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-22 00:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-22 00:24:12] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 00:24:12] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 00:24:12] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-05-22 00:24:13] [INFO ] After 1662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 413 ms.
Support contains 17 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 00:24:13] [INFO ] Invariant cache hit.
[2024-05-22 00:24:13] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 00:24:13] [INFO ] Invariant cache hit.
[2024-05-22 00:24:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:24:13] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-22 00:24:13] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-22 00:24:13] [INFO ] Invariant cache hit.
[2024-05-22 00:24:14] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 13 properties.
[2024-05-22 00:24:14] [INFO ] Invariant cache hit.
[2024-05-22 00:24:14] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:24:14] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 00:24:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2024-05-22 00:24:14] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2024-05-22 00:24:15] [INFO ] After 777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 213 ms.
[2024-05-22 00:24:15] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Computed a total of 178 stabilizing places and 170 stable transitions
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.14 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) U (G((F(p1)&&F(G(!p2)))) U p2)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 14 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:24:15] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:24:15] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 00:24:15] [INFO ] Invariant cache hit.
[2024-05-22 00:24:16] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-22 00:24:16] [INFO ] Invariant cache hit.
[2024-05-22 00:24:16] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 353/362 places, 293/307 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 336 ms :[(NOT p2), (NOT p0), (NOT p1), p2, (OR (NOT p1) p2), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s90 1) (EQ s202 1)), p1:(NEQ s217 1), p0:(AND (EQ s18 1) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2205 reset in 340 ms.
Product exploration explored 100000 steps with 2223 reset in 217 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Detected a total of 176/353 stabilizing places and 168/293 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X p1)), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 345 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-22 00:24:18] [INFO ] Invariant cache hit.
[2024-05-22 00:24:18] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:24:18] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-22 00:24:18] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 00:24:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:24:18] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 24 ms returned sat
[2024-05-22 00:24:18] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 417 ms
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 485 ms
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-22 00:24:20] [INFO ] After 1706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 197 ms.
[2024-05-22 00:24:20] [INFO ] After 2063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 278 ms.
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 293/293 transitions.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 347 transition count 271
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 330 transition count 271
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 330 transition count 260
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 59 place count 319 transition count 260
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 2 with 144 rules applied. Total rules applied 203 place count 247 transition count 188
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 2 with 4 rules applied. Total rules applied 207 place count 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 209 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 211 place count 242 transition count 188
Applied a total of 211 rules in 70 ms. Remains 242 /353 variables (removed 111) and now considering 188/293 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 242/353 places, 188/293 transitions.
Incomplete random walk after 10000 steps, including 400 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 952386 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 952386 steps, saw 137522 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 188 rows 242 cols
[2024-05-22 00:24:23] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:24:24] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:24:24] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 00:24:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:24:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 00:24:24] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-22 00:24:24] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-22 00:24:24] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 00:24:24] [INFO ] Invariant cache hit.
[2024-05-22 00:24:25] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:24:25] [INFO ] Invariant cache hit.
[2024-05-22 00:24:25] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-22 00:24:25] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 00:24:25] [INFO ] Invariant cache hit.
[2024-05-22 00:24:25] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-22 00:24:25] [INFO ] Invariant cache hit.
[2024-05-22 00:24:25] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:24:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:24:25] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 00:24:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 00:24:25] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 00:24:26] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-22 00:24:26] [INFO ] After 731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X p1)), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 541 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:24:27] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 00:24:27] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 00:24:27] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 33 ms returned sat
[2024-05-22 00:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:28] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2024-05-22 00:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:24:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 00:24:28] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2024-05-22 00:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:29] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-22 00:24:29] [INFO ] Computed and/alt/rep : 287/602/287 causal constraints (skipped 5 transitions) in 14 ms.
[2024-05-22 00:24:30] [INFO ] Added : 199 causal constraints over 40 iterations in 1504 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 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 346 transition count 274
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 331 transition count 274
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 331 transition count 263
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 320 transition count 263
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 2 with 144 rules applied. Total rules applied 197 place count 248 transition count 191
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 201 place count 246 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 244 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 204 place count 243 transition count 191
Applied a total of 204 rules in 39 ms. Remains 243 /353 variables (removed 110) and now considering 191/293 (removed 102) transitions.
// Phase 1: matrix 191 rows 243 cols
[2024-05-22 00:24:30] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:24:31] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 00:24:31] [INFO ] Invariant cache hit.
[2024-05-22 00:24:31] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-22 00:24:31] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-22 00:24:31] [INFO ] Invariant cache hit.
[2024-05-22 00:24:31] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/353 places, 191/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 480 ms. Remains : 243/353 places, 191/293 transitions.
Computed a total of 138 stabilizing places and 133 stable transitions
Computed a total of 138 stabilizing places and 133 stable transitions
Detected a total of 138/243 stabilizing places and 133/191 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 (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 16 factoid took 1066 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 453 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-22 00:24:33] [INFO ] Invariant cache hit.
[2024-05-22 00:24:33] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:24:33] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-22 00:24:33] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 00:24:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:24:33] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 86 ms returned sat
[2024-05-22 00:24:33] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-22 00:24:33] [INFO ] After 447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-22 00:24:33] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 191/191 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 243 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 242 transition count 189
Applied a total of 3 rules in 12 ms. Remains 242 /243 variables (removed 1) and now considering 189/191 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 242/243 places, 189/191 transitions.
Incomplete random walk after 10000 steps, including 454 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 997643 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 997643 steps, saw 131098 distinct states, run finished after 3002 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 189 rows 242 cols
[2024-05-22 00:24:37] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 00:24:37] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:37] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:24:37] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 00:24:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:24:37] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 44 ms returned sat
[2024-05-22 00:24:37] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-22 00:24:38] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-22 00:24:38] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 130 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 189/189 transitions.
Applied a total of 0 rules in 14 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 242/242 places, 189/189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 189/189 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-22 00:24:38] [INFO ] Invariant cache hit.
[2024-05-22 00:24:38] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 00:24:38] [INFO ] Invariant cache hit.
[2024-05-22 00:24:38] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-22 00:24:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:24:38] [INFO ] Invariant cache hit.
[2024-05-22 00:24:38] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 242/242 places, 189/189 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-22 00:24:38] [INFO ] Invariant cache hit.
[2024-05-22 00:24:38] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:38] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 00:24:38] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 00:24:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:24:38] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 43 ms returned sat
[2024-05-22 00:24:39] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-22 00:24:39] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-22 00:24:39] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 1338 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
// Phase 1: matrix 191 rows 243 cols
[2024-05-22 00:24:41] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 00:24:41] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:24:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 00:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:42] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-22 00:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:24:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:24:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 92 ms returned sat
[2024-05-22 00:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:42] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-22 00:24:42] [INFO ] Computed and/alt/rep : 176/425/176 causal constraints (skipped 11 transitions) in 12 ms.
[2024-05-22 00:24:43] [INFO ] Added : 109 causal constraints over 22 iterations in 466 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 12987 reset in 261 ms.
Product exploration explored 100000 steps with 13163 reset in 328 ms.
Built C files in :
/tmp/ltsmin3906319602501391798
[2024-05-22 00:24:43] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-22 00:24:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:43] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-22 00:24:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:44] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-22 00:24:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:44] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3906319602501391798
Running compilation step : cd /tmp/ltsmin3906319602501391798;'/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 502 ms.
Running link step : cd /tmp/ltsmin3906319602501391798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3906319602501391798;'/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/stateBased8171682464889016197.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 191/191 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-22 00:24:59] [INFO ] Invariant cache hit.
[2024-05-22 00:24:59] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:24:59] [INFO ] Invariant cache hit.
[2024-05-22 00:24:59] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-22 00:24:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:24:59] [INFO ] Invariant cache hit.
[2024-05-22 00:24:59] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 243/243 places, 191/191 transitions.
Built C files in :
/tmp/ltsmin14570276786934615082
[2024-05-22 00:24:59] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-22 00:24:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:59] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-22 00:24:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:59] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-22 00:24:59] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:24:59] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14570276786934615082
Running compilation step : cd /tmp/ltsmin14570276786934615082;'/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 392 ms.
Running link step : cd /tmp/ltsmin14570276786934615082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14570276786934615082;'/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/stateBased17291975352369075065.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:25:14] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:25:14] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:25:14] [INFO ] Time to serialize gal into /tmp/LTL3616589614865082155.gal : 3 ms
[2024-05-22 00:25:14] [INFO ] Time to serialize properties into /tmp/LTL10839718947663388543.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/LTL3616589614865082155.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3645651549949855890.hoa' '-atoms' '/tmp/LTL10839718947663388543.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10839718947663388543.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3645651549949855890.hoa
Detected timeout of ITS tools.
[2024-05-22 00:25:29] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:25:29] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:25:29] [INFO ] Time to serialize gal into /tmp/LTL4635808030933230118.gal : 2 ms
[2024-05-22 00:25:29] [INFO ] Time to serialize properties into /tmp/LTL10299431015544598672.ltl : 2 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/LTL4635808030933230118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10299431015544598672.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("((p19==1)&&(p250==1))"))U((G((F("(p258!=1)"))&&(F(G(!("((p91==1)&&(p243==1))"))))))U("((p91==1)&&(p243==1))"))))
Formula 0 simplified : X!"((p19==1)&&(p250==1))" R (F(G!"(p258!=1)" | GF"((p91==1)&&(p243==1))") R !"((p91==1)&&(p243==1))")
Detected timeout of ITS tools.
[2024-05-22 00:25:44] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:25:44] [INFO ] Applying decomposition
[2024-05-22 00:25:44] [INFO ] Flatten gal took : 12 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/graph10706732753098060723.txt' '-o' '/tmp/graph10706732753098060723.bin' '-w' '/tmp/graph10706732753098060723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10706732753098060723.bin' '-l' '-1' '-v' '-w' '/tmp/graph10706732753098060723.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:25:45] [INFO ] Decomposing Gal with order
[2024-05-22 00:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:25:45] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 00:25:45] [INFO ] Flatten gal took : 41 ms
[2024-05-22 00:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2024-05-22 00:25:45] [INFO ] Time to serialize gal into /tmp/LTL12951418635156352363.gal : 4 ms
[2024-05-22 00:25:45] [INFO ] Time to serialize properties into /tmp/LTL10743396123797863714.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/LTL12951418635156352363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10743396123797863714.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...256
Read 1 LTL properties
Checking formula 0 : !(((X("((u9.p19==1)&&(u9.p250==1))"))U((G((F("(i10.i0.u10.p258!=1)"))&&(F(G(!("((u8.p91==1)&&(u8.p243==1))"))))))U("((u8.p91==1)&&(u8....169
Formula 0 simplified : X!"((u9.p19==1)&&(u9.p250==1))" R (F(G!"(i10.i0.u10.p258!=1)" | GF"((u8.p91==1)&&(u8.p243==1))") R !"((u8.p91==1)&&(u8.p243==1))")
Reverse transition relation is NOT exact ! Due to transitions t299, t78_t80_t81_t90_t91_t82, t7_t48_t39, t35_t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t5...839
Computing Next relation with stutter on 6.88693e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5734420805463762656
[2024-05-22 00:26:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5734420805463762656
Running compilation step : cd /tmp/ltsmin5734420805463762656;'/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 341 ms.
Running link step : cd /tmp/ltsmin5734420805463762656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5734420805463762656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U ([]((<>((LTLAPp1==true))&&<>([](!(LTLAPp2==true))))) U (LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA DES-PT-30b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30b-LTLFireability-00 finished in 104958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X((!p0 U p1))))) U (G(p0) U p2)))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 354 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
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 354 transition count 294
Applied a total of 21 rules in 18 ms. Remains 354 /362 variables (removed 8) and now considering 294/307 (removed 13) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-22 00:26:00] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:26:00] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 00:26:00] [INFO ] Invariant cache hit.
[2024-05-22 00:26:01] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-22 00:26:01] [INFO ] Invariant cache hit.
[2024-05-22 00:26:01] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 294/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 354/362 places, 294/307 transitions.
Stuttering acceptance computed with spot in 611 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=12 dest: 14}], [{ cond=(NOT p0), acceptance={} source=13 dest: 6}, { cond=p0, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=14 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p2) p0), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p2:(EQ s171 1), p0:(AND (EQ s47 1) (EQ s346 1)), p1:(AND (EQ s36 1) (EQ s346 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-01 finished in 1316 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 U X(X(X(!p0)))))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 17 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:26:01] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 00:26:02] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 00:26:02] [INFO ] Invariant cache hit.
[2024-05-22 00:26:02] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-22 00:26:02] [INFO ] Invariant cache hit.
[2024-05-22 00:26:02] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 301 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : DES-PT-30b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}, { cond=p0, acceptance={0} source=0 dest: 7}], [{ cond=p0, acceptance={0} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(AND (EQ s323 1) (EQ s349 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 881 reset in 236 ms.
Product exploration explored 100000 steps with 892 reset in 191 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Finished random walk after 229 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 304 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 353 /353 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 00:26:04] [INFO ] Invariant cache hit.
[2024-05-22 00:26:04] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 00:26:04] [INFO ] Invariant cache hit.
[2024-05-22 00:26:04] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-22 00:26:04] [INFO ] Invariant cache hit.
[2024-05-22 00:26:05] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 353/353 places, 293/293 transitions.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Finished random walk after 305 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=152 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 296 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 299 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 882 reset in 169 ms.
Product exploration explored 100000 steps with 888 reset in 185 ms.
Built C files in :
/tmp/ltsmin6654751305061237293
[2024-05-22 00:26:06] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6654751305061237293
Running compilation step : cd /tmp/ltsmin6654751305061237293;'/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 458 ms.
Running link step : cd /tmp/ltsmin6654751305061237293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6654751305061237293;'/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/stateBased3431717536917349560.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Applied a total of 0 rules in 4 ms. Remains 353 /353 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 00:26:22] [INFO ] Invariant cache hit.
[2024-05-22 00:26:22] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 00:26:22] [INFO ] Invariant cache hit.
[2024-05-22 00:26:22] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-22 00:26:22] [INFO ] Invariant cache hit.
[2024-05-22 00:26:22] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 353/353 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin16774453775367689767
[2024-05-22 00:26:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16774453775367689767
Running compilation step : cd /tmp/ltsmin16774453775367689767;'/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 443 ms.
Running link step : cd /tmp/ltsmin16774453775367689767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16774453775367689767;'/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/stateBased16823970210334408022.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:26:37] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:26:37] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:26:37] [INFO ] Time to serialize gal into /tmp/LTL5420266641051286838.gal : 2 ms
[2024-05-22 00:26:37] [INFO ] Time to serialize properties into /tmp/LTL16908653255167165275.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/LTL5420266641051286838.gal' '-t' 'CGAL' '-hoa' '/tmp/aut80828778913447560.hoa' '-atoms' '/tmp/LTL16908653255167165275.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL16908653255167165275.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut80828778913447560.hoa
Detected timeout of ITS tools.
[2024-05-22 00:26:52] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:26:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:26:52] [INFO ] Time to serialize gal into /tmp/LTL7066982094251523787.gal : 2 ms
[2024-05-22 00:26:52] [INFO ] Time to serialize properties into /tmp/LTL1302346230848734134.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/LTL7066982094251523787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1302346230848734134.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((p366==1)&&(p395==1))"))U(X(X(X(!("((p366==1)&&(p395==1))")))))))))
Formula 0 simplified : GF("((p366==1)&&(p395==1))" R XXX"((p366==1)&&(p395==1))")
Detected timeout of ITS tools.
[2024-05-22 00:27:08] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:27:08] [INFO ] Applying decomposition
[2024-05-22 00:27:08] [INFO ] Flatten gal took : 11 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/graph4969993747941440226.txt' '-o' '/tmp/graph4969993747941440226.bin' '-w' '/tmp/graph4969993747941440226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4969993747941440226.bin' '-l' '-1' '-v' '-w' '/tmp/graph4969993747941440226.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:27:08] [INFO ] Decomposing Gal with order
[2024-05-22 00:27:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:27:08] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 00:27:08] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:27:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 00:27:08] [INFO ] Time to serialize gal into /tmp/LTL3430016939844319954.gal : 4 ms
[2024-05-22 00:27:08] [INFO ] Time to serialize properties into /tmp/LTL7832735753094441410.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/LTL3430016939844319954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7832735753094441410.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(G((!("((i8.u67.p366==1)&&(i9.u75.p395==1))"))U(X(X(X(!("((i8.u67.p366==1)&&(i9.u75.p395==1))")))))))))
Formula 0 simplified : GF("((i8.u67.p366==1)&&(i9.u75.p395==1))" R XXX"((i8.u67.p366==1)&&(i9.u75.p395==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13974181080867292906
[2024-05-22 00:27:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13974181080867292906
Running compilation step : cd /tmp/ltsmin13974181080867292906;'/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 466 ms.
Running link step : cd /tmp/ltsmin13974181080867292906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13974181080867292906;'/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) U X(X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30b-LTLFireability-02 finished in 96325 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(((p1&&G(F(p2)))||p0)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
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 74 place count 320 transition count 263
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 220 place count 247 transition count 190
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 245 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 243 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 242 transition count 190
Applied a total of 227 rules in 50 ms. Remains 242 /362 variables (removed 120) and now considering 190/307 (removed 117) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-22 00:27:38] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:27:38] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 00:27:38] [INFO ] Invariant cache hit.
[2024-05-22 00:27:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:38] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-22 00:27:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:27:38] [INFO ] Invariant cache hit.
[2024-05-22 00:27:38] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/362 places, 190/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 242/362 places, 190/307 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s162 1) (NEQ s181 1)), p1:(OR (NEQ s108 1) (NEQ s124 1)), p2:(NEQ s179 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]]
Product exploration explored 100000 steps with 4247 reset in 229 ms.
Product exploration explored 100000 steps with 4296 reset in 249 ms.
Computed a total of 137 stabilizing places and 132 stable transitions
Computed a total of 137 stabilizing places and 132 stable transitions
Detected a total of 137/242 stabilizing places and 132/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 289 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 410 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:27:40] [INFO ] Invariant cache hit.
[2024-05-22 00:27:40] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-22 00:27:40] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:27:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:40] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 29 ms returned sat
[2024-05-22 00:27:40] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-22 00:27:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:40] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-22 00:27:40] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-22 00:27:40] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 190/190 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 241 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 240 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 240 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 239 transition count 186
Applied a total of 7 rules in 36 ms. Remains 239 /242 variables (removed 3) and now considering 186/190 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 239/242 places, 186/190 transitions.
Incomplete random walk after 10000 steps, including 442 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1204670 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 1204670 steps, saw 162237 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 00:27:43] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:27:43] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 00:27:43] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:27:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:27:44] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:27:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:44] [INFO ] After 46ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 00:27:44] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-22 00:27:44] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 239/239 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-22 00:27:44] [INFO ] Invariant cache hit.
[2024-05-22 00:27:44] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:27:44] [INFO ] Invariant cache hit.
[2024-05-22 00:27:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:44] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-22 00:27:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:27:44] [INFO ] Invariant cache hit.
[2024-05-22 00:27:44] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 239/239 places, 186/186 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 239 transition count 186
Applied a total of 1 rules in 16 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 00:27:44] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:27:44] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:27:44] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:27:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:27:45] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:27:45] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-22 00:27:45] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 389 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-22 00:27:45] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:27:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 00:27:45] [INFO ] Invariant cache hit.
[2024-05-22 00:27:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:46] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-22 00:27:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:27:46] [INFO ] Invariant cache hit.
[2024-05-22 00:27:46] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 521 ms. Remains : 242/242 places, 190/190 transitions.
Computed a total of 137 stabilizing places and 132 stable transitions
Computed a total of 137 stabilizing places and 132 stable transitions
Detected a total of 137/242 stabilizing places and 132/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 257 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 411 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:27:47] [INFO ] Invariant cache hit.
[2024-05-22 00:27:47] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:47] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-22 00:27:47] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:27:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2024-05-22 00:27:47] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-22 00:27:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:47] [INFO ] After 25ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-22 00:27:47] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-22 00:27:47] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 190/190 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 189
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 241 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 240 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 240 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 239 transition count 186
Applied a total of 7 rules in 33 ms. Remains 239 /242 variables (removed 3) and now considering 186/190 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 239/242 places, 186/190 transitions.
Incomplete random walk after 10000 steps, including 446 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1056708 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :{}
Probabilistic random walk after 1056708 steps, saw 140880 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 00:27:50] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:27:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:27:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:27:50] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:27:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:27:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:27:51] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:27:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:51] [INFO ] After 40ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 00:27:51] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-22 00:27:51] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 239/239 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-22 00:27:51] [INFO ] Invariant cache hit.
[2024-05-22 00:27:51] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:27:51] [INFO ] Invariant cache hit.
[2024-05-22 00:27:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:27:51] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-22 00:27:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:27:51] [INFO ] Invariant cache hit.
[2024-05-22 00:27:51] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 239/239 places, 186/186 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 239 transition count 186
Applied a total of 1 rules in 7 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 00:27:51] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 00:27:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:27:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:27:51] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 00:27:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:27:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:27:51] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 00:27:51] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 00:27:52] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 403 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4280 reset in 229 ms.
Product exploration explored 100000 steps with 4235 reset in 253 ms.
Built C files in :
/tmp/ltsmin14898211501720668954
[2024-05-22 00:27:53] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-22 00:27:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:27:53] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-22 00:27:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:27:53] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-22 00:27:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:27:53] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14898211501720668954
Running compilation step : cd /tmp/ltsmin14898211501720668954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin14898211501720668954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14898211501720668954;'/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/stateBased14650047494919854771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 190/190 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-22 00:28:08] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:28:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 00:28:08] [INFO ] Invariant cache hit.
[2024-05-22 00:28:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:28:08] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-22 00:28:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:28:08] [INFO ] Invariant cache hit.
[2024-05-22 00:28:08] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 242/242 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin4156059951221710064
[2024-05-22 00:28:09] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-22 00:28:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:28:09] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-22 00:28:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:28:09] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-22 00:28:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:28:09] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4156059951221710064
Running compilation step : cd /tmp/ltsmin4156059951221710064;'/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 386 ms.
Running link step : cd /tmp/ltsmin4156059951221710064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4156059951221710064;'/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/stateBased7265275965302014430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:28:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:28:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:28:24] [INFO ] Time to serialize gal into /tmp/LTL7459414574719034551.gal : 2 ms
[2024-05-22 00:28:24] [INFO ] Time to serialize properties into /tmp/LTL12605580464269659029.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/LTL7459414574719034551.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13207985742738881313.hoa' '-atoms' '/tmp/LTL12605580464269659029.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12605580464269659029.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13207985742738881313.hoa
Detected timeout of ITS tools.
[2024-05-22 00:28:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:28:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:28:39] [INFO ] Time to serialize gal into /tmp/LTL13583044187904553939.gal : 1 ms
[2024-05-22 00:28:39] [INFO ] Time to serialize properties into /tmp/LTL9916144236268882302.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/LTL13583044187904553939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9916144236268882302.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(("((p277!=1)||(p302!=1))")||((G(F("(p294!=1)")))&&("((p117!=1)||(p149!=1))")))))
Formula 0 simplified : F(!"((p277!=1)||(p302!=1))" & (!"((p117!=1)||(p149!=1))" | FG!"(p294!=1)"))
Detected timeout of ITS tools.
[2024-05-22 00:28:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:28:54] [INFO ] Applying decomposition
[2024-05-22 00:28:54] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5688628976307655582.txt' '-o' '/tmp/graph5688628976307655582.bin' '-w' '/tmp/graph5688628976307655582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5688628976307655582.bin' '-l' '-1' '-v' '-w' '/tmp/graph5688628976307655582.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:28:54] [INFO ] Decomposing Gal with order
[2024-05-22 00:28:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:28:54] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 00:28:54] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:28:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 3 ms.
[2024-05-22 00:28:54] [INFO ] Time to serialize gal into /tmp/LTL13470984118046438894.gal : 3 ms
[2024-05-22 00:28:54] [INFO ] Time to serialize properties into /tmp/LTL869054864031160324.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/LTL13470984118046438894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL869054864031160324.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i8.i0.u13.p277!=1)||(i8.i0.u20.p302!=1))")||((G(F("(i7.i1.u27.p294!=1)")))&&("((u2.p117!=1)||(u2.p149!=1))")))))
Formula 0 simplified : F(!"((i8.i0.u13.p277!=1)||(i8.i0.u20.p302!=1))" & (!"((u2.p117!=1)||(u2.p149!=1))" | FG!"(i7.i1.u27.p294!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t120_t128, t299_t79, t52_t54_t56_t58_t60_t62, t7_t48_t39, t266_t34, t265_t25, t110_t111_t127_...774
Computing Next relation with stutter on 6.88693e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15308508043068972250
[2024-05-22 00:29:09] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15308508043068972250
Running compilation step : cd /tmp/ltsmin15308508043068972250;'/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 363 ms.
Running link step : cd /tmp/ltsmin15308508043068972250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15308508043068972250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((([](<>((LTLAPp1==true)))&&(LTLAPp2==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30b-LTLFireability-03 finished in 106219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
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 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
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 74 place count 320 transition count 263
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 226 place count 244 transition count 187
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 230 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 239 transition count 187
Applied a total of 233 rules in 48 ms. Remains 239 /362 variables (removed 123) and now considering 187/307 (removed 120) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:29:24] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:29:24] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 00:29:24] [INFO ] Invariant cache hit.
[2024-05-22 00:29:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:24] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-22 00:29:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:29:24] [INFO ] Invariant cache hit.
[2024-05-22 00:29:25] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/362 places, 187/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 239/362 places, 187/307 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s110 1) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4912 reset in 190 ms.
Product exploration explored 100000 steps with 4793 reset in 210 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 496 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1803526 steps, run timeout after 3001 ms. (steps per millisecond=600 ) properties seen :{}
Probabilistic random walk after 1803526 steps, saw 245976 distinct states, run finished after 3001 ms. (steps per millisecond=600 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:29:28] [INFO ] Invariant cache hit.
[2024-05-22 00:29:28] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 00:29:28] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:29:28] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:29:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2024-05-22 00:29:28] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 84 ms returned sat
[2024-05-22 00:29:28] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:29] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:29] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-22 00:29:29] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 14 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 238/239 places, 185/187 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1820506 steps, run timeout after 3001 ms. (steps per millisecond=606 ) properties seen :{}
Probabilistic random walk after 1820506 steps, saw 248118 distinct states, run finished after 3001 ms. (steps per millisecond=606 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:29:32] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 00:29:32] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:32] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:29:32] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:29:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:32] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-22 00:29:32] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:32] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:32] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-22 00:29:32] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 00:29:32] [INFO ] Invariant cache hit.
[2024-05-22 00:29:32] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 00:29:32] [INFO ] Invariant cache hit.
[2024-05-22 00:29:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:32] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-22 00:29:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:29:32] [INFO ] Invariant cache hit.
[2024-05-22 00:29:32] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 238/238 places, 185/185 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 238 transition count 185
Applied a total of 1 rules in 6 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:29:32] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 00:29:32] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:32] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-22 00:29:32] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:29:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-22 00:29:33] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:33] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-22 00:29:33] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 12 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:29:33] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 00:29:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 00:29:33] [INFO ] Invariant cache hit.
[2024-05-22 00:29:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:33] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-22 00:29:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:29:33] [INFO ] Invariant cache hit.
[2024-05-22 00:29:33] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 534 ms. Remains : 239/239 places, 187/187 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 462 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 89 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1818645 steps, run timeout after 3001 ms. (steps per millisecond=606 ) properties seen :{}
Probabilistic random walk after 1818645 steps, saw 247982 distinct states, run finished after 3001 ms. (steps per millisecond=606 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:29:37] [INFO ] Invariant cache hit.
[2024-05-22 00:29:37] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:37] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-22 00:29:37] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:29:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:37] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 84 ms returned sat
[2024-05-22 00:29:37] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:37] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:37] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-22 00:29:37] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 12 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 238/239 places, 185/187 transitions.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1838598 steps, run timeout after 3001 ms. (steps per millisecond=612 ) properties seen :{}
Probabilistic random walk after 1838598 steps, saw 250221 distinct states, run finished after 3001 ms. (steps per millisecond=612 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:29:40] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 00:29:40] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:40] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:29:40] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:29:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:40] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 29 ms returned sat
[2024-05-22 00:29:40] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:40] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:40] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-22 00:29:40] [INFO ] After 268ms 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 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 00:29:40] [INFO ] Invariant cache hit.
[2024-05-22 00:29:40] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:29:40] [INFO ] Invariant cache hit.
[2024-05-22 00:29:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:41] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-22 00:29:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:29:41] [INFO ] Invariant cache hit.
[2024-05-22 00:29:41] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 238/238 places, 185/185 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 238 transition count 185
Applied a total of 1 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:29:41] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 00:29:41] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:41] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:29:41] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:29:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:29:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-22 00:29:41] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:29:41] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-22 00:29:41] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4882 reset in 197 ms.
Product exploration explored 100000 steps with 4932 reset in 209 ms.
Built C files in :
/tmp/ltsmin10784730613198835947
[2024-05-22 00:29:42] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-22 00:29:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:29:42] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-22 00:29:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:29:42] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-22 00:29:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:29:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10784730613198835947
Running compilation step : cd /tmp/ltsmin10784730613198835947;'/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 388 ms.
Running link step : cd /tmp/ltsmin10784730613198835947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10784730613198835947;'/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/stateBased99620946568260098.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:29:57] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:29:57] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 00:29:57] [INFO ] Invariant cache hit.
[2024-05-22 00:29:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:29:57] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-22 00:29:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:29:57] [INFO ] Invariant cache hit.
[2024-05-22 00:29:57] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 239/239 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin17608148673483143106
[2024-05-22 00:29:57] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-22 00:29:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:29:57] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-22 00:29:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:29:57] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-22 00:29:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:29:57] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17608148673483143106
Running compilation step : cd /tmp/ltsmin17608148673483143106;'/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 375 ms.
Running link step : cd /tmp/ltsmin17608148673483143106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17608148673483143106;'/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/stateBased15653009405611047494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:30:12] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:30:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:30:12] [INFO ] Time to serialize gal into /tmp/LTL15895076182634857915.gal : 1 ms
[2024-05-22 00:30:12] [INFO ] Time to serialize properties into /tmp/LTL17310323717813793438.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/LTL15895076182634857915.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9685061825427450240.hoa' '-atoms' '/tmp/LTL17310323717813793438.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17310323717813793438.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9685061825427450240.hoa
Detected timeout of ITS tools.
[2024-05-22 00:30:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:30:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:30:28] [INFO ] Time to serialize gal into /tmp/LTL4733965131857004062.gal : 2 ms
[2024-05-22 00:30:28] [INFO ] Time to serialize properties into /tmp/LTL12443599749664533053.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/LTL4733965131857004062.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12443599749664533053.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p119!=1)||(p149!=1))"))))
Formula 0 simplified : GF!"((p119!=1)||(p149!=1))"
Detected timeout of ITS tools.
[2024-05-22 00:30:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:30:43] [INFO ] Applying decomposition
[2024-05-22 00:30:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph557626783161062064.txt' '-o' '/tmp/graph557626783161062064.bin' '-w' '/tmp/graph557626783161062064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph557626783161062064.bin' '-l' '-1' '-v' '-w' '/tmp/graph557626783161062064.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:30:43] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:43] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 00:30:43] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-22 00:30:43] [INFO ] Time to serialize gal into /tmp/LTL4406894052151567077.gal : 2 ms
[2024-05-22 00:30:43] [INFO ] Time to serialize properties into /tmp/LTL8198529029188877620.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/LTL4406894052151567077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8198529029188877620.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(G("((u2.p119!=1)||(u2.p149!=1))"))))
Formula 0 simplified : GF!"((u2.p119!=1)||(u2.p149!=1))"
Reverse transition relation is NOT exact ! Due to transitions t120_t128, t299_t79, t7_t48_t39, t266_t34, t265_t25, t110_t111_t127_t306_t132_t130_t131_t121,...734
Computing Next relation with stutter on 6.88693e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16380200458212434120
[2024-05-22 00:30:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16380200458212434120
Running compilation step : cd /tmp/ltsmin16380200458212434120;'/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 359 ms.
Running link step : cd /tmp/ltsmin16380200458212434120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16380200458212434120;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30b-LTLFireability-04 finished in 108814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X(p1)))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 10 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:31:13] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 00:31:13] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 00:31:13] [INFO ] Invariant cache hit.
[2024-05-22 00:31:13] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-22 00:31:13] [INFO ] Invariant cache hit.
[2024-05-22 00:31:13] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s176 1), p1:(EQ s322 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-05 finished in 846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 354 transition count 287
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 339 transition count 286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 339 transition count 275
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 54 place count 328 transition count 275
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 322 transition count 269
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 322 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 322 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 322 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 321 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 320 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 320 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 320 transition count 262
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 76 place count 319 transition count 262
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 226 place count 244 transition count 187
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 230 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 239 transition count 187
Applied a total of 233 rules in 37 ms. Remains 239 /362 variables (removed 123) and now considering 187/307 (removed 120) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:31:14] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:31:14] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 00:31:14] [INFO ] Invariant cache hit.
[2024-05-22 00:31:14] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-22 00:31:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:31:14] [INFO ] Invariant cache hit.
[2024-05-22 00:31:14] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/362 places, 187/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 481 ms. Remains : 239/362 places, 187/307 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s74 1) (EQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-06 finished in 568 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))&&F(p1)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 15 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:31:14] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 00:31:14] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 00:31:14] [INFO ] Invariant cache hit.
[2024-05-22 00:31:15] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-22 00:31:15] [INFO ] Invariant cache hit.
[2024-05-22 00:31:15] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s256 1) (OR (EQ s211 0) (EQ s213 0))), p1:(AND (EQ s78 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-07 finished in 810 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 U p1) U X((G(!p0)&&F(p2)))))))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
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 52 place count 329 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 325 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 325 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 325 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 325 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 324 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 323 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 323 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 323 transition count 267
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 219 place count 247 transition count 191
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 223 place count 245 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 243 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 242 transition count 191
Applied a total of 226 rules in 34 ms. Remains 242 /362 variables (removed 120) and now considering 191/307 (removed 116) transitions.
// Phase 1: matrix 191 rows 242 cols
[2024-05-22 00:31:15] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 00:31:15] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 00:31:15] [INFO ] Invariant cache hit.
[2024-05-22 00:31:15] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-22 00:31:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:31:15] [INFO ] Invariant cache hit.
[2024-05-22 00:31:16] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/362 places, 191/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 476 ms. Remains : 242/362 places, 191/307 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), false, (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-30b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=p0, acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=p0, acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=p0, acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 2}, { cond=p0, acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=7 dest: 1}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s237 1)), p0:(AND (EQ s143 1) (EQ s148 1)), p2:(NEQ s133 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4937 reset in 244 ms.
Product exploration explored 100000 steps with 5019 reset in 271 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/242 stabilizing places and 130/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p2)), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 195 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 476 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 87 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:31:17] [INFO ] Invariant cache hit.
[2024-05-22 00:31:17] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:31:17] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:31:17] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:31:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:31:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 23 ms returned sat
[2024-05-22 00:31:17] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:31:17] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 00:31:17] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 191/191 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 190
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 241 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 239 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 239 transition count 187
Applied a total of 8 rules in 17 ms. Remains 239 /242 variables (removed 3) and now considering 187/191 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 239/242 places, 187/191 transitions.
Incomplete random walk after 10000 steps, including 453 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 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1731989 steps, run timeout after 3001 ms. (steps per millisecond=577 ) properties seen :{}
Probabilistic random walk after 1731989 steps, saw 227399 distinct states, run finished after 3001 ms. (steps per millisecond=577 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:31:21] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 00:31:21] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:31:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:31:21] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:31:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:31:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 63 ms returned sat
[2024-05-22 00:31:21] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:31:21] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-22 00:31:21] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 239/239 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-22 00:31:21] [INFO ] Invariant cache hit.
[2024-05-22 00:31:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:31:21] [INFO ] Invariant cache hit.
[2024-05-22 00:31:21] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-22 00:31:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:31:21] [INFO ] Invariant cache hit.
[2024-05-22 00:31:21] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 239/239 places, 187/187 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 239 transition count 187
Applied a total of 1 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:31:21] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:31:21] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:31:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:31:21] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:31:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:31:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 59 ms returned sat
[2024-05-22 00:31:22] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:31:22] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 00:31:22] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p2)), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 15 factoid took 673 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 191/191 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 242 cols
[2024-05-22 00:31:23] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 00:31:23] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 00:31:23] [INFO ] Invariant cache hit.
[2024-05-22 00:31:24] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-22 00:31:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:31:24] [INFO ] Invariant cache hit.
[2024-05-22 00:31:24] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 503 ms. Remains : 242/242 places, 191/191 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/242 stabilizing places and 130/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 262 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 501 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 93 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:31:25] [INFO ] Invariant cache hit.
[2024-05-22 00:31:25] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:31:25] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:31:25] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:31:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:31:25] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 23 ms returned sat
[2024-05-22 00:31:25] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:31:25] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:31:25] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 191/191 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 190
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 241 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 239 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 239 transition count 187
Applied a total of 8 rules in 14 ms. Remains 239 /242 variables (removed 3) and now considering 187/191 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 239/242 places, 187/191 transitions.
Incomplete random walk after 10000 steps, including 466 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1720364 steps, run timeout after 3001 ms. (steps per millisecond=573 ) properties seen :{}
Probabilistic random walk after 1720364 steps, saw 225690 distinct states, run finished after 3001 ms. (steps per millisecond=573 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:31:28] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:31:28] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:31:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:31:28] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:31:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:31:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 58 ms returned sat
[2024-05-22 00:31:28] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:31:28] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-22 00:31:28] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 239/239 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-22 00:31:28] [INFO ] Invariant cache hit.
[2024-05-22 00:31:28] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 00:31:28] [INFO ] Invariant cache hit.
[2024-05-22 00:31:29] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-22 00:31:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:31:29] [INFO ] Invariant cache hit.
[2024-05-22 00:31:29] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 239/239 places, 187/187 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 239 transition count 187
Applied a total of 1 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:31:29] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:31:29] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:31:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 00:31:29] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:31:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:31:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 58 ms returned sat
[2024-05-22 00:31:29] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:31:29] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 00:31:29] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 19 factoid took 980 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 4918 reset in 260 ms.
Product exploration explored 100000 steps with 4911 reset in 286 ms.
Built C files in :
/tmp/ltsmin253676722355286226
[2024-05-22 00:31:32] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-22 00:31:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:31:32] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-22 00:31:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:31:32] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-22 00:31:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:31:32] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin253676722355286226
Running compilation step : cd /tmp/ltsmin253676722355286226;'/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 422 ms.
Running link step : cd /tmp/ltsmin253676722355286226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin253676722355286226;'/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/stateBased11364542751642757275.hoa' '--buchi-type=spotba'
LTSmin run took 3740 ms.
FORMULA DES-PT-30b-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30b-LTLFireability-08 finished in 21050 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||(F(p0)&&p1)))||X(F(p2))))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Applied a total of 20 rules in 16 ms. Remains 354 /362 variables (removed 8) and now considering 295/307 (removed 12) transitions.
// Phase 1: matrix 295 rows 354 cols
[2024-05-22 00:31:36] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 00:31:36] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 00:31:36] [INFO ] Invariant cache hit.
[2024-05-22 00:31:37] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-22 00:31:37] [INFO ] Invariant cache hit.
[2024-05-22 00:31:37] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 295/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 680 ms. Remains : 354/362 places, 295/307 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-30b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s146 0), p1:(AND (EQ s82 1) (EQ s203 1)), p2:(EQ s145 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 249 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-09 finished in 859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 10 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:31:37] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 00:31:37] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 00:31:37] [INFO ] Invariant cache hit.
[2024-05-22 00:31:37] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-22 00:31:37] [INFO ] Invariant cache hit.
[2024-05-22 00:31:38] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s174 1) (NEQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 283 steps with 2 reset in 2 ms.
FORMULA DES-PT-30b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-10 finished in 777 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((X(p0)&&(p1||X(p2)))))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 354 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
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 354 transition count 294
Applied a total of 21 rules in 11 ms. Remains 354 /362 variables (removed 8) and now considering 294/307 (removed 13) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-22 00:31:38] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:31:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 00:31:38] [INFO ] Invariant cache hit.
[2024-05-22 00:31:38] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-22 00:31:38] [INFO ] Invariant cache hit.
[2024-05-22 00:31:38] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 294/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 354/362 places, 294/307 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-30b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s222 1) (EQ s341 1)), p0:(OR (EQ s222 0) (EQ s341 0)), p2:(AND (EQ s189 1) (EQ s191 1))], 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-30b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-11 finished in 804 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&&G(p1))))'
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 15 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:31:39] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:31:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 00:31:39] [INFO ] Invariant cache hit.
[2024-05-22 00:31:39] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-22 00:31:39] [INFO ] Invariant cache hit.
[2024-05-22 00:31:39] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-12 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=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s8 0) (EQ s209 0)), p0:(OR (AND (EQ s64 1) (EQ s345 1)) (AND (EQ s121 1) (EQ s142 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-12 finished in 712 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 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 340 transition count 288
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 340 transition count 278
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 330 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 324 transition count 272
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 324 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 324 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 324 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 323 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 322 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 322 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 322 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 322 transition count 265
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 71 place count 321 transition count 265
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 225 place count 244 transition count 188
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 227 place count 243 transition count 188
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 241 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 240 transition count 186
Applied a total of 230 rules in 36 ms. Remains 240 /362 variables (removed 122) and now considering 186/307 (removed 121) transitions.
// Phase 1: matrix 186 rows 240 cols
[2024-05-22 00:31:39] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:31:39] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:31:39] [INFO ] Invariant cache hit.
[2024-05-22 00:31:40] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-22 00:31:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:31:40] [INFO ] Invariant cache hit.
[2024-05-22 00:31:40] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/362 places, 186/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 478 ms. Remains : 240/362 places, 186/307 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s126 1) (AND (EQ s16 1) (EQ s153 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 28 steps with 1 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-13 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1)&&X(F(p2)))))'
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Applied a total of 20 rules in 17 ms. Remains 354 /362 variables (removed 8) and now considering 295/307 (removed 12) transitions.
// Phase 1: matrix 295 rows 354 cols
[2024-05-22 00:31:40] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 00:31:40] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 00:31:40] [INFO ] Invariant cache hit.
[2024-05-22 00:31:40] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-05-22 00:31:40] [INFO ] Invariant cache hit.
[2024-05-22 00:31:40] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 295/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 354/362 places, 295/307 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s152 1) (EQ s317 1)), p1:(AND (EQ s39 1) (EQ s346 1)), p2:(AND (EQ s107 1) (EQ s142 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-14 finished in 863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Applied a total of 18 rules in 14 ms. Remains 355 /362 variables (removed 7) and now considering 296/307 (removed 11) transitions.
// Phase 1: matrix 296 rows 355 cols
[2024-05-22 00:31:41] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:31:41] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 00:31:41] [INFO ] Invariant cache hit.
[2024-05-22 00:31:41] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-22 00:31:41] [INFO ] Invariant cache hit.
[2024-05-22 00:31:41] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 355/362 places, 296/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 355/362 places, 296/307 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-15 finished in 740 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 U X(X(X(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1&&G(F(p2)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-22 00:31:42] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9183876602551848883
[2024-05-22 00:31:42] [INFO ] Computing symmetric may disable matrix : 307 transitions.
[2024-05-22 00:31:42] [INFO ] Applying decomposition
[2024-05-22 00:31:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:31:42] [INFO ] Computing symmetric may enable matrix : 307 transitions.
[2024-05-22 00:31:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:31:42] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:31:42] [INFO ] Computing Do-Not-Accords matrix : 307 transitions.
[2024-05-22 00:31:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:31:42] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9183876602551848883
Running compilation step : cd /tmp/ltsmin9183876602551848883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph8425315480146276826.txt' '-o' '/tmp/graph8425315480146276826.bin' '-w' '/tmp/graph8425315480146276826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8425315480146276826.bin' '-l' '-1' '-v' '-w' '/tmp/graph8425315480146276826.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:31:42] [INFO ] Decomposing Gal with order
[2024-05-22 00:31:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:31:42] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 00:31:42] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:31:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2024-05-22 00:31:42] [INFO ] Time to serialize gal into /tmp/LTLFireability5942546371940897288.gal : 3 ms
[2024-05-22 00:31:42] [INFO ] Time to serialize properties into /tmp/LTLFireability7343506028770584491.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/LTLFireability5942546371940897288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7343506028770584491.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(G((!("((i9.i2.u67.p366==1)&&(u75.p395==1))"))U(X(X(X(!("((i9.i2.u67.p366==1)&&(u75.p395==1))")))))))))
Formula 0 simplified : GF("((i9.i2.u67.p366==1)&&(u75.p395==1))" R XXX"((i9.i2.u67.p366==1)&&(u75.p395==1))")
Compilation finished in 605 ms.
Running link step : cd /tmp/ltsmin9183876602551848883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9183876602551848883;'/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) U X(X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t226, t265, t266, u32.t76, u30.t79, u75.t17, i1.t122, i1.u8.t201, i1.u8.t202, i1.u8....1109
Computing Next relation with stutter on 2.37204e+08 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( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: LTL layer: formula: <>([]((!(LTLAPp0==true) U X(X(X(!(LTLAPp0==true)))))))
pins2lts-mc-linux64( 6/ 8), 0.010: "<>([]((!(LTLAPp0==true) U X(X(X(!(LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: There are 313 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 363, there are 325 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.111: [Blue] ~120 levels ~960 states ~4752 transitions
pins2lts-mc-linux64( 4/ 8), 0.123: [Blue] ~108 levels ~1920 states ~7080 transitions
pins2lts-mc-linux64( 0/ 8), 0.161: [Blue] ~134 levels ~3840 states ~13912 transitions
pins2lts-mc-linux64( 1/ 8), 0.212: [Blue] ~87 levels ~7680 states ~32056 transitions
pins2lts-mc-linux64( 1/ 8), 0.292: [Blue] ~88 levels ~15360 states ~64352 transitions
pins2lts-mc-linux64( 1/ 8), 0.477: [Blue] ~111 levels ~30720 states ~135224 transitions
pins2lts-mc-linux64( 6/ 8), 0.876: [Blue] ~95 levels ~61440 states ~249832 transitions
pins2lts-mc-linux64( 6/ 8), 1.617: [Blue] ~95 levels ~122880 states ~549584 transitions
pins2lts-mc-linux64( 2/ 8), 2.909: [Blue] ~111 levels ~245760 states ~1404032 transitions
pins2lts-mc-linux64( 6/ 8), 5.082: [Blue] ~100 levels ~491520 states ~2394920 transitions
pins2lts-mc-linux64( 6/ 8), 8.932: [Blue] ~103 levels ~983040 states ~4899672 transitions
pins2lts-mc-linux64( 6/ 8), 16.022: [Blue] ~103 levels ~1966080 states ~10754856 transitions
pins2lts-mc-linux64( 6/ 8), 30.393: [Blue] ~103 levels ~3932160 states ~23190072 transitions
pins2lts-mc-linux64( 6/ 8), 58.793: [Blue] ~104 levels ~7864320 states ~46984016 transitions
pins2lts-mc-linux64( 6/ 8), 117.776: [Blue] ~104 levels ~15728640 states ~103624016 transitions
pins2lts-mc-linux64( 6/ 8), 240.658: [Blue] ~119 levels ~31457280 states ~209270832 transitions
pins2lts-mc-linux64( 1/ 8), 436.214: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 436.261:
pins2lts-mc-linux64( 0/ 8), 436.261: Explored 53419816 states 429233434 transitions, fanout: 8.035
pins2lts-mc-linux64( 0/ 8), 436.261: Total exploration time 436.180 sec (436.130 sec minimum, 436.156 sec on average)
pins2lts-mc-linux64( 0/ 8), 436.261: States per second: 122472, Transitions per second: 984074
pins2lts-mc-linux64( 0/ 8), 436.261:
pins2lts-mc-linux64( 0/ 8), 436.261: State space has 53347278 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 436.261: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 436.261: blue states: 53419816 (100.14%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 436.261: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 436.261: all-red states: 39 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 436.261:
pins2lts-mc-linux64( 0/ 8), 436.261: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 436.261:
pins2lts-mc-linux64( 0/ 8), 436.261: Queue width: 8B, total height: 1389, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 436.261: Tree memory: 663.0MB, 13.0 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 436.261: Tree fill ratio (roots/leafs): 39.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 436.261: Stored 310 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 436.261: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 436.261: Est. total memory use: 663.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9183876602551848883;'/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) U X(X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9183876602551848883;'/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) U X(X(X(!(LTLAPp0==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:54:15] [INFO ] Applying decomposition
[2024-05-22 00:54:15] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:54:15] [INFO ] Decomposing Gal with order
[2024-05-22 00:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:54:15] [INFO ] Removed a total of 128 redundant transitions.
[2024-05-22 00:54:15] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 427 labels/synchronizations in 12 ms.
[2024-05-22 00:54:15] [INFO ] Time to serialize gal into /tmp/LTLFireability18156327108183635458.gal : 4 ms
[2024-05-22 00:54:15] [INFO ] Time to serialize properties into /tmp/LTLFireability4180230753048673885.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/LTLFireability18156327108183635458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4180230753048673885.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 3 LTL properties
Checking formula 0 : !((F(G((!("((i1.i1.i0.i1.i0.i1.u119.p366==1)&&(i1.i1.i1.u105.p395==1))"))U(X(X(X(!("((i1.i1.i0.i1.i0.i1.u119.p366==1)&&(i1.i1.i1.u105....174
Formula 0 simplified : GF("((i1.i1.i0.i1.i0.i1.u119.p366==1)&&(i1.i1.i1.u105.p395==1))" R XXX"((i1.i1.i0.i1.i0.i1.u119.p366==1)&&(i1.i1.i1.u105.p395==1))")
Detected timeout of ITS tools.
[2024-05-22 01:16:49] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:16:49] [INFO ] Input system was already deterministic with 307 transitions.
[2024-05-22 01:16:49] [INFO ] Transformed 362 places.
[2024-05-22 01:16:49] [INFO ] Transformed 307 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 01:16:49] [INFO ] Time to serialize gal into /tmp/LTLFireability17715276969087339341.gal : 3 ms
[2024-05-22 01:16:49] [INFO ] Time to serialize properties into /tmp/LTLFireability16495187929873378838.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/LTLFireability17715276969087339341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16495187929873378838.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 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((!("((p366==1)&&(p395==1))"))U(X(X(X(!("((p366==1)&&(p395==1))")))))))))
Formula 0 simplified : GF("((p366==1)&&(p395==1))" R XXX"((p366==1)&&(p395==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11822536 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039540 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-30b"
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-30b, 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-171624208600443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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