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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 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 127K 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-50b-LTLFireability-00
FORMULA_NAME DES-PT-50b-LTLFireability-01
FORMULA_NAME DES-PT-50b-LTLFireability-02
FORMULA_NAME DES-PT-50b-LTLFireability-03
FORMULA_NAME DES-PT-50b-LTLFireability-04
FORMULA_NAME DES-PT-50b-LTLFireability-05
FORMULA_NAME DES-PT-50b-LTLFireability-06
FORMULA_NAME DES-PT-50b-LTLFireability-07
FORMULA_NAME DES-PT-50b-LTLFireability-08
FORMULA_NAME DES-PT-50b-LTLFireability-09
FORMULA_NAME DES-PT-50b-LTLFireability-10
FORMULA_NAME DES-PT-50b-LTLFireability-11
FORMULA_NAME DES-PT-50b-LTLFireability-12
FORMULA_NAME DES-PT-50b-LTLFireability-13
FORMULA_NAME DES-PT-50b-LTLFireability-14
FORMULA_NAME DES-PT-50b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716341336908

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-50b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 01:28:58] [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 01:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:28:58] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-22 01:28:58] [INFO ] Transformed 479 places.
[2024-05-22 01:28:58] [INFO ] Transformed 430 transitions.
[2024-05-22 01:28:58] [INFO ] Found NUPN structural information;
[2024-05-22 01:28:58] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-50b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 453 transition count 407
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 453 transition count 407
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 441 transition count 395
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 441 transition count 395
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 441 transition count 387
Applied a total of 81 rules in 100 ms. Remains 441 /479 variables (removed 38) and now considering 387/430 (removed 43) transitions.
// Phase 1: matrix 387 rows 441 cols
[2024-05-22 01:28:58] [INFO ] Computed 62 invariants in 42 ms
[2024-05-22 01:28:59] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-05-22 01:28:59] [INFO ] Invariant cache hit.
[2024-05-22 01:28:59] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-05-22 01:28:59] [INFO ] Invariant cache hit.
[2024-05-22 01:28:59] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 441/479 places, 387/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1424 ms. Remains : 441/479 places, 387/430 transitions.
Support contains 32 out of 441 places after structural reductions.
[2024-05-22 01:29:00] [INFO ] Flatten gal took : 63 ms
[2024-05-22 01:29:00] [INFO ] Flatten gal took : 25 ms
[2024-05-22 01:29:00] [INFO ] Input system was already deterministic with 387 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 25) seen :11
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-22 01:29:01] [INFO ] Invariant cache hit.
[2024-05-22 01:29:01] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2024-05-22 01:29:01] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-22 01:29:01] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-22 01:29:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 01:29:01] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 29 ms returned sat
[2024-05-22 01:29:02] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-22 01:29:02] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 5 ms to minimize.
[2024-05-22 01:29:02] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2024-05-22 01:29:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2024-05-22 01:29:03] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 8 ms to minimize.
[2024-05-22 01:29:03] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-22 01:29:03] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-22 01:29:03] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-22 01:29:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-22 01:29:03] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 0 ms to minimize.
[2024-05-22 01:29:03] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-22 01:29:04] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2024-05-22 01:29:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:29:04] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:29:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1024 ms
[2024-05-22 01:29:04] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:29:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-22 01:29:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:29:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-22 01:29:04] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-22 01:29:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-22 01:29:05] [INFO ] After 3192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 631 ms.
[2024-05-22 01:29:05] [INFO ] After 4156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1850 ms.
Support contains 16 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 435 transition count 369
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 422 transition count 369
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 422 transition count 357
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 410 transition count 357
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 405 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 405 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 405 transition count 347
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 403 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 71 place count 403 transition count 345
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 402 transition count 345
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 400 transition count 343
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 400 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 79 place count 400 transition count 341
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 5 with 146 rules applied. Total rules applied 225 place count 327 transition count 268
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 5 with 4 rules applied. Total rules applied 229 place count 325 transition count 270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 325 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 324 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 323 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 322 transition count 268
Applied a total of 233 rules in 194 ms. Remains 322 /441 variables (removed 119) and now considering 268/387 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 322/441 places, 268/387 transitions.
Incomplete random walk after 10000 steps, including 402 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 624065 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 624065 steps, saw 95598 distinct states, run finished after 3002 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 268 rows 322 cols
[2024-05-22 01:29:11] [INFO ] Computed 60 invariants in 19 ms
[2024-05-22 01:29:11] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:29:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 01:29:12] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-22 01:29:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:29:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 165 ms returned sat
[2024-05-22 01:29:12] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-22 01:29:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:29:13] [INFO ] After 357ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-22 01:29:13] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-22 01:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-22 01:29:13] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 01:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-22 01:29:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-22 01:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-22 01:29:14] [INFO ] After 1059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 344 ms.
[2024-05-22 01:29:14] [INFO ] After 2322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 610 ms.
Support contains 16 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 268/268 transitions.
Applied a total of 0 rules in 15 ms. Remains 322 /322 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 322/322 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 268/268 transitions.
Applied a total of 0 rules in 10 ms. Remains 322 /322 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-22 01:29:14] [INFO ] Invariant cache hit.
[2024-05-22 01:29:15] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 01:29:15] [INFO ] Invariant cache hit.
[2024-05-22 01:29:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:29:15] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-22 01:29:15] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-22 01:29:15] [INFO ] Invariant cache hit.
[2024-05-22 01:29:15] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 322/322 places, 268/268 transitions.
Applied a total of 0 rules in 9 ms. Remains 322 /322 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Running SMT prover for 14 properties.
[2024-05-22 01:29:15] [INFO ] Invariant cache hit.
[2024-05-22 01:29:15] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-22 01:29:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:29:15] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-22 01:29:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:29:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2024-05-22 01:29:16] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-22 01:29:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-22 01:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-22 01:29:17] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-22 01:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-22 01:29:17] [INFO ] After 1152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 353 ms.
[2024-05-22 01:29:17] [INFO ] After 1791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.22 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(G(p0))))))'
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 26 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 01:29:17] [INFO ] Computed 62 invariants in 17 ms
[2024-05-22 01:29:18] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 01:29:18] [INFO ] Invariant cache hit.
[2024-05-22 01:29:18] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-22 01:29:18] [INFO ] Invariant cache hit.
[2024-05-22 01:29:18] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 878 ms. Remains : 433/441 places, 373/387 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 322 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-00 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA DES-PT-50b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-00 finished in 1255 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(p0)||p1))) U p0))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 24 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
[2024-05-22 01:29:19] [INFO ] Invariant cache hit.
[2024-05-22 01:29:19] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:29:19] [INFO ] Invariant cache hit.
[2024-05-22 01:29:19] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-22 01:29:19] [INFO ] Invariant cache hit.
[2024-05-22 01:29:20] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 433/441 places, 373/387 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : DES-PT-50b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s282 1)), p1:(AND (EQ s44 1) (EQ s289 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-01 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((X(G(p1)) U p2)||(p0 U p1))))'
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 438 transition count 384
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 438 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 438 transition count 382
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 436 transition count 380
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 436 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 436 transition count 378
Applied a total of 14 rules in 26 ms. Remains 436 /441 variables (removed 5) and now considering 378/387 (removed 9) transitions.
// Phase 1: matrix 378 rows 436 cols
[2024-05-22 01:29:20] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 01:29:20] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 01:29:20] [INFO ] Invariant cache hit.
[2024-05-22 01:29:20] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-22 01:29:20] [INFO ] Invariant cache hit.
[2024-05-22 01:29:21] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 436/441 places, 378/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 872 ms. Remains : 436/441 places, 378/387 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), true, (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s216 1), p2:(AND (EQ s170 1) (EQ s224 1)), p0:(AND (EQ s270 1) (EQ s276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-02 finished in 1029 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 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 434 transition count 372
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 423 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 25 place count 422 transition count 359
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 49 place count 410 transition count 359
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 406 transition count 355
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 406 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 406 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 405 transition count 352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 61 place count 405 transition count 351
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 63 place count 404 transition count 351
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 65 place count 402 transition count 349
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 402 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 402 transition count 347
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 6 with 152 rules applied. Total rules applied 221 place count 326 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 225 place count 324 transition count 276
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 324 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 322 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 321 transition count 270
Applied a total of 232 rules in 89 ms. Remains 321 /441 variables (removed 120) and now considering 270/387 (removed 117) transitions.
// Phase 1: matrix 270 rows 321 cols
[2024-05-22 01:29:21] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:29:21] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 01:29:21] [INFO ] Invariant cache hit.
[2024-05-22 01:29:21] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-22 01:29:21] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-22 01:29:21] [INFO ] Invariant cache hit.
[2024-05-22 01:29:22] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/441 places, 270/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 730 ms. Remains : 321/441 places, 270/387 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-03 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 (NEQ s274 1) (OR (NEQ s206 1) (NEQ s230 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]]
Product exploration explored 100000 steps with 5662 reset in 291 ms.
Product exploration explored 100000 steps with 5671 reset in 278 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 65 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 270/270 transitions.
Applied a total of 0 rules in 17 ms. Remains 321 /321 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-22 01:29:23] [INFO ] Invariant cache hit.
[2024-05-22 01:29:23] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 01:29:23] [INFO ] Invariant cache hit.
[2024-05-22 01:29:23] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-05-22 01:29:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:29:23] [INFO ] Invariant cache hit.
[2024-05-22 01:29:23] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 321/321 places, 270/270 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5637 reset in 216 ms.
Product exploration explored 100000 steps with 5619 reset in 240 ms.
Built C files in :
/tmp/ltsmin10155354311325389178
[2024-05-22 01:29:24] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-22 01:29:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:29:24] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-22 01:29:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:29:24] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-22 01:29:24] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:29:24] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10155354311325389178
Running compilation step : cd /tmp/ltsmin10155354311325389178;'/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 657 ms.
Running link step : cd /tmp/ltsmin10155354311325389178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10155354311325389178;'/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/stateBased1195781796512482485.hoa' '--buchi-type=spotba'
LTSmin run took 5406 ms.
FORMULA DES-PT-50b-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLFireability-03 finished in 9552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U X(p2))))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 437 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 437 transition count 383
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 437 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 435 transition count 378
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 435 transition count 376
Applied a total of 17 rules in 21 ms. Remains 435 /441 variables (removed 6) and now considering 376/387 (removed 11) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 01:29:30] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 01:29:31] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 01:29:31] [INFO ] Invariant cache hit.
[2024-05-22 01:29:31] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-22 01:29:31] [INFO ] Invariant cache hit.
[2024-05-22 01:29:31] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/441 places, 376/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 435/441 places, 376/387 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s36 1) (EQ s291 1)), p0:(AND (NEQ s234 1) (EQ s221 1)), p2:(AND (EQ s184 1) (EQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-05 finished in 1098 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 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 422 transition count 359
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 410 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 405 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 405 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 405 transition count 349
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 403 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 403 transition count 347
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 69 place count 402 transition count 347
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 400 transition count 345
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 400 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 400 transition count 343
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 5 with 152 rules applied. Total rules applied 227 place count 324 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 322 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 320 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 319 transition count 267
Applied a total of 234 rules in 65 ms. Remains 319 /441 variables (removed 122) and now considering 267/387 (removed 120) transitions.
// Phase 1: matrix 267 rows 319 cols
[2024-05-22 01:29:32] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 01:29:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 01:29:32] [INFO ] Invariant cache hit.
[2024-05-22 01:29:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 01:29:32] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-22 01:29:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:29:32] [INFO ] Invariant cache hit.
[2024-05-22 01:29:32] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 319/441 places, 267/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 708 ms. Remains : 319/441 places, 267/387 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-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 s171 1) (EQ s204 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 16 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-06 finished in 793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 422 transition count 358
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 409 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 404 transition count 353
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 404 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 404 transition count 348
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 402 transition count 347
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 402 transition count 346
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 401 transition count 346
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 399 transition count 344
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 399 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 399 transition count 342
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 5 with 152 rules applied. Total rules applied 229 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 318 transition count 266
Applied a total of 236 rules in 61 ms. Remains 318 /441 variables (removed 123) and now considering 266/387 (removed 121) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:29:32] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:29:32] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 01:29:32] [INFO ] Invariant cache hit.
[2024-05-22 01:29:33] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-22 01:29:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:29:33] [INFO ] Invariant cache hit.
[2024-05-22 01:29:33] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/441 places, 266/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 681 ms. Remains : 318/441 places, 266/387 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s313 0)), p1:(OR (EQ s66 0) (EQ s313 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5212 reset in 294 ms.
Product exploration explored 100000 steps with 5170 reset in 290 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 180 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 513 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 968608 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968608 steps, saw 135292 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 01:29:37] [INFO ] Invariant cache hit.
[2024-05-22 01:29:37] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:29:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:29:37] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 108 ms returned sat
[2024-05-22 01:29:38] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-22 01:29:38] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-22 01:29:38] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
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 317 transition count 264
Applied a total of 4 rules in 20 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 495 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1034628 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1034628 steps, saw 145073 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:29:41] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 01:29:41] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:29:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:29:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 118 ms returned sat
[2024-05-22 01:29:42] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:29:42] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-22 01:29:42] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 151 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 23 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 01:29:42] [INFO ] Invariant cache hit.
[2024-05-22 01:29:42] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 01:29:42] [INFO ] Invariant cache hit.
[2024-05-22 01:29:42] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-22 01:29:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:29:42] [INFO ] Invariant cache hit.
[2024-05-22 01:29:43] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 11 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:29:43] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 01:29:43] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:29:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:29:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 119 ms returned sat
[2024-05-22 01:29:43] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:29:43] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-22 01:29:43] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 227 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLFireability-08 finished in 11316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 422 transition count 358
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 409 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 404 transition count 353
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 404 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 404 transition count 348
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 402 transition count 347
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 402 transition count 346
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 401 transition count 346
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 399 transition count 344
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 399 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 399 transition count 342
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 225 place count 325 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 323 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 321 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 320 transition count 268
Applied a total of 232 rules in 54 ms. Remains 320 /441 variables (removed 121) and now considering 268/387 (removed 119) transitions.
// Phase 1: matrix 268 rows 320 cols
[2024-05-22 01:29:44] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 01:29:44] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 01:29:44] [INFO ] Invariant cache hit.
[2024-05-22 01:29:44] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-22 01:29:44] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:29:44] [INFO ] Invariant cache hit.
[2024-05-22 01:29:44] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/441 places, 268/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 684 ms. Remains : 320/441 places, 268/387 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s98 1) (EQ s315 1)), p1:(EQ s241 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6909 reset in 232 ms.
Product exploration explored 100000 steps with 6924 reset in 251 ms.
Computed a total of 217 stabilizing places and 212 stable transitions
Computed a total of 217 stabilizing places and 212 stable transitions
Detected a total of 217/320 stabilizing places and 212/268 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1212 steps, including 57 resets, run visited all 2 properties in 6 ms. (steps per millisecond=202 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 268/268 transitions.
Applied a total of 0 rules in 8 ms. Remains 320 /320 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-22 01:29:46] [INFO ] Invariant cache hit.
[2024-05-22 01:29:46] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 01:29:46] [INFO ] Invariant cache hit.
[2024-05-22 01:29:46] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-22 01:29:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:29:46] [INFO ] Invariant cache hit.
[2024-05-22 01:29:46] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 639 ms. Remains : 320/320 places, 268/268 transitions.
Computed a total of 217 stabilizing places and 212 stable transitions
Computed a total of 217 stabilizing places and 212 stable transitions
Detected a total of 217/320 stabilizing places and 212/268 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 395 steps, including 18 resets, run visited all 2 properties in 3 ms. (steps per millisecond=131 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6872 reset in 234 ms.
Product exploration explored 100000 steps with 6893 reset in 249 ms.
Built C files in :
/tmp/ltsmin15827502711594598056
[2024-05-22 01:29:47] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-05-22 01:29:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:29:47] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-05-22 01:29:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:29:47] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-05-22 01:29:47] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:29:47] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15827502711594598056
Running compilation step : cd /tmp/ltsmin15827502711594598056;'/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 551 ms.
Running link step : cd /tmp/ltsmin15827502711594598056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15827502711594598056;'/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/stateBased11149967727479912143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 268/268 transitions.
Applied a total of 0 rules in 12 ms. Remains 320 /320 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-22 01:30:03] [INFO ] Invariant cache hit.
[2024-05-22 01:30:03] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 01:30:03] [INFO ] Invariant cache hit.
[2024-05-22 01:30:03] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-05-22 01:30:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:30:03] [INFO ] Invariant cache hit.
[2024-05-22 01:30:03] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 636 ms. Remains : 320/320 places, 268/268 transitions.
Built C files in :
/tmp/ltsmin14128453613340453771
[2024-05-22 01:30:03] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-05-22 01:30:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:30:03] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-05-22 01:30:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:30:03] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-05-22 01:30:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:30:03] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14128453613340453771
Running compilation step : cd /tmp/ltsmin14128453613340453771;'/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 544 ms.
Running link step : cd /tmp/ltsmin14128453613340453771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14128453613340453771;'/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/stateBased10467983254248603064.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:30:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 01:30:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 01:30:18] [INFO ] Time to serialize gal into /tmp/LTL1378613018847611333.gal : 5 ms
[2024-05-22 01:30:18] [INFO ] Time to serialize properties into /tmp/LTL9356130854923405438.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/LTL1378613018847611333.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5723366904481704124.hoa' '-atoms' '/tmp/LTL9356130854923405438.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9356130854923405438.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5723366904481704124.hoa
Detected timeout of ITS tools.
[2024-05-22 01:30:34] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:30:34] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:30:34] [INFO ] Time to serialize gal into /tmp/LTL11788219250704001233.gal : 3 ms
[2024-05-22 01:30:34] [INFO ] Time to serialize properties into /tmp/LTL484798607801851082.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/LTL11788219250704001233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL484798607801851082.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("((p105==1)&&(p471==1))"))||(G(F("(p346==0)"))))))
Formula 0 simplified : G(F!"((p105==1)&&(p471==1))" & FG!"(p346==0)")
Detected timeout of ITS tools.
[2024-05-22 01:30:49] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:30:49] [INFO ] Applying decomposition
[2024-05-22 01:30:49] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10563239790133797612.txt' '-o' '/tmp/graph10563239790133797612.bin' '-w' '/tmp/graph10563239790133797612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10563239790133797612.bin' '-l' '-1' '-v' '-w' '/tmp/graph10563239790133797612.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:30:49] [INFO ] Decomposing Gal with order
[2024-05-22 01:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:30:49] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 01:30:49] [INFO ] Flatten gal took : 46 ms
[2024-05-22 01:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2024-05-22 01:30:49] [INFO ] Time to serialize gal into /tmp/LTL7860453508400552831.gal : 4 ms
[2024-05-22 01:30:49] [INFO ] Time to serialize properties into /tmp/LTL4633286562156704215.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/LTL7860453508400552831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4633286562156704215.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("((u45.p105==1)&&(u45.p471==1))"))||(G(F("(i12.i1.u13.p346==0)"))))))
Formula 0 simplified : G(F!"((u45.p105==1)&&(u45.p471==1))" & FG!"(i12.i1.u13.p346==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5722692935221464138
[2024-05-22 01:31:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5722692935221464138
Running compilation step : cd /tmp/ltsmin5722692935221464138;'/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 436 ms.
Running link step : cd /tmp/ltsmin5722692935221464138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5722692935221464138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLFireability-09 finished in 95359 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 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 422 transition count 358
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 409 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 404 transition count 353
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 404 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 404 transition count 348
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 402 transition count 347
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 402 transition count 346
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 401 transition count 346
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 399 transition count 344
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 399 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 399 transition count 342
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 5 with 152 rules applied. Total rules applied 229 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 318 transition count 266
Applied a total of 236 rules in 50 ms. Remains 318 /441 variables (removed 123) and now considering 266/387 (removed 121) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:31:19] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:31:19] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 01:31:19] [INFO ] Invariant cache hit.
[2024-05-22 01:31:19] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-05-22 01:31:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 01:31:19] [INFO ] Invariant cache hit.
[2024-05-22 01:31:20] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/441 places, 266/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 697 ms. Remains : 318/441 places, 266/387 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-10 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 s59 1) (EQ s313 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 22 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-10 finished in 786 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 U p1)||(p2 U X(X(X((p2||G(p3))))))))))'
Support contains 5 out of 441 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 434 transition count 370
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 421 transition count 370
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 421 transition count 359
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 49 place count 410 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 406 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 406 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 406 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 405 transition count 352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 405 transition count 351
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 63 place count 404 transition count 351
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 402 transition count 349
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 402 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 402 transition count 347
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 211 place count 331 transition count 276
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 329 transition count 281
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 219 place count 329 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 327 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 326 transition count 275
Applied a total of 222 rules in 56 ms. Remains 326 /441 variables (removed 115) and now considering 275/387 (removed 112) transitions.
// Phase 1: matrix 275 rows 326 cols
[2024-05-22 01:31:20] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:31:20] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 01:31:20] [INFO ] Invariant cache hit.
[2024-05-22 01:31:20] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-22 01:31:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:31:20] [INFO ] Invariant cache hit.
[2024-05-22 01:31:20] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 326/441 places, 275/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 326/441 places, 275/387 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DES-PT-50b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s243 1) (EQ s247 1)), p2:(AND (EQ s206 1) (EQ s232 1)), p3:(EQ s215 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 36 steps with 1 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-11 finished in 877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(G(!p1)||(!p1&&F(p2)))))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 25 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 01:31:21] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 01:31:21] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 01:31:21] [INFO ] Invariant cache hit.
[2024-05-22 01:31:21] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-05-22 01:31:21] [INFO ] Invariant cache hit.
[2024-05-22 01:31:21] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 905 ms. Remains : 433/441 places, 373/387 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-50b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s36 1) (EQ s289 1)), p2:(AND (EQ s42 1) (EQ s289 1)), p0:(OR (EQ s31 0) (EQ s289 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 877 reset in 179 ms.
Product exploration explored 100000 steps with 893 reset in 192 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (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 10 factoid took 525 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 668038 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 668038 steps, saw 111577 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-22 01:31:26] [INFO ] Invariant cache hit.
[2024-05-22 01:31:26] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 01:31:26] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 31 ms returned sat
[2024-05-22 01:31:27] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 01:31:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 01:31:27] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 32 ms returned sat
[2024-05-22 01:31:27] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-22 01:31:27] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-22 01:31:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-22 01:31:27] [INFO ] After 606ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-22 01:31:27] [INFO ] After 929ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 262 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
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 410 transition count 340
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 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 39 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 317/433 places, 263/373 transitions.
Incomplete random walk after 10000 steps, including 503 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 895938 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 895938 steps, saw 125760 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 01:31:31] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 01:31:31] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:31:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-22 01:31:31] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:31:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:31:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2024-05-22 01:31:32] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:31:32] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-22 01:31:32] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-22 01:31:32] [INFO ] Invariant cache hit.
[2024-05-22 01:31:32] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 01:31:32] [INFO ] Invariant cache hit.
[2024-05-22 01:31:32] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-22 01:31:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:31:32] [INFO ] Invariant cache hit.
[2024-05-22 01:31:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 317/317 places, 263/263 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 317 transition count 263
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 01:31:33] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 01:31:33] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:31:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:31:33] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:31:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:31:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2024-05-22 01:31:33] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:31:33] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:31:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-22 01:31:33] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-22 01:31:33] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 691 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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
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 426 transition count 354
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 411 transition count 354
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 411 transition count 343
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 53 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 207 place count 323 transition count 266
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 211 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 318 transition count 266
Applied a total of 214 rules in 31 ms. Remains 318 /433 variables (removed 115) and now considering 266/373 (removed 107) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:31:34] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:31:35] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 01:31:35] [INFO ] Invariant cache hit.
[2024-05-22 01:31:35] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-22 01:31:35] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:31:35] [INFO ] Invariant cache hit.
[2024-05-22 01:31:35] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/433 places, 266/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 318/433 places, 266/373 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 715 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Incomplete random walk after 10000 steps, including 523 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 884467 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 884467 steps, saw 124187 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:31:39] [INFO ] Invariant cache hit.
[2024-05-22 01:31:39] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:31:39] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:31:39] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:31:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:31:40] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 41 ms returned sat
[2024-05-22 01:31:49] [INFO ] After 9521ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-22 01:31:55] [INFO ] After 15502ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 3334 ms.
[2024-05-22 01:31:58] [INFO ] After 18997ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
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 317 transition count 264
Applied a total of 4 rules in 15 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 511 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 927847 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 927847 steps, saw 129940 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:32:02] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 01:32:02] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:32:02] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 23 ms returned sat
[2024-05-22 01:32:02] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:32:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:32:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 92 ms returned sat
[2024-05-22 01:32:02] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:32:03] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-22 01:32:03] [INFO ] After 705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 01:32:03] [INFO ] Invariant cache hit.
[2024-05-22 01:32:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 01:32:03] [INFO ] Invariant cache hit.
[2024-05-22 01:32:03] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-22 01:32:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:32:03] [INFO ] Invariant cache hit.
[2024-05-22 01:32:03] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 576 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:32:03] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 01:32:03] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:32:03] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:32:03] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:32:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:32:04] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 95 ms returned sat
[2024-05-22 01:32:04] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:32:04] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-22 01:32:04] [INFO ] After 690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 813 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Product exploration explored 100000 steps with 5494 reset in 282 ms.
Product exploration explored 100000 steps with 5436 reset in 229 ms.
Built C files in :
/tmp/ltsmin6183525490732101115
[2024-05-22 01:32:06] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 01:32:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:32:06] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 01:32:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:32:06] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 01:32:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:32:06] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6183525490732101115
Running compilation step : cd /tmp/ltsmin6183525490732101115;'/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 545 ms.
Running link step : cd /tmp/ltsmin6183525490732101115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6183525490732101115;'/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/stateBased16559590461245446653.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 10 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:32:21] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:32:21] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 01:32:21] [INFO ] Invariant cache hit.
[2024-05-22 01:32:22] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-22 01:32:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:32:22] [INFO ] Invariant cache hit.
[2024-05-22 01:32:22] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 626 ms. Remains : 318/318 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin16539499985397053167
[2024-05-22 01:32:22] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 01:32:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:32:22] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 01:32:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:32:22] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 01:32:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:32:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16539499985397053167
Running compilation step : cd /tmp/ltsmin16539499985397053167;'/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 530 ms.
Running link step : cd /tmp/ltsmin16539499985397053167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16539499985397053167;'/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/stateBased10832331090316648092.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:32:37] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:32:37] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:32:37] [INFO ] Time to serialize gal into /tmp/LTL4278667697084177112.gal : 2 ms
[2024-05-22 01:32:37] [INFO ] Time to serialize properties into /tmp/LTL7569270353259685079.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/LTL4278667697084177112.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12321623333073347125.hoa' '-atoms' '/tmp/LTL7569270353259685079.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/LTL7569270353259685079.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12321623333073347125.hoa
Detected timeout of ITS tools.
[2024-05-22 01:32:52] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:32:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:32:52] [INFO ] Time to serialize gal into /tmp/LTL10439391965859792150.gal : 2 ms
[2024-05-22 01:32:52] [INFO ] Time to serialize properties into /tmp/LTL14975087727561577163.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/LTL10439391965859792150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14975087727561577163.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((p32==0)||(p330==0))")))&&((G("((p37!=1)||(p330!=1))"))||((F("((p43==1)&&(p330==1))"))&&("((p37!=1)||(p330!=1))")))))))
Formula 0 simplified : X(GF!"((p32==0)||(p330==0))" | G(F!"((p37!=1)||(p330!=1))" & (!"((p37!=1)||(p330!=1))" | G!"((p43==1)&&(p330==1))")))
Detected timeout of ITS tools.
[2024-05-22 01:33:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:33:07] [INFO ] Applying decomposition
[2024-05-22 01:33:07] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14690971872252656198.txt' '-o' '/tmp/graph14690971872252656198.bin' '-w' '/tmp/graph14690971872252656198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14690971872252656198.bin' '-l' '-1' '-v' '-w' '/tmp/graph14690971872252656198.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:33:07] [INFO ] Decomposing Gal with order
[2024-05-22 01:33:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:33:07] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-22 01:33:07] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:33:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 01:33:07] [INFO ] Time to serialize gal into /tmp/LTL17456385340611848551.gal : 3 ms
[2024-05-22 01:33:07] [INFO ] Time to serialize properties into /tmp/LTL7072502306650240614.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/LTL17456385340611848551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7072502306650240614.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((u10.p32==0)||(u10.p330==0))")))&&((G("((u10.p37!=1)||(u10.p330!=1))"))||((F("((u10.p43==1)&&(u10.p330==1))"))&&("((u10....186
Formula 0 simplified : X(GF!"((u10.p32==0)||(u10.p330==0))" | G(F!"((u10.p37!=1)||(u10.p330!=1))" & (!"((u10.p37!=1)||(u10.p330!=1))" | G!"((u10.p43==1)&&(...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12502238264151116999
[2024-05-22 01:33:22] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12502238264151116999
Running compilation step : cd /tmp/ltsmin12502238264151116999;'/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 431 ms.
Running link step : cd /tmp/ltsmin12502238264151116999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12502238264151116999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((<>([]((LTLAPp0==true)))&&([]((LTLAPp1==true))||(<>((LTLAPp2==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLFireability-12 finished in 136630 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||X((!p1 U (p2||G(!p1))))))))'
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 26 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 01:33:37] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 01:33:37] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 01:33:37] [INFO ] Invariant cache hit.
[2024-05-22 01:33:38] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-05-22 01:33:38] [INFO ] Invariant cache hit.
[2024-05-22 01:33:38] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 888 ms. Remains : 433/441 places, 373/387 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s36 1) (EQ s289 1) (OR (EQ s30 0) (EQ s289 0))), p2:(AND (NOT (AND (EQ s36 1) (EQ s289 1))) (NOT (AND (EQ s30 1) (EQ s289 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 881 reset in 210 ms.
Product exploration explored 100000 steps with 881 reset in 227 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1015 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 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 14 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 15 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 13 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 687315 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 687315 steps, saw 115036 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-22 01:33:43] [INFO ] Invariant cache hit.
[2024-05-22 01:33:43] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:33:43] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 31 ms returned sat
[2024-05-22 01:33:43] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-05-22 01:33:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 01:33:43] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-22 01:33:44] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 01:33:44] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 126 ms.
[2024-05-22 01:33:44] [INFO ] After 726ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 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 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
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 410 transition count 340
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 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 45 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 317/433 places, 263/373 transitions.
Incomplete random walk after 10000 steps, including 511 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 895149 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 895149 steps, saw 125656 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 01:33:47] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:33:47] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:33:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:33:47] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:33:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:33:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2024-05-22 01:33:48] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:33:48] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-22 01:33:48] [INFO ] After 717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-22 01:33:48] [INFO ] After 1042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-22 01:33:49] [INFO ] Invariant cache hit.
[2024-05-22 01:33:49] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 01:33:49] [INFO ] Invariant cache hit.
[2024-05-22 01:33:49] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-22 01:33:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:33:49] [INFO ] Invariant cache hit.
[2024-05-22 01:33:49] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 317/317 places, 263/263 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 317 transition count 263
Applied a total of 1 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 01:33:49] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:33:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:33:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:33:49] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:33:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:33:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2024-05-22 01:33:50] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:33:50] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-22 01:33:50] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1293 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p2) p1)]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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
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 426 transition count 354
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 411 transition count 354
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 411 transition count 343
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 400 transition count 343
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 2 with 154 rules applied. Total rules applied 207 place count 323 transition count 266
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 211 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 318 transition count 266
Applied a total of 214 rules in 26 ms. Remains 318 /433 variables (removed 115) and now considering 266/373 (removed 107) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:33:51] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 01:33:52] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 01:33:52] [INFO ] Invariant cache hit.
[2024-05-22 01:33:52] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-22 01:33:52] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 01:33:52] [INFO ] Invariant cache hit.
[2024-05-22 01:33:52] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/433 places, 266/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 658 ms. Remains : 318/433 places, 266/373 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 552 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 989912 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989912 steps, saw 138681 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:33:55] [INFO ] Invariant cache hit.
[2024-05-22 01:33:55] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:33:55] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:33:55] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:33:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:33:56] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 55 ms returned sat
[2024-05-22 01:33:56] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:33:56] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 01:33:56] [INFO ] After 571ms 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 32 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
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 317 transition count 264
Applied a total of 4 rules in 14 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 526 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 996890 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 996890 steps, saw 139620 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:33:59] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 01:33:59] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:33:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 01:33:59] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:33:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:33:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2024-05-22 01:34:00] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:34:00] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-22 01:34:00] [INFO ] After 515ms 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 41 ms.
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 01:34:00] [INFO ] Invariant cache hit.
[2024-05-22 01:34:00] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 01:34:00] [INFO ] Invariant cache hit.
[2024-05-22 01:34:00] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-22 01:34:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:34:00] [INFO ] Invariant cache hit.
[2024-05-22 01:34:01] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:34:01] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 01:34:01] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:34:01] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:34:01] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:34:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:34:01] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 45 ms returned sat
[2024-05-22 01:34:01] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:34:01] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-22 01:34:01] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 42 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 38 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5328 reset in 205 ms.
Product exploration explored 100000 steps with 5446 reset in 229 ms.
Built C files in :
/tmp/ltsmin9093181960736883138
[2024-05-22 01:34:02] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 01:34:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:34:02] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 01:34:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:34:02] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 01:34:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:34:02] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9093181960736883138
Running compilation step : cd /tmp/ltsmin9093181960736883138;'/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 538 ms.
Running link step : cd /tmp/ltsmin9093181960736883138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9093181960736883138;'/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/stateBased17655979019289051875.hoa' '--buchi-type=spotba'
LTSmin run took 13414 ms.
FORMULA DES-PT-50b-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLFireability-13 finished in 38598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(G(!p1)||(!p1&&F(p2)))))))'
Found a Shortening insensitive property : DES-PT-50b-LTLFireability-12
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 434 transition count 370
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 421 transition count 370
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 421 transition count 359
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 49 place count 410 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 405 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 405 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 405 transition count 349
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 403 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 403 transition count 347
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 69 place count 402 transition count 347
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 400 transition count 345
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 400 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 229 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 318 transition count 266
Applied a total of 236 rules in 46 ms. Remains 318 /441 variables (removed 123) and now considering 266/387 (removed 121) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:34:16] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:34:16] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 01:34:16] [INFO ] Invariant cache hit.
[2024-05-22 01:34:17] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 01:34:17] [INFO ] Invariant cache hit.
[2024-05-22 01:34:17] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 318/441 places, 266/387 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 657 ms. Remains : 318/441 places, 266/387 transitions.
Running random walk in product with property : DES-PT-50b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s31 1) (EQ s231 1)), p2:(AND (EQ s37 1) (EQ s231 1)), p0:(OR (EQ s26 0) (EQ s231 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5403 reset in 216 ms.
Product exploration explored 100000 steps with 5418 reset in 230 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (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 10 factoid took 507 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 547 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 893905 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 893905 steps, saw 125293 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-22 01:34:22] [INFO ] Invariant cache hit.
[2024-05-22 01:34:22] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:34:22] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:34:22] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 01:34:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:22] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 112 ms returned sat
[2024-05-22 01:34:22] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-22 01:34:22] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-22 01:34:22] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
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 317 transition count 264
Applied a total of 4 rules in 15 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 491 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 912582 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 912582 steps, saw 127901 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:34:26] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 01:34:26] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:34:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:34:26] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:34:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 93 ms returned sat
[2024-05-22 01:34:26] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:34:26] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-22 01:34:26] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 83 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 01:34:27] [INFO ] Invariant cache hit.
[2024-05-22 01:34:27] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 01:34:27] [INFO ] Invariant cache hit.
[2024-05-22 01:34:27] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-22 01:34:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:34:27] [INFO ] Invariant cache hit.
[2024-05-22 01:34:27] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 595 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:34:27] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 01:34:27] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:34:27] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:34:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 97 ms returned sat
[2024-05-22 01:34:28] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:34:28] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-22 01:34:28] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 672 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 8 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:34:29] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:34:29] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 01:34:29] [INFO ] Invariant cache hit.
[2024-05-22 01:34:30] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-22 01:34:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:34:30] [INFO ] Invariant cache hit.
[2024-05-22 01:34:30] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 318/318 places, 266/266 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 688 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Incomplete random walk after 10000 steps, including 523 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 935814 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 935814 steps, saw 130927 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 01:34:34] [INFO ] Invariant cache hit.
[2024-05-22 01:34:34] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-22 01:34:34] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:34:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 41 ms returned sat
[2024-05-22 01:34:44] [INFO ] After 9574ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-22 01:34:50] [INFO ] After 15665ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 3377 ms.
[2024-05-22 01:34:53] [INFO ] After 19202ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
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 317 transition count 264
Applied a total of 4 rules in 14 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 898601 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 898601 steps, saw 125895 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:34:56] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 01:34:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:34:57] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:34:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 102 ms returned sat
[2024-05-22 01:34:57] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:34:57] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-22 01:34:57] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 01:34:57] [INFO ] Invariant cache hit.
[2024-05-22 01:34:57] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 01:34:57] [INFO ] Invariant cache hit.
[2024-05-22 01:34:58] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-22 01:34:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:34:58] [INFO ] Invariant cache hit.
[2024-05-22 01:34:58] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 01:34:58] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 01:34:58] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:34:58] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:34:58] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:34:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:34:58] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 93 ms returned sat
[2024-05-22 01:34:59] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:34:59] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-22 01:34:59] [INFO ] After 708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 811 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) p1), (NOT p0), p1, false, false]
Product exploration explored 100000 steps with 5352 reset in 207 ms.
Product exploration explored 100000 steps with 5377 reset in 228 ms.
Built C files in :
/tmp/ltsmin1651442890078788274
[2024-05-22 01:35:01] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 01:35:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:35:01] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 01:35:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:35:01] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 01:35:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:35:01] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1651442890078788274
Running compilation step : cd /tmp/ltsmin1651442890078788274;'/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 555 ms.
Running link step : cd /tmp/ltsmin1651442890078788274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1651442890078788274;'/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/stateBased12991673030541326826.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 11 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 01:35:16] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:35:16] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 01:35:16] [INFO ] Invariant cache hit.
[2024-05-22 01:35:16] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-22 01:35:16] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:35:16] [INFO ] Invariant cache hit.
[2024-05-22 01:35:16] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 634 ms. Remains : 318/318 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin4781770393252941283
[2024-05-22 01:35:16] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 01:35:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:35:16] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 01:35:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:35:16] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 01:35:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:35:16] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4781770393252941283
Running compilation step : cd /tmp/ltsmin4781770393252941283;'/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 550 ms.
Running link step : cd /tmp/ltsmin4781770393252941283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4781770393252941283;'/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/stateBased14497386158050075222.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:35:31] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:35:31] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:35:31] [INFO ] Time to serialize gal into /tmp/LTL5410607474267471262.gal : 2 ms
[2024-05-22 01:35:31] [INFO ] Time to serialize properties into /tmp/LTL4489715599069058575.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/LTL5410607474267471262.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3914927835984563852.hoa' '-atoms' '/tmp/LTL4489715599069058575.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((p32==0)||(p330==0))")))&&((G("((p37!=1)||(p330!=1))"))||((F("((p43==1)&&(p330==1))"))&&("((p37!=1)||(p330!=1))")))))))
Formula 0 simplified : X(GF!"((p32==0)||(p330==0))" | G(F!"((p37!=1)||(p330!=1))" & (!"((p37!=1)||(p330!=1))" | G!"((p43==1)&&(p330==1))")))
Detected timeout of ITS tools.
[2024-05-22 01:36:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:36:02] [INFO ] Applying decomposition
[2024-05-22 01:36:02] [INFO ] Flatten gal took : 9 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/graph12116337548779130061.txt' '-o' '/tmp/graph12116337548779130061.bin' '-w' '/tmp/graph12116337548779130061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12116337548779130061.bin' '-l' '-1' '-v' '-w' '/tmp/graph12116337548779130061.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:36:02] [INFO ] Decomposing Gal with order
[2024-05-22 01:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:36:02] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 01:36:02] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-22 01:36:02] [INFO ] Time to serialize gal into /tmp/LTL6555755060512496688.gal : 3 ms
[2024-05-22 01:36:02] [INFO ] Time to serialize properties into /tmp/LTL4584141118358399205.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/LTL6555755060512496688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4584141118358399205.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((u10.p32==0)||(u10.p330==0))")))&&((G("((u10.p37!=1)||(u10.p330!=1))"))||((F("((u10.p43==1)&&(u10.p330==1))"))&&("((u10....186
Formula 0 simplified : X(GF!"((u10.p32==0)||(u10.p330==0))" | G(F!"((u10.p37!=1)||(u10.p330!=1))" & (!"((u10.p37!=1)||(u10.p330!=1))" | G!"((u10.p43==1)&&(...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin405975707797911247
[2024-05-22 01:36:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin405975707797911247
Running compilation step : cd /tmp/ltsmin405975707797911247;'/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 438 ms.
Running link step : cd /tmp/ltsmin405975707797911247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin405975707797911247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((<>([]((LTLAPp0==true)))&&([]((LTLAPp1==true))||(<>((LTLAPp2==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLFireability-12 finished in 135867 ms.
[2024-05-22 01:36:32] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5853726806216831135
[2024-05-22 01:36:32] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-22 01:36:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:36:32] [INFO ] Applying decomposition
[2024-05-22 01:36:32] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-22 01:36:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:36:32] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:36:32] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2024-05-22 01:36:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:36:32] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5853726806216831135
Running compilation step : cd /tmp/ltsmin5853726806216831135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17011883181212237925.txt' '-o' '/tmp/graph17011883181212237925.bin' '-w' '/tmp/graph17011883181212237925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17011883181212237925.bin' '-l' '-1' '-v' '-w' '/tmp/graph17011883181212237925.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:36:32] [INFO ] Decomposing Gal with order
[2024-05-22 01:36:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:36:32] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 01:36:32] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2024-05-22 01:36:32] [INFO ] Time to serialize gal into /tmp/LTLFireability15280027349967338684.gal : 3 ms
[2024-05-22 01:36:32] [INFO ] Time to serialize properties into /tmp/LTLFireability5764889123660148256.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/LTLFireability15280027349967338684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5764889123660148256.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("((i9.u81.p105==1)&&(i9.u81.p471==1))"))||(G(F("(i8.u40.p346==0)"))))))
Formula 0 simplified : G(F!"((i9.u81.p105==1)&&(i9.u81.p471==1))" & FG!"(i8.u40.p346==0)")
Compilation finished in 796 ms.
Running link step : cd /tmp/ltsmin5853726806216831135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5853726806216831135;'/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' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t116, t124, t286, t347, t348, t380, u9.t237, u9.t238, u9.t239, u9.t240, u9.t241, u9.t242,...1206
Computing Next relation with stutter on 9.34119e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-22 01:59:03] [INFO ] Applying decomposition
[2024-05-22 01:59:03] [INFO ] Flatten gal took : 26 ms
[2024-05-22 01:59:03] [INFO ] Decomposing Gal with order
[2024-05-22 01:59:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:59:03] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 01:59:03] [INFO ] Flatten gal took : 82 ms
[2024-05-22 01:59:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 707 labels/synchronizations in 59 ms.
[2024-05-22 01:59:03] [INFO ] Time to serialize gal into /tmp/LTLFireability14723852723739301426.gal : 8 ms
[2024-05-22 01:59:04] [INFO ] Time to serialize properties into /tmp/LTLFireability3040342526653310190.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/LTLFireability14723852723739301426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3040342526653310190.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("((i0.i0.i0.u5.p105==1)&&(i1.i1.i1.u118.p471==1))"))||(G(F("(i1.i1.i0.i1.i0.i0.i1.i0.u142.p346==0)"))))))
Formula 0 simplified : G(F!"((i0.i0.i0.u5.p105==1)&&(i1.i1.i1.u118.p471==1))" & FG!"(i1.i1.i0.i1.i0.i0.i1.i0.u142.p346==0)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: Initializing POR dependencies: labels 392, guards 387
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.896: LTL layer: formula: <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 6/ 8), 1.896: "<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 1.896: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.068: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.084: There are 393 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.084: State length is 442, there are 393 groups
pins2lts-mc-linux64( 0/ 8), 2.084: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.084: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.084: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.084: Visible groups: 0 / 393, labels: 2 / 393
pins2lts-mc-linux64( 0/ 8), 2.084: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.084: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 2.098: [Blue] ~85 levels ~960 states ~1248 transitions
pins2lts-mc-linux64( 6/ 8), 2.121: [Blue] ~111 levels ~1920 states ~2400 transitions
pins2lts-mc-linux64( 4/ 8), 2.155: [Blue] ~101 levels ~3840 states ~4960 transitions
pins2lts-mc-linux64( 4/ 8), 2.230: [Blue] ~101 levels ~7680 states ~9504 transitions
pins2lts-mc-linux64( 4/ 8), 2.347: [Blue] ~101 levels ~15360 states ~19200 transitions
pins2lts-mc-linux64( 4/ 8), 2.563: [Blue] ~101 levels ~30720 states ~38424 transitions
pins2lts-mc-linux64( 4/ 8), 3.104: [Blue] ~101 levels ~61440 states ~84512 transitions
pins2lts-mc-linux64( 4/ 8), 3.975: [Blue] ~163 levels ~122880 states ~168040 transitions
pins2lts-mc-linux64( 7/ 8), 5.677: [Blue] ~133 levels ~245760 states ~311504 transitions
pins2lts-mc-linux64( 4/ 8), 8.728: [Blue] ~163 levels ~491520 states ~637176 transitions
pins2lts-mc-linux64( 4/ 8), 14.696: [Blue] ~163 levels ~983040 states ~1252440 transitions
pins2lts-mc-linux64( 4/ 8), 25.509: [Blue] ~163 levels ~1966080 states ~2629008 transitions
pins2lts-mc-linux64( 4/ 8), 47.154: [Blue] ~363 levels ~3932160 states ~5226552 transitions
pins2lts-mc-linux64( 4/ 8), 91.787: [Blue] ~532 levels ~7864320 states ~10224608 transitions
pins2lts-mc-linux64( 0/ 8), 180.241: [Blue] ~7981 levels ~15728640 states ~19076504 transitions
pins2lts-mc-linux64( 0/ 8), 354.013: [Blue] ~67672 levels ~31457280 states ~37108088 transitions
pins2lts-mc-linux64( 7/ 8), 716.398: [Blue] ~53872 levels ~62914560 states ~82482624 transitions
pins2lts-mc-linux64( 5/ 8), 1395.924: [Blue] ~2699 levels ~125829120 states ~143022448 transitions
pins2lts-mc-linux64( 2/ 8), 1751.502: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1751.524:
pins2lts-mc-linux64( 0/ 8), 1751.524: Explored 134845350 states 162415036 transitions, fanout: 1.204
pins2lts-mc-linux64( 0/ 8), 1751.524: Total exploration time 1749.430 sec (1749.400 sec minimum, 1749.414 sec on average)
pins2lts-mc-linux64( 0/ 8), 1751.524: States per second: 77080, Transitions per second: 92839
pins2lts-mc-linux64( 0/ 8), 1751.524:
pins2lts-mc-linux64( 0/ 8), 1751.524: State space has 134217261 states, 6288803 are accepting
pins2lts-mc-linux64( 0/ 8), 1751.524: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1751.524: blue states: 134845350 (100.47%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1751.524: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1751.524: all-red states: 7932347 (5.91%), bogus 2297 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1751.524:
pins2lts-mc-linux64( 0/ 8), 1751.524: Total memory used for local state coloring: 54.0MB
pins2lts-mc-linux64( 0/ 8), 1751.524:
pins2lts-mc-linux64( 0/ 8), 1751.524: Queue width: 8B, total height: 3541088, memory: 27.02MB
pins2lts-mc-linux64( 0/ 8), 1751.524: Tree memory: 1162.7MB, 9.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1751.524: Tree fill ratio (roots/leafs): 99.0%/54.0%
pins2lts-mc-linux64( 0/ 8), 1751.524: Stored 390 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1751.524: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1751.524: Est. total memory use: 1189.7MB (~1051.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5853726806216831135;'/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' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5853726806216831135;'/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' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 02:21:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:21:35] [INFO ] Input system was already deterministic with 387 transitions.
[2024-05-22 02:21:35] [INFO ] Transformed 441 places.
[2024-05-22 02:21:35] [INFO ] Transformed 387 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 02:21:35] [INFO ] Time to serialize gal into /tmp/LTLFireability4126049552685819511.gal : 4 ms
[2024-05-22 02:21:35] [INFO ] Time to serialize properties into /tmp/LTLFireability6770795965219644009.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4126049552685819511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6770795965219644009.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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p105==1)&&(p471==1))"))||(G(F("(p346==0)"))))))
Formula 0 simplified : G(F!"((p105==1)&&(p471==1))" & FG!"(p346==0)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10631672 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16038364 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50b"
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-50b, 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-171624208600463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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