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.r092-tall-171624189700644.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 itstools
Input is DES-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189700644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 08:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 08:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 08:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K 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-02b-LTLFireability-00
FORMULA_NAME DES-PT-02b-LTLFireability-01
FORMULA_NAME DES-PT-02b-LTLFireability-02
FORMULA_NAME DES-PT-02b-LTLFireability-03
FORMULA_NAME DES-PT-02b-LTLFireability-04
FORMULA_NAME DES-PT-02b-LTLFireability-05
FORMULA_NAME DES-PT-02b-LTLFireability-06
FORMULA_NAME DES-PT-02b-LTLFireability-07
FORMULA_NAME DES-PT-02b-LTLFireability-08
FORMULA_NAME DES-PT-02b-LTLFireability-09
FORMULA_NAME DES-PT-02b-LTLFireability-10
FORMULA_NAME DES-PT-02b-LTLFireability-11
FORMULA_NAME DES-PT-02b-LTLFireability-12
FORMULA_NAME DES-PT-02b-LTLFireability-13
FORMULA_NAME DES-PT-02b-LTLFireability-14
FORMULA_NAME DES-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716337999207

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:33:20] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-22 00:33:20] [INFO ] Transformed 288 places.
[2024-05-22 00:33:20] [INFO ] Transformed 239 transitions.
[2024-05-22 00:33:20] [INFO ] Found NUPN structural information;
[2024-05-22 00:33:20] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 45 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 265 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 265 transition count 219
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 254 transition count 208
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 254 transition count 208
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 74 place count 254 transition count 199
Applied a total of 74 rules in 63 ms. Remains 254 /288 variables (removed 34) and now considering 199/239 (removed 40) transitions.
// Phase 1: matrix 199 rows 254 cols
[2024-05-22 00:33:20] [INFO ] Computed 62 invariants in 23 ms
[2024-05-22 00:33:21] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-22 00:33:21] [INFO ] Invariant cache hit.
[2024-05-22 00:33:21] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 596 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 253/288 places, 199/239 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 686 ms. Remains : 253/288 places, 199/239 transitions.
Support contains 45 out of 253 places after structural reductions.
[2024-05-22 00:33:21] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:33:21] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:33:21] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 44 out of 253 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 37244 steps (329 resets) in 956 ms. (38 steps per ms) remains 0/35 properties
FORMULA DES-PT-02b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 66 stabilizing places and 59 stable transitions
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 245 transition count 179
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 231 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 231 transition count 168
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 51 place count 220 transition count 168
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 214 transition count 162
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 214 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 214 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 214 transition count 159
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 213 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 211 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 211 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 74 place count 211 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 210 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 76 place count 210 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 209 transition count 152
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 226 place count 135 transition count 78
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 230 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 130 transition count 78
Applied a total of 233 rules in 90 ms. Remains 130 /253 variables (removed 123) and now considering 78/199 (removed 121) transitions.
// Phase 1: matrix 78 rows 130 cols
[2024-05-22 00:33:22] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:33:22] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-22 00:33:22] [INFO ] Invariant cache hit.
[2024-05-22 00:33:22] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-22 00:33:22] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 00:33:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 78/207 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 189 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 3/129 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 78/207 variables, 129/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 264 constraints, problems are : Problem set: 0 solved, 74 unsolved in 6184 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
After SMT, in 8912ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 8919ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/253 places, 78/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9435 ms. Remains : 130/253 places, 78/199 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-00
Product exploration explored 100000 steps with 8107 reset in 301 ms.
Product exploration explored 100000 steps with 8126 reset in 257 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 179 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 168 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-22 00:33:33] [INFO ] Invariant cache hit.
[2024-05-22 00:33:33] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 00:33:33] [INFO ] Invariant cache hit.
[2024-05-22 00:33:33] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-22 00:33:33] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 00:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 78/207 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:33:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 189 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2336 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 3/129 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 78/207 variables, 129/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 264 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5848 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
After SMT, in 8218ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 8219ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8442 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 143 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 177 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8018 reset in 198 ms.
Product exploration explored 100000 steps with 8028 reset in 218 ms.
Built C files in :
/tmp/ltsmin9049999972794508250
[2024-05-22 00:33:42] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-22 00:33:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:33:42] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-22 00:33:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:33:42] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-22 00:33:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:33:42] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9049999972794508250
Running compilation step : cd /tmp/ltsmin9049999972794508250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 363 ms.
Running link step : cd /tmp/ltsmin9049999972794508250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9049999972794508250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16522018289619462662.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-22 00:33:57] [INFO ] Invariant cache hit.
[2024-05-22 00:33:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 00:33:57] [INFO ] Invariant cache hit.
[2024-05-22 00:33:58] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-22 00:33:58] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 00:33:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 78/207 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:33:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 189 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2267 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 3/129 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:34:00] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 78/207 variables, 129/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 264 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5972 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
After SMT, in 8257ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 8259ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8485 ms. Remains : 130/130 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin10353845805758929438
[2024-05-22 00:34:06] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-22 00:34:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:34:06] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-22 00:34:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:34:06] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-22 00:34:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:34:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10353845805758929438
Running compilation step : cd /tmp/ltsmin10353845805758929438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin10353845805758929438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10353845805758929438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9270275501334360961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:34:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:34:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:34:21] [INFO ] Time to serialize gal into /tmp/LTL13434599818256572300.gal : 3 ms
[2024-05-22 00:34:21] [INFO ] Time to serialize properties into /tmp/LTL7233977939053836777.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13434599818256572300.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3629889866072612839.hoa' '-atoms' '/tmp/LTL7233977939053836777.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7233977939053836777.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3629889866072612839.hoa
Detected timeout of ITS tools.
[2024-05-22 00:34:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:34:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:34:36] [INFO ] Time to serialize gal into /tmp/LTL17225811950480315929.gal : 2 ms
[2024-05-22 00:34:36] [INFO ] Time to serialize properties into /tmp/LTL4665159904718807065.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17225811950480315929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4665159904718807065.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p163==0)||(p277==1))"))))
Formula 0 simplified : FG!"((p163==0)||(p277==1))"
Detected timeout of ITS tools.
[2024-05-22 00:34:51] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:34:51] [INFO ] Applying decomposition
[2024-05-22 00:34:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15368040907881172421.txt' '-o' '/tmp/graph15368040907881172421.bin' '-w' '/tmp/graph15368040907881172421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15368040907881172421.bin' '-l' '-1' '-v' '-w' '/tmp/graph15368040907881172421.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:34:51] [INFO ] Decomposing Gal with order
[2024-05-22 00:34:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:34:51] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-22 00:34:51] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:34:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2024-05-22 00:34:51] [INFO ] Time to serialize gal into /tmp/LTL9663444797604420762.gal : 3 ms
[2024-05-22 00:34:51] [INFO ] Time to serialize properties into /tmp/LTL4080000483153920521.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9663444797604420762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4080000483153920521.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i5.i1.u13.p163==0)||(i12.u43.p277==1))"))))
Formula 0 simplified : FG!"((i5.i1.u13.p163==0)||(i12.u43.p277==1))"
Reverse transition relation is NOT exact ! Due to transitions t7_t48_t39, t9_t34, t10_t34, t157_t34, t156_t25, t111_t112_t129_t198_t134_t131_t127_t128, u44...403
Computing Next relation with stutter on 89695 deadlock states
130 unique states visited
0 strongly connected components in search stack
132 transitions explored
67 items max in DFS search stack
927 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.29617,396744,1,0,1.06246e+06,1716,1379,770139,524,7887,1739258
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-02b-LTLFireability-00 finished in 100914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
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 230 transition count 167
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 219 transition count 167
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 213 transition count 161
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 213 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 213 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 211 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 211 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 74 place count 211 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 210 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 76 place count 210 transition count 152
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 78 place count 209 transition count 152
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 226 place count 135 transition count 78
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 230 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 130 transition count 78
Applied a total of 233 rules in 57 ms. Remains 130 /253 variables (removed 123) and now considering 78/199 (removed 121) transitions.
// Phase 1: matrix 78 rows 130 cols
[2024-05-22 00:35:03] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:35:03] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 00:35:03] [INFO ] Invariant cache hit.
[2024-05-22 00:35:03] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-22 00:35:03] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 00:35:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 2/129 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 78/207 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 2/129 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 78/207 variables, 129/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:07] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:08] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 1/208 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/208 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 17 (OVERLAPS) 0/208 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 269 constraints, problems are : Problem set: 0 solved, 74 unsolved in 9467 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints]
After SMT, in 12165ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 12166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/253 places, 78/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12459 ms. Remains : 130/253 places, 78/199 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-01
Product exploration explored 100000 steps with 4996 reset in 273 ms.
Product exploration explored 100000 steps with 5036 reset in 226 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 225 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1611 steps (75 resets) in 16 ms. (94 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 347 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 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 13 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-22 00:35:17] [INFO ] Invariant cache hit.
[2024-05-22 00:35:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 00:35:17] [INFO ] Invariant cache hit.
[2024-05-22 00:35:17] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-22 00:35:17] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 00:35:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 2/129 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 78/207 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 2/129 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 78/207 variables, 129/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 1/208 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:35:26] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:35:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/208 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 17 (OVERLAPS) 0/208 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 269 constraints, problems are : Problem set: 0 solved, 74 unsolved in 9685 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints]
After SMT, in 12369ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 12370ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12599 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 271 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))]
RANDOM walk for 2853 steps (144 resets) in 23 ms. (118 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 354 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4978 reset in 204 ms.
Product exploration explored 100000 steps with 5009 reset in 224 ms.
Built C files in :
/tmp/ltsmin14415761884651259023
[2024-05-22 00:35:31] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-22 00:35:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:31] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-22 00:35:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:31] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-22 00:35:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14415761884651259023
Running compilation step : cd /tmp/ltsmin14415761884651259023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin14415761884651259023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14415761884651259023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15821812213396648303.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-22 00:35:46] [INFO ] Invariant cache hit.
[2024-05-22 00:35:46] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 00:35:46] [INFO ] Invariant cache hit.
[2024-05-22 00:35:46] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-22 00:35:46] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 00:35:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 2/129 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 78/207 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 6 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2708 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 2/129 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 78/207 variables, 129/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 1/208 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/208 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 17 (OVERLAPS) 0/208 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 269 constraints, problems are : Problem set: 0 solved, 74 unsolved in 9503 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints]
After SMT, in 12224ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 12226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12450 ms. Remains : 130/130 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin11019290010118528181
[2024-05-22 00:35:58] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-22 00:35:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:58] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-22 00:35:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:58] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-22 00:35:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11019290010118528181
Running compilation step : cd /tmp/ltsmin11019290010118528181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin11019290010118528181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11019290010118528181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10644309594359061098.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:36:13] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:36:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:36:13] [INFO ] Time to serialize gal into /tmp/LTL5665357877902186801.gal : 3 ms
[2024-05-22 00:36:13] [INFO ] Time to serialize properties into /tmp/LTL9997600851830976203.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5665357877902186801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11190792853692089838.hoa' '-atoms' '/tmp/LTL9997600851830976203.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9997600851830976203.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11190792853692089838.hoa
Detected timeout of ITS tools.
[2024-05-22 00:36:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:36:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:36:28] [INFO ] Time to serialize gal into /tmp/LTL11512148973190328168.gal : 1 ms
[2024-05-22 00:36:28] [INFO ] Time to serialize properties into /tmp/LTL3921901591477197600.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11512148973190328168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3921901591477197600.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p62==0)"))||("((p207==1)&&(p235==1))")))))
Formula 0 simplified : G(F!"(p62==0)" & FG!"((p207==1)&&(p235==1))")
Detected timeout of ITS tools.
[2024-05-22 00:36:44] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:36:44] [INFO ] Applying decomposition
[2024-05-22 00:36:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16685857381742884218.txt' '-o' '/tmp/graph16685857381742884218.bin' '-w' '/tmp/graph16685857381742884218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16685857381742884218.bin' '-l' '-1' '-v' '-w' '/tmp/graph16685857381742884218.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:36:44] [INFO ] Decomposing Gal with order
[2024-05-22 00:36:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:36:44] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-22 00:36:44] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:36:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2024-05-22 00:36:44] [INFO ] Time to serialize gal into /tmp/LTL13125469667186231791.gal : 2 ms
[2024-05-22 00:36:44] [INFO ] Time to serialize properties into /tmp/LTL2574067472579648146.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13125469667186231791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2574067472579648146.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(i0.u3.p62==0)"))||("((i6.u27.p207==1)&&(i6.u36.p235==1))")))))
Formula 0 simplified : G(F!"(i0.u3.p62==0)" & FG!"((i6.u27.p207==1)&&(i6.u36.p235==1))")
Reverse transition relation is NOT exact ! Due to transitions t52_t54_t56_t58_t60_t62, t7_t48_t39, t9_t34, t10_t34, t156_t25, t111_t112_t129_t198_t134_t131...454
Computing Next relation with stutter on 89695 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-02b-LTLFireability-01 finished in 115798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p1||G(!p0)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 246 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 246 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 246 transition count 190
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 243 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 243 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 243 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 242 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 242 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 242 transition count 183
Applied a total of 27 rules in 13 ms. Remains 242 /253 variables (removed 11) and now considering 183/199 (removed 16) transitions.
// Phase 1: matrix 183 rows 242 cols
[2024-05-22 00:36:59] [INFO ] Computed 61 invariants in 8 ms
[2024-05-22 00:36:59] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 00:36:59] [INFO ] Invariant cache hit.
[2024-05-22 00:36:59] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-22 00:36:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/425 variables, 242/318 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:10] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:37:10] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:37:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 0/425 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 343 constraints, problems are : Problem set: 0 solved, 182 unsolved in 15626 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/425 variables, 242/345 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 182/527 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:20] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:37:20] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:37:21] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:37:21] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:37:21] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:37:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:37:32] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 536 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 51/51 constraints]
After SMT, in 45664ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 45666ms
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 183/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45949 ms. Remains : 242/253 places, 183/199 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : DES-PT-02b-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 432 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-02b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLFireability-02 finished in 46332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 230 transition count 168
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 220 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 215 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 215 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 215 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 213 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 213 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 69 place count 213 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 71 place count 212 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 71 place count 212 transition count 155
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 73 place count 211 transition count 155
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 219 place count 138 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 225 place count 135 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 133 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 132 transition count 83
Applied a total of 228 rules in 33 ms. Remains 132 /253 variables (removed 121) and now considering 83/199 (removed 116) transitions.
// Phase 1: matrix 83 rows 132 cols
[2024-05-22 00:37:45] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:37:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 00:37:45] [INFO ] Invariant cache hit.
[2024-05-22 00:37:45] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-22 00:37:45] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-22 00:37:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 2/131 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 83/214 variables, 131/189 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-22 00:37:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 1/215 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 191 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2690 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 2/131 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 83/214 variables, 131/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 79/269 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 1/215 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 270 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5729 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
After SMT, in 8432ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 8434ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/253 places, 83/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8675 ms. Remains : 132/253 places, 83/199 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-03
Product exploration explored 100000 steps with 5753 reset in 207 ms.
Product exploration explored 100000 steps with 5704 reset in 224 ms.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2169 steps (107 resets) in 27 ms. (77 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 192 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-22 00:37:55] [INFO ] Invariant cache hit.
[2024-05-22 00:37:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 00:37:55] [INFO ] Invariant cache hit.
[2024-05-22 00:37:55] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-22 00:37:55] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-22 00:37:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 2/131 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 83/214 variables, 131/189 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 1/215 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 191 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2715 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 2/131 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 83/214 variables, 131/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 79/269 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 1/215 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 270 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5649 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
After SMT, in 8378ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 8379ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8575 ms. Remains : 132/132 places, 83/83 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1392 steps (68 resets) in 10 ms. (126 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 276 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5639 reset in 210 ms.
Product exploration explored 100000 steps with 5598 reset in 220 ms.
Built C files in :
/tmp/ltsmin8685236958689440730
[2024-05-22 00:38:04] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-22 00:38:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:04] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-22 00:38:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:04] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-22 00:38:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8685236958689440730
Running compilation step : cd /tmp/ltsmin8685236958689440730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin8685236958689440730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8685236958689440730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2210998879363868187.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-22 00:38:20] [INFO ] Invariant cache hit.
[2024-05-22 00:38:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 00:38:20] [INFO ] Invariant cache hit.
[2024-05-22 00:38:20] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-22 00:38:20] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-22 00:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 2/131 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 83/214 variables, 131/189 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 1/215 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 191 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2674 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 2/131 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 83/214 variables, 131/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 79/269 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 1/215 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 270 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5511 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
After SMT, in 8203ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 8204ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8402 ms. Remains : 132/132 places, 83/83 transitions.
Built C files in :
/tmp/ltsmin7693478050225065857
[2024-05-22 00:38:28] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-22 00:38:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:28] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-22 00:38:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:28] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-22 00:38:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7693478050225065857
Running compilation step : cd /tmp/ltsmin7693478050225065857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin7693478050225065857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7693478050225065857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9030878781579211507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:38:43] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:38:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:38:43] [INFO ] Time to serialize gal into /tmp/LTL19690146176442125.gal : 1 ms
[2024-05-22 00:38:43] [INFO ] Time to serialize properties into /tmp/LTL11487795873026600752.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL19690146176442125.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8048404441670676870.hoa' '-atoms' '/tmp/LTL11487795873026600752.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL11487795873026600752.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8048404441670676870.hoa
Detected timeout of ITS tools.
[2024-05-22 00:38:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:38:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:38:58] [INFO ] Time to serialize gal into /tmp/LTL16012359217843553647.gal : 1 ms
[2024-05-22 00:38:58] [INFO ] Time to serialize properties into /tmp/LTL10060420346191272028.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16012359217843553647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10060420346191272028.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p57!=1)||(p246!=1))")||((G("(p244==1)"))||("((p7==1)&&(p139==1))"))))))
Formula 0 simplified : G(F!"(p244==1)" & FG(!"((p7==1)&&(p139==1))" & !"((p57!=1)||(p246!=1))"))
Detected timeout of ITS tools.
[2024-05-22 00:39:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:39:13] [INFO ] Applying decomposition
[2024-05-22 00:39:13] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph2312648164005487651.txt' '-o' '/tmp/graph2312648164005487651.bin' '-w' '/tmp/graph2312648164005487651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2312648164005487651.bin' '-l' '-1' '-v' '-w' '/tmp/graph2312648164005487651.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:39:13] [INFO ] Decomposing Gal with order
[2024-05-22 00:39:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:39:13] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-22 00:39:13] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2024-05-22 00:39:13] [INFO ] Time to serialize gal into /tmp/LTL18171028244211026285.gal : 3 ms
[2024-05-22 00:39:13] [INFO ] Time to serialize properties into /tmp/LTL3691445305373556857.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18171028244211026285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3691445305373556857.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u3.p57!=1)||(u3.p246!=1))")||((G("(i13.u39.p244==1)"))||("((u10.p7==1)&&(u10.p139==1))"))))))
Formula 0 simplified : G(F!"(i13.u39.p244==1)" & FG(!"((u3.p57!=1)||(u3.p246!=1))" & !"((u10.p7==1)&&(u10.p139==1))"))
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t157, t7_t48_t39, t26_t35_t73_t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t52_t54_t5...493
Computing Next relation with stutter on 144064 deadlock states
91 unique states visited
0 strongly connected components in search stack
124 transitions explored
63 items max in DFS search stack
234 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.36266,123596,1,0,303020,2390,1614,249172,654,10368,428230
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DES-PT-02b-LTLFireability-03 finished in 91176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p0&&F((G(p1)&&F(p2)))))) U G(p0))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 243 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 243 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 243 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 242 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 242 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 242 transition count 184
Applied a total of 26 rules in 19 ms. Remains 242 /253 variables (removed 11) and now considering 184/199 (removed 15) transitions.
// Phase 1: matrix 184 rows 242 cols
[2024-05-22 00:39:16] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:39:16] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 00:39:16] [INFO ] Invariant cache hit.
[2024-05-22 00:39:16] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-22 00:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 184/426 variables, 242/337 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 11/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/426 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 364 constraints, problems are : Problem set: 0 solved, 183 unsolved in 25896 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 184/426 variables, 242/364 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 183/547 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 548 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 62/62 constraints]
After SMT, in 55935ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 55937ms
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 184/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56224 ms. Remains : 242/253 places, 184/199 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-05
Product exploration explored 100000 steps with 24972 reset in 84 ms.
Product exploration explored 100000 steps with 25042 reset in 91 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 434 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (361 resets) in 230 ms. (173 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (55 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 37899 steps (53 resets) in 68 ms. (549 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1), (F p0), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F p2)]
Knowledge based reduction with 8 factoid took 252 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 178 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2024-05-22 00:40:14] [INFO ] Invariant cache hit.
[2024-05-22 00:40:14] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 00:40:14] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 47 ms returned sat
[2024-05-22 00:40:14] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-22 00:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:40:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 00:40:15] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-22 00:40:15] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2024-05-22 00:40:15] [INFO ] Computed and/alt/rep : 182/310/182 causal constraints (skipped 1 transitions) in 9 ms.
[2024-05-22 00:40:16] [INFO ] Added : 164 causal constraints over 33 iterations in 1110 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 184/184 transitions.
Graph (complete) has 434 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 236 transition count 168
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 224 transition count 168
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 224 transition count 156
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 212 transition count 156
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 199 place count 137 transition count 81
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 203 place count 135 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 135 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 133 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 132 transition count 81
Applied a total of 207 rules in 19 ms. Remains 132 /242 variables (removed 110) and now considering 81/184 (removed 103) transitions.
// Phase 1: matrix 81 rows 132 cols
[2024-05-22 00:40:16] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:40:16] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 00:40:16] [INFO ] Invariant cache hit.
[2024-05-22 00:40:16] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-22 00:40:16] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-22 00:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 3/131 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/212 variables, 131/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/213 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-22 00:40:18] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/213 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 191 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2601 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 3/131 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-22 00:40:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 81/212 variables, 131/191 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 77/268 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-22 00:40:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:40:22] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 271 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6964 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
After SMT, in 9579ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9581ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/242 places, 81/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9781 ms. Remains : 132/242 places, 81/184 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 123 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 206 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
RANDOM walk for 30356 steps (1538 resets) in 370 ms. (81 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1), (F p0), (F p2), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 14 factoid took 341 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 :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2024-05-22 00:40:27] [INFO ] Invariant cache hit.
[2024-05-22 00:40:27] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:40:27] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 00:40:27] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-22 00:40:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:40:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:40:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 00:40:27] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 00:40:27] [INFO ] Computed and/alt/rep : 77/205/77 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 00:40:28] [INFO ] Added : 65 causal constraints over 13 iterations in 136 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering criterion allowed to conclude after 27283 steps with 9007 reset in 46 ms.
FORMULA DES-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-05 finished in 71691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||G(p2)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 9 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-22 00:40:28] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:40:28] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-22 00:40:28] [INFO ] Invariant cache hit.
[2024-05-22 00:40:28] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:40:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:30] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:40:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:40:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:40:32] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:40:32] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:32] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:40:32] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:40:32] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:34] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:40:34] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:40:34] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:40:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:40:34] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:40:35] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:40:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:40:35] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:40:37] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:38] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:40:38] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:40:39] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:40] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:40:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:40:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:40:40] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:40:40] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:40:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:40:42] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:40:43] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:40:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:44] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:40:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:40:44] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:40:44] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:40:44] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:45] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:40:46] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:40:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:47] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:40:48] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:40:48] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24249 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:54] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:40:54] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:40:55] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:56] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:40:57] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54295ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54297ms
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54593 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-02b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-06 finished in 54787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p1)&&(F(p3)||p2)))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 11 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
[2024-05-22 00:41:23] [INFO ] Invariant cache hit.
[2024-05-22 00:41:23] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 00:41:23] [INFO ] Invariant cache hit.
[2024-05-22 00:41:23] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:41:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:41:25] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:41:32] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:41:33] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 4 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:41:41] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:43] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:41:43] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:41:43] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24752 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:41:49] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:41:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54784ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54786ms
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55090 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-02b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/241 stabilizing places and 57/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-02b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLFireability-07 finished in 55509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&X((G(p1) U p2))))))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 246 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 246 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 246 transition count 190
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 243 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 243 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 243 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 242 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 242 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 242 transition count 183
Applied a total of 27 rules in 15 ms. Remains 242 /253 variables (removed 11) and now considering 183/199 (removed 16) transitions.
// Phase 1: matrix 183 rows 242 cols
[2024-05-22 00:42:18] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:42:18] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 00:42:18] [INFO ] Invariant cache hit.
[2024-05-22 00:42:18] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-22 00:42:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:21] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:42:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:42:21] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:21] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:42:21] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:42:21] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:42:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:42:22] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:42:22] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-22 00:42:22] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:42:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:24] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:42:25] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:42:26] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 183/425 variables, 242/339 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:28] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:42:28] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:42:28] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:42:28] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:42:28] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 13/352 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/425 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 360 constraints, problems are : Problem set: 0 solved, 182 unsolved in 20170 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 57/118 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:40] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:42:40] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/425 variables, 242/362 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 182/544 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:42:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:42:44] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:42:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 4/548 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:42:58] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:42:58] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 8/556 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 556 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 71/71 constraints]
After SMT, in 50199ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 50201ms
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 183/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50512 ms. Remains : 242/253 places, 183/199 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-08 finished in 50781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 11 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-22 00:43:09] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:43:09] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 00:43:09] [INFO ] Invariant cache hit.
[2024-05-22 00:43:09] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:43:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:15] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:43:15] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:43:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:43:15] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:18] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:43:22] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:27] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:43:27] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:43:27] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:29] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:43:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:43:29] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24253 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54290ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54292ms
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54569 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-09
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-09 finished in 54701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 230 transition count 168
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 220 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 215 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 215 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 215 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 215 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 214 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 213 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 213 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 213 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 213 transition count 157
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 70 place count 212 transition count 157
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 228 place count 133 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 133 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 233 place count 131 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 129 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 128 transition count 80
Applied a total of 236 rules in 39 ms. Remains 128 /253 variables (removed 125) and now considering 80/199 (removed 119) transitions.
// Phase 1: matrix 80 rows 128 cols
[2024-05-22 00:44:04] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:44:04] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 00:44:04] [INFO ] Invariant cache hit.
[2024-05-22 00:44:04] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-22 00:44:04] [INFO ] Redundant transitions in 0 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-22 00:44:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/127 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 80/207 variables, 127/185 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/208 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-22 00:44:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-22 00:44:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 188 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3060 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 2/127 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 80/207 variables, 127/187 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 77/264 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/208 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 265 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5363 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
After SMT, in 8437ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 8438ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/253 places, 80/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8699 ms. Remains : 128/253 places, 80/199 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-10
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-10 finished in 8746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Applied a total of 26 rules in 12 ms. Remains 242 /253 variables (removed 11) and now considering 184/199 (removed 15) transitions.
// Phase 1: matrix 184 rows 242 cols
[2024-05-22 00:44:12] [INFO ] Computed 61 invariants in 1 ms
[2024-05-22 00:44:12] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 00:44:12] [INFO ] Invariant cache hit.
[2024-05-22 00:44:13] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-22 00:44:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:44:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 184/426 variables, 242/327 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 33 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/426 variables, 11/341 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/426 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:32] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:44:32] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:35] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:44:35] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 351 constraints, problems are : Problem set: 0 solved, 183 unsolved in 26453 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:44:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:44:41] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:41] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 184/426 variables, 242/355 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 183/538 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:45] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:44:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:44:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:44:53] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:44:53] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:44:53] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:44:53] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:44:59] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:44:59] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 7/547 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 547 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 61/61 constraints]
After SMT, in 56483ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 56486ms
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 184/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56771 ms. Remains : 242/253 places, 184/199 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-11 finished in 56910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||X(p2)||F((p0&&X(F(p2))))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 14 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-22 00:45:09] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:45:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 00:45:09] [INFO ] Invariant cache hit.
[2024-05-22 00:45:10] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:45:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:15] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:45:15] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:45:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:45:16] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:45:16] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:45:16] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:45:16] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:45:16] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:18] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:45:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:45:22] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:45:24] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:45:25] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:29] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:45:29] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:45:29] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24082 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:35] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:45:35] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:36] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:45:36] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:45:36] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:45:36] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:38] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:45:38] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:45:38] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:45:38] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:43] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54109ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54112ms
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54385 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-12
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-12 finished in 54662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||(G((p2||F(p3))) U p3))))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 246 transition count 179
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 231 transition count 179
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 231 transition count 168
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 220 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 215 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 215 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 215 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 215 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 214 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 213 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 213 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 213 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 212 transition count 156
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 219 place count 139 transition count 83
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 223 place count 137 transition count 85
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 137 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 135 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 134 transition count 83
Applied a total of 227 rules in 29 ms. Remains 134 /253 variables (removed 119) and now considering 83/199 (removed 116) transitions.
// Phase 1: matrix 83 rows 134 cols
[2024-05-22 00:46:04] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:46:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 00:46:04] [INFO ] Invariant cache hit.
[2024-05-22 00:46:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:46:04] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-22 00:46:04] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 00:46:04] [INFO ] Invariant cache hit.
[2024-05-22 00:46:04] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 83/216 variables, 133/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/217 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 200 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2752 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 1/132 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 83/216 variables, 133/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 80/279 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:46:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:46:09] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:46:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:46:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:46:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:46:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (OVERLAPS) 1/217 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:46:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:46:15] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/217 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:46:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 19 (OVERLAPS) 0/217 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 289 constraints, problems are : Problem set: 0 solved, 80 unsolved in 13422 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints]
After SMT, in 16189ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 16191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/253 places, 83/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16442 ms. Remains : 134/253 places, 83/199 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DES-PT-02b-LTLFireability-13
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-13 finished in 16644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F((p0&&F(p1))))))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 245 transition count 180
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 232 transition count 180
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 232 transition count 169
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 221 transition count 169
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 215 transition count 163
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 215 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 215 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 215 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 214 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 212 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 212 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 72 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 211 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 74 place count 211 transition count 153
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 76 place count 210 transition count 153
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 228 place count 134 transition count 77
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 232 place count 132 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 130 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 129 transition count 77
Applied a total of 235 rules in 29 ms. Remains 129 /253 variables (removed 124) and now considering 77/199 (removed 122) transitions.
// Phase 1: matrix 77 rows 129 cols
[2024-05-22 00:46:21] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:46:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 00:46:21] [INFO ] Invariant cache hit.
[2024-05-22 00:46:21] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-22 00:46:21] [INFO ] Redundant transitions in 0 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 00:46:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 77/205 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 189 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2504 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-22 00:46:24] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 77/205 variables, 128/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 264 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5401 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints]
After SMT, in 7917ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 7919ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/253 places, 77/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8155 ms. Remains : 129/253 places, 77/199 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-14 finished in 8287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0&&F(G(p1)))))))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 247 transition count 193
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 247 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 247 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 245 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 245 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 245 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 244 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 244 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 244 transition count 186
Applied a total of 22 rules in 18 ms. Remains 244 /253 variables (removed 9) and now considering 186/199 (removed 13) transitions.
// Phase 1: matrix 186 rows 244 cols
[2024-05-22 00:46:29] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:46:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 00:46:29] [INFO ] Invariant cache hit.
[2024-05-22 00:46:29] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-22 00:46:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:46:31] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:46:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:32] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:46:32] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:46:32] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:46:32] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:46:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 186/430 variables, 244/334 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:36] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:46:38] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 14/348 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:39] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:46:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:46:40] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:46:40] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:46:40] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:41] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:46:41] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/430 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/430 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/430 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 357 constraints, problems are : Problem set: 0 solved, 185 unsolved in 22733 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 52/113 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 186/430 variables, 244/361 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 185/546 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 7/553 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:47:15] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:47:15] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 555 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 65/65 constraints]
After SMT, in 52766ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 52769ms
Starting structural reductions in LTL mode, iteration 1 : 244/253 places, 186/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53064 ms. Remains : 244/253 places, 186/199 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-15 finished in 53335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-22 00:47:22] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 00:47:22] [INFO ] Applying decomposition
[2024-05-22 00:47:22] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin6761460484401802771
[2024-05-22 00:47:22] [INFO ] Computing symmetric may disable matrix : 199 transitions.
[2024-05-22 00:47:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:22] [INFO ] Computing symmetric may enable matrix : 199 transitions.
[2024-05-22 00:47:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:22] [INFO ] Computing Do-Not-Accords matrix : 199 transitions.
[2024-05-22 00:47:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:47:22] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6761460484401802771
Running compilation step : cd /tmp/ltsmin6761460484401802771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.202405141337/bin/convert-linux64' '-i' '/tmp/graph16759027916277930102.txt' '-o' '/tmp/graph16759027916277930102.bin' '-w' '/tmp/graph16759027916277930102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16759027916277930102.bin' '-l' '-1' '-v' '-w' '/tmp/graph16759027916277930102.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:47:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:47:22] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 00:47:22] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 21 ms.
[2024-05-22 00:47:22] [INFO ] Time to serialize gal into /tmp/LTLFireability13610550189414038604.gal : 4 ms
[2024-05-22 00:47:22] [INFO ] Time to serialize properties into /tmp/LTLFireability16891484853991702260.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13610550189414038604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16891484853991702260.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i10.i1.u60.p207==1)&&(i10.i2.u64.p235==1))")||(G("(i2.i0.u14.p62==0)"))))))
Formula 0 simplified : G(F!"(i2.i0.u14.p62==0)" & FG!"((i10.i1.u60.p207==1)&&(i10.i2.u64.p235==1))")
Compilation finished in 451 ms.
Running link step : cd /tmp/ltsmin6761460484401802771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6761460484401802771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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, t50, t56, t90, t145, t156, t157, i0.i0.u35.t79, i0.i1.u37.t76, i1.u11.t126, i1.u12.t122, ...809
Computing Next relation with stutter on 254022 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: 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( 7/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.221: Initializing POR dependencies: labels 201, guards 199
pins2lts-mc-linux64( 4/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.247: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.249: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.259: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.519: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.519: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.519: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.738: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.750: There are 202 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.750: State length is 254, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.750: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.750: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.750: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.750: Visible groups: 0 / 205, labels: 2 / 202
pins2lts-mc-linux64( 0/ 8), 0.750: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.750: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.766: [Blue] ~96 levels ~960 states ~1288 transitions
pins2lts-mc-linux64( 0/ 8), 0.772: [Blue] ~101 levels ~1920 states ~2568 transitions
pins2lts-mc-linux64( 0/ 8), 0.784: [Blue] ~119 levels ~3840 states ~4992 transitions
pins2lts-mc-linux64( 0/ 8), 0.809: [Blue] ~119 levels ~7680 states ~10480 transitions
pins2lts-mc-linux64( 0/ 8), 0.850: [Blue] ~119 levels ~15360 states ~21576 transitions
pins2lts-mc-linux64( 0/ 8), 0.984: [Blue] ~119 levels ~30720 states ~43648 transitions
pins2lts-mc-linux64( 0/ 8), 1.300: [Blue] ~137 levels ~61440 states ~86528 transitions
pins2lts-mc-linux64( 5/ 8), 1.981: [Blue] ~167 levels ~122880 states ~164664 transitions
pins2lts-mc-linux64( 5/ 8), 3.028: [Blue] ~167 levels ~245760 states ~330288 transitions
pins2lts-mc-linux64( 7/ 8), 4.764: [Blue] ~148 levels ~491520 states ~689688 transitions
pins2lts-mc-linux64( 7/ 8), 7.744: [Blue] ~195 levels ~983040 states ~1335664 transitions
pins2lts-mc-linux64( 7/ 8), 12.761: [Blue] ~195 levels ~1966080 states ~2537680 transitions
pins2lts-mc-linux64( 2/ 8), 23.169: [Blue] ~197 levels ~3932160 states ~5229584 transitions
pins2lts-mc-linux64( 2/ 8), 43.441: [Blue] ~236 levels ~7864320 states ~10325040 transitions
pins2lts-mc-linux64( 1/ 8), 84.980: [Blue] ~363 levels ~15728640 states ~21957880 transitions
pins2lts-mc-linux64( 1/ 8), 160.653: [Blue] ~481 levels ~31457280 states ~45196656 transitions
pins2lts-mc-linux64( 7/ 8), 329.574: [Blue] ~797 levels ~62914560 states ~87936352 transitions
pins2lts-mc-linux64( 7/ 8), 681.483: [Blue] ~649004 levels ~125829120 states ~171124152 transitions
pins2lts-mc-linux64( 5/ 8), 775.991: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 776.035:
pins2lts-mc-linux64( 0/ 8), 776.035: Explored 119947202 states 151048458 transitions, fanout: 1.259
pins2lts-mc-linux64( 0/ 8), 776.035: Total exploration time 775.280 sec (775.220 sec minimum, 775.244 sec on average)
pins2lts-mc-linux64( 0/ 8), 776.035: States per second: 154715, Transitions per second: 194831
pins2lts-mc-linux64( 0/ 8), 776.035:
pins2lts-mc-linux64( 0/ 8), 776.035: State space has 134217371 states, 23902881 are accepting
pins2lts-mc-linux64( 0/ 8), 776.035: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 776.035: blue states: 119947202 (89.37%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 776.035: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 776.035: all-red states: 44729287 (33.33%), bogus 23902 (0.02%)
pins2lts-mc-linux64( 0/ 8), 776.035:
pins2lts-mc-linux64( 0/ 8), 776.035: Total memory used for local state coloring: 201.9MB
pins2lts-mc-linux64( 0/ 8), 776.035:
pins2lts-mc-linux64( 0/ 8), 776.035: Queue width: 8B, total height: 13231447, memory: 100.95MB
pins2lts-mc-linux64( 0/ 8), 776.035: Tree memory: 1072.4MB, 8.4 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 776.035: Tree fill ratio (roots/leafs): 99.0%/18.0%
pins2lts-mc-linux64( 0/ 8), 776.035: Stored 199 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 776.035: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 776.035: Est. total memory use: 1173.4MB (~1124.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6761460484401802771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6761460484401802771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-22 01:12:03] [INFO ] Applying decomposition
[2024-05-22 01:12:03] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:12:03] [INFO ] Decomposing Gal with order
[2024-05-22 01:12:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:12:03] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 01:12:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:12:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 8 ms.
[2024-05-22 01:12:03] [INFO ] Time to serialize gal into /tmp/LTLFireability635083141519376801.gal : 3 ms
[2024-05-22 01:12:03] [INFO ] Time to serialize properties into /tmp/LTLFireability4658229843815692602.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability635083141519376801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4658229843815692602.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.p207==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u93.p235==1))")||(G("(i1.i0.i0.i0.i0.u18.p62=...165
Formula 0 simplified : G(F!"(i1.i0.i0.i0.i0.u18.p62==0)" & FG!"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.p207==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u93.p235==1)...158
Reverse transition relation is NOT exact ! Due to transitions t145, i0.t0, i1.i0.i0.i0.u19.t115, i1.i0.i0.i0.i0.u18.t119, i1.i0.i0.i0.i0.i0.u17.t122, i1.i0...1778
ITS-tools command line returned an error code 137
[2024-05-22 01:21:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:21:45] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-22 01:21:45] [INFO ] Transformed 253 places.
[2024-05-22 01:21:45] [INFO ] Transformed 199 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:21:45] [INFO ] Time to serialize gal into /tmp/LTLFireability16798681247690806785.gal : 1 ms
[2024-05-22 01:21:45] [INFO ] Time to serialize properties into /tmp/LTLFireability6275062772160056546.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16798681247690806785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6275062772160056546.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p207==1)&&(p235==1))")||(G("(p62==0)"))))))
Formula 0 simplified : G(F!"(p62==0)" & FG!"((p207==1)&&(p235==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t10, t17, t25, t34, t37, t48, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, ...441
Computing Next relation with stutter on 254022 deadlock states

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DES-PT-02b, 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 r092-tall-171624189700644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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