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.r553-tall-171734901300283.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 ltsminxred
Input is FireWire-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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 FireWire-PT-15-LTLCardinality-00
FORMULA_NAME FireWire-PT-15-LTLCardinality-01
FORMULA_NAME FireWire-PT-15-LTLCardinality-02
FORMULA_NAME FireWire-PT-15-LTLCardinality-03
FORMULA_NAME FireWire-PT-15-LTLCardinality-04
FORMULA_NAME FireWire-PT-15-LTLCardinality-05
FORMULA_NAME FireWire-PT-15-LTLCardinality-06
FORMULA_NAME FireWire-PT-15-LTLCardinality-07
FORMULA_NAME FireWire-PT-15-LTLCardinality-08
FORMULA_NAME FireWire-PT-15-LTLCardinality-09
FORMULA_NAME FireWire-PT-15-LTLCardinality-10
FORMULA_NAME FireWire-PT-15-LTLCardinality-11
FORMULA_NAME FireWire-PT-15-LTLCardinality-12
FORMULA_NAME FireWire-PT-15-LTLCardinality-13
FORMULA_NAME FireWire-PT-15-LTLCardinality-14
FORMULA_NAME FireWire-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717356712128

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:31:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:31:53] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 19:31:53] [INFO ] Transformed 248 places.
[2024-06-02 19:31:53] [INFO ] Transformed 383 transitions.
[2024-06-02 19:31:53] [INFO ] Found NUPN structural information;
[2024-06-02 19:31:53] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA FireWire-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 383
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 56 place count 192 transition count 330
Iterating global reduction 1 with 53 rules applied. Total rules applied 109 place count 192 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 192 transition count 329
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 124 place count 178 transition count 283
Iterating global reduction 2 with 14 rules applied. Total rules applied 138 place count 178 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 178 transition count 282
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 174 transition count 276
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 174 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 174 transition count 275
Applied a total of 148 rules in 64 ms. Remains 174 /248 variables (removed 74) and now considering 275/383 (removed 108) transitions.
// Phase 1: matrix 275 rows 174 cols
[2024-06-02 19:31:53] [INFO ] Computed 4 invariants in 17 ms
[2024-06-02 19:31:54] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-02 19:31:54] [INFO ] Invariant cache hit.
[2024-06-02 19:31:54] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-02 19:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 15 ms to minimize.
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 107 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:31:56] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:31:57] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:31:57] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:31:57] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:31:57] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:31:57] [INFO ] Deduced a trap composed of 106 places in 53 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 13/17 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 19:31:58] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:31:58] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/19 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 19:32:00] [INFO ] Deduced a trap composed of 102 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:32:00] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:32:01] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:32:01] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 4/23 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/23 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 275/447 variables, 172/195 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/195 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 2/449 variables, 2/197 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 19:32:06] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:32:06] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/199 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/199 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 11 (OVERLAPS) 0/449 variables, 0/199 constraints. Problems are: Problem set: 17 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 199 constraints, problems are : Problem set: 17 solved, 257 unsolved in 18589 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 17 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 21/25 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 19:32:14] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:32:14] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:32:14] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/28 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 275/447 variables, 172/200 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 249/449 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 19:32:18] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:32:19] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 2/451 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/451 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 2/449 variables, 2/453 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 8/461 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/461 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/461 constraints. Problems are: Problem set: 17 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 461 constraints, problems are : Problem set: 17 solved, 257 unsolved in 29288 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 257/274 constraints, Known Traps: 26/26 constraints]
After SMT, in 48026ms problems are : Problem set: 17 solved, 257 unsolved
Search for dead transitions found 17 dead transitions in 48046ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/248 places, 258/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48621 ms. Remains : 174/248 places, 258/383 transitions.
Support contains 15 out of 174 places after structural reductions.
[2024-06-02 19:32:42] [INFO ] Flatten gal took : 42 ms
[2024-06-02 19:32:42] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:32:42] [INFO ] Input system was already deterministic with 258 transitions.
RANDOM walk for 40000 steps (10 resets) in 1413 ms. (28 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40000 steps (11 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 180 ms. (220 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (19 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 274 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 117 ms. (338 steps per ms) remains 7/7 properties
// Phase 1: matrix 258 rows 174 cols
[2024-06-02 19:32:43] [INFO ] Computed 4 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 149/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 246/406 variables, 160/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/420 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 8/428 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4/432 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/432 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 178 constraints, problems are : Problem set: 0 solved, 7 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 149/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:32:44] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:32:44] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:32:44] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 246/406 variables, 160/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:32:44] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 14/420 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 8/428 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/432 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/432 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 189 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 1546ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 3056 ms.
Support contains 11 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 258/258 transitions.
Graph (trivial) has 117 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 166 transition count 226
Reduce places removed 19 places and 0 transitions.
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 1 with 22 rules applied. Total rules applied 42 place count 147 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 146 transition count 223
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 43 place count 146 transition count 210
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 69 place count 133 transition count 210
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 101 place count 117 transition count 194
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 131 place count 102 transition count 263
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 102 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 143 place count 102 transition count 251
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 153 place count 102 transition count 241
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 163 place count 92 transition count 241
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 90 transition count 239
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 90 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 171 place count 90 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 175 place count 90 transition count 231
Applied a total of 175 rules in 62 ms. Remains 90 /174 variables (removed 84) and now considering 231/258 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 90/174 places, 231/258 transitions.
RANDOM walk for 40000 steps (3741 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1266 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1287 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1261 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1249 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1251 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1252 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 34156 steps, run visited all 7 properties in 155 ms. (steps per millisecond=220 )
Probabilistic random walk after 34156 steps, saw 11240 distinct states, run finished after 160 ms. (steps per millisecond=213 ) properties seen :7
FORMULA FireWire-PT-15-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 64 stable transitions
Graph (complete) has 474 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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)))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Graph (trivial) has 125 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 464 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 163 transition count 227
Reduce places removed 21 places and 0 transitions.
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 1 with 24 rules applied. Total rules applied 47 place count 142 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 141 transition count 224
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 48 place count 141 transition count 210
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 76 place count 127 transition count 210
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 121 transition count 202
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 121 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 121 transition count 201
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 90 place count 120 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 118 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 118 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 117 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 117 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 116 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 116 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 115 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 115 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 114 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 114 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 113 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 113 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 112 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 112 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 111 transition count 184
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 111 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 110 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 110 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 109 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 109 transition count 181
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 140 place count 95 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 94 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 94 transition count 165
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 172 place count 79 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 187 place count 79 transition count 215
Applied a total of 187 rules in 62 ms. Remains 79 /174 variables (removed 95) and now considering 215/258 (removed 43) transitions.
[2024-06-02 19:32:49] [INFO ] Flow matrix only has 204 transitions (discarded 11 similar events)
// Phase 1: matrix 204 rows 79 cols
[2024-06-02 19:32:49] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:32:49] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-02 19:32:49] [INFO ] Flow matrix only has 204 transitions (discarded 11 similar events)
[2024-06-02 19:32:49] [INFO ] Invariant cache hit.
[2024-06-02 19:32:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 19:32:49] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 19:32:49] [INFO ] Redundant transitions in 10 ms returned []
Running 212 sub problems to find dead transitions.
[2024-06-02 19:32:49] [INFO ] Flow matrix only has 204 transitions (discarded 11 similar events)
[2024-06-02 19:32:49] [INFO ] Invariant cache hit.
[2024-06-02 19:32:49] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 19:32:50] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:32:50] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-02 19:32:50] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-02 19:32:50] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:32:50] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 17 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-02 19:32:51] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 1 ms to minimize.
[2024-06-02 19:32:51] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 7/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 203/282 variables, 79/90 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 33/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/283 variables, and 123 constraints, problems are : Problem set: 24 solved, 188 unsolved in 4333 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 24 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/6 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 203/282 variables, 79/90 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 33/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 188/311 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/311 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/311 constraints. Problems are: Problem set: 24 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/283 variables, and 311 constraints, problems are : Problem set: 24 solved, 188 unsolved in 8173 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 188/212 constraints, Known Traps: 7/7 constraints]
After SMT, in 12628ms problems are : Problem set: 24 solved, 188 unsolved
Search for dead transitions found 24 dead transitions in 12631ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/174 places, 191/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 78 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 78 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 77 transition count 194
Applied a total of 5 rules in 18 ms. Remains 77 /79 variables (removed 2) and now considering 194/191 (removed -3) transitions.
[2024-06-02 19:33:02] [INFO ] Flow matrix only has 183 transitions (discarded 11 similar events)
// Phase 1: matrix 183 rows 77 cols
[2024-06-02 19:33:02] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 19:33:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 19:33:02] [INFO ] Flow matrix only has 183 transitions (discarded 11 similar events)
[2024-06-02 19:33:02] [INFO ] Invariant cache hit.
[2024-06-02 19:33:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-02 19:33:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/174 places, 194/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13248 ms. Remains : 77/174 places, 194/258 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLCardinality-02 finished in 13528 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(p0))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 173 transition count 258
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 166 transition count 249
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 166 transition count 249
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 163 transition count 245
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 163 transition count 245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 162 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 162 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 161 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 161 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 160 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 159 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 159 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 158 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 158 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 157 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 157 transition count 233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 156 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 156 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 155 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 155 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 154 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 154 transition count 227
Applied a total of 39 rules in 24 ms. Remains 154 /174 variables (removed 20) and now considering 227/258 (removed 31) transitions.
// Phase 1: matrix 227 rows 154 cols
[2024-06-02 19:33:02] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:33:02] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 19:33:02] [INFO ] Invariant cache hit.
[2024-06-02 19:33:02] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-02 19:33:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:33:04] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 19:33:05] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/18 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 19:33:07] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:33:07] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 227/380 variables, 153/173 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 19:33:10] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/381 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 175 constraints, problems are : Problem set: 15 solved, 211 unsolved in 13050 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 15 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 227/380 variables, 153/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 204/378 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/378 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 1/381 variables, 1/379 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 7/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 386 constraints, problems are : Problem set: 15 solved, 211 unsolved in 18492 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 211/226 constraints, Known Traps: 17/17 constraints]
After SMT, in 31582ms problems are : Problem set: 15 solved, 211 unsolved
Search for dead transitions found 15 dead transitions in 31588ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 212/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 210
Applied a total of 4 rules in 4 ms. Remains 152 /154 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 152 cols
[2024-06-02 19:33:34] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 19:33:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 19:33:34] [INFO ] Invariant cache hit.
[2024-06-02 19:33:34] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/174 places, 210/258 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32015 ms. Remains : 152/174 places, 210/258 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLCardinality-06 finished in 32129 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((!X((X(F(p0))||X(p1))) U p2)))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 167 transition count 253
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 167 transition count 253
Applied a total of 12 rules in 9 ms. Remains 167 /174 variables (removed 7) and now considering 253/258 (removed 5) transitions.
// Phase 1: matrix 253 rows 167 cols
[2024-06-02 19:33:34] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 19:33:34] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 19:33:34] [INFO ] Invariant cache hit.
[2024-06-02 19:33:34] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-06-02 19:33:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:33:37] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:33:37] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:33:37] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:33:37] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:33:37] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:33:37] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 13/17 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 19:33:38] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:33:38] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/19 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 19:33:40] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/20 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 253/420 variables, 167/187 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 19:33:43] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 1/188 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/188 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/188 constraints. Problems are: Problem set: 26 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 188 constraints, problems are : Problem set: 26 solved, 226 unsolved in 12920 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 26 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 17/21 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 19:33:48] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:33:48] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/23 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 253/420 variables, 167/190 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 226/416 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/416 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/416 constraints. Problems are: Problem set: 26 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 416 constraints, problems are : Problem set: 26 solved, 226 unsolved in 12722 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 226/252 constraints, Known Traps: 19/19 constraints]
After SMT, in 25691ms problems are : Problem set: 26 solved, 226 unsolved
Search for dead transitions found 26 dead transitions in 25698ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/174 places, 227/258 transitions.
Applied a total of 0 rules in 1 ms. Remains 167 /167 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25918 ms. Remains : 167/174 places, 227/258 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (OR (NOT p2) p0 p1), (OR p1 p0), true, p0]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-10
Product exploration explored 100000 steps with 2 reset in 188 ms.
Product exploration explored 100000 steps with 2 reset in 119 ms.
Computed a total of 42 stabilizing places and 51 stable transitions
Computed a total of 42 stabilizing places and 51 stable transitions
Detected a total of 42/167 stabilizing places and 51/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (OR (NOT p2) p1 p0), (OR p1 p0), true, p0]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (10 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2178943 steps, run timeout after 3001 ms. (steps per millisecond=726 ) properties seen :3 out of 4
Probabilistic random walk after 2178943 steps, saw 420339 distinct states, run finished after 3003 ms. (steps per millisecond=725 ) properties seen :3
// Phase 1: matrix 227 rows 167 cols
[2024-06-02 19:34:04] [INFO ] Computed 4 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 151/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/370 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/382 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/390 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/394 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/394 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 155/394 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 10 factoid took 252 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-15-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-15-LTLCardinality-10 finished in 30455 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((X(X(p0))||(G(F(p1)) U !p0)))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 258
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 163 transition count 247
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 163 transition count 247
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 160 transition count 243
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 159 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 158 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 157 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 156 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 155 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 155 transition count 232
Applied a total of 36 rules in 16 ms. Remains 155 /174 variables (removed 19) and now considering 232/258 (removed 26) transitions.
// Phase 1: matrix 232 rows 155 cols
[2024-06-02 19:34:05] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 19:34:05] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:34:05] [INFO ] Invariant cache hit.
[2024-06-02 19:34:05] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-02 19:34:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-02 19:34:06] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:34:06] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:34:06] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 75 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 11/15 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 19:34:08] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:34:08] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:34:08] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/18 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 19:34:09] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:34:09] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:34:10] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:34:10] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/22 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 19:34:10] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/23 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 232/387 variables, 155/178 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 179 constraints, problems are : Problem set: 18 solved, 213 unsolved in 12147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 18 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/24 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/24 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 232/387 variables, 155/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 213/392 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/392 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/392 constraints. Problems are: Problem set: 18 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 392 constraints, problems are : Problem set: 18 solved, 213 unsolved in 11763 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 213/231 constraints, Known Traps: 20/20 constraints]
After SMT, in 23954ms problems are : Problem set: 18 solved, 213 unsolved
Search for dead transitions found 18 dead transitions in 23958ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/174 places, 214/258 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24175 ms. Remains : 155/174 places, 214/258 transitions.
Stuttering acceptance computed with spot in 216 ms :[false, false, false, false, false]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Computed a total of 34 stabilizing places and 42 stable transitions
Computed a total of 34 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (13 resets) in 115 ms. (344 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
// Phase 1: matrix 214 rows 155 cols
[2024-06-02 19:34:30] [INFO ] Computed 4 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/345 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/365 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/369 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/345 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/357 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/365 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/369 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 155 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=77 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 222 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 198 ms :[false, false, false, false, false]
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-06-02 19:34:31] [INFO ] Invariant cache hit.
[2024-06-02 19:34:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 19:34:31] [INFO ] Invariant cache hit.
[2024-06-02 19:34:31] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-02 19:34:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:34:32] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:34:33] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:34:33] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:34:33] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:34:33] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:34:33] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:34:33] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 212 unsolved
[2024-06-02 19:34:34] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:34:34] [INFO ] Deduced a trap composed of 107 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/20 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 214/369 variables, 155/175 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 212 unsolved
[2024-06-02 19:34:39] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/369 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 176 constraints, problems are : Problem set: 1 solved, 212 unsolved in 11728 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 1 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/21 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 214/369 variables, 155/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 212/388 constraints. Problems are: Problem set: 1 solved, 212 unsolved
[2024-06-02 19:34:45] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 389 constraints, problems are : Problem set: 1 solved, 212 unsolved in 13815 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 212/213 constraints, Known Traps: 18/18 constraints]
After SMT, in 25580ms problems are : Problem set: 1 solved, 212 unsolved
Search for dead transitions found 1 dead transitions in 25583ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/155 places, 213/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25778 ms. Remains : 155/155 places, 213/214 transitions.
Computed a total of 34 stabilizing places and 42 stable transitions
Computed a total of 34 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (10 resets) in 118 ms. (336 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
// Phase 1: matrix 213 rows 155 cols
[2024-06-02 19:34:57] [INFO ] Computed 4 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 201/344 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/356 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/364 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/368 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/368 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 201/344 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/356 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/364 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/368 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/368 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 208 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 4 reset in 64 ms.
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-06-02 19:34:58] [INFO ] Invariant cache hit.
[2024-06-02 19:34:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:34:58] [INFO ] Invariant cache hit.
[2024-06-02 19:34:58] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-06-02 19:34:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 19:34:59] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:35:00] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:35:01] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:35:01] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/368 variables, 155/173 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 173 constraints, problems are : Problem set: 0 solved, 212 unsolved in 7670 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 19:35:07] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 19:35:08] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:35:08] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:35:08] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:35:08] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/368 variables, 155/178 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 212/390 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 19:35:11] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:35:11] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/368 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 392 constraints, problems are : Problem set: 0 solved, 212 unsolved in 16014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 21/21 constraints]
After SMT, in 23721ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 23725ms
Finished structural reductions in LTL mode , in 1 iterations and 23899 ms. Remains : 155/155 places, 213/213 transitions.
Treatment of property FireWire-PT-15-LTLCardinality-11 finished in 77348 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 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Graph (trivial) has 127 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 464 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 163 transition count 226
Reduce places removed 22 places and 0 transitions.
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 1 with 25 rules applied. Total rules applied 49 place count 141 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 140 transition count 223
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 50 place count 140 transition count 209
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 126 transition count 209
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 120 transition count 201
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 120 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 90 place count 120 transition count 200
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 119 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 117 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 117 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 116 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 116 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 115 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 115 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 114 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 114 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 113 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 113 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 112 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 112 transition count 187
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 134 place count 98 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 97 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 97 transition count 171
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 168 place count 81 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 183 place count 81 transition count 224
Applied a total of 183 rules in 35 ms. Remains 81 /174 variables (removed 93) and now considering 224/258 (removed 34) transitions.
[2024-06-02 19:35:22] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
// Phase 1: matrix 213 rows 81 cols
[2024-06-02 19:35:22] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:35:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:35:22] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
[2024-06-02 19:35:22] [INFO ] Invariant cache hit.
[2024-06-02 19:35:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:35:22] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 19:35:22] [INFO ] Redundant transitions in 9 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-02 19:35:22] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
[2024-06-02 19:35:22] [INFO ] Invariant cache hit.
[2024-06-02 19:35:22] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 19:35:23] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:35:23] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-02 19:35:23] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-02 19:35:24] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:35:24] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 5/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 212/293 variables, 81/90 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 35/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/294 variables, and 125 constraints, problems are : Problem set: 28 solved, 193 unsolved in 4186 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 28 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 3/6 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 3/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 212/293 variables, 81/90 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 35/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 193/318 constraints. Problems are: Problem set: 28 solved, 193 unsolved
[2024-06-02 19:35:29] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/319 constraints. Problems are: Problem set: 28 solved, 193 unsolved
[2024-06-02 19:35:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/320 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/320 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/320 constraints. Problems are: Problem set: 28 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/294 variables, and 320 constraints, problems are : Problem set: 28 solved, 193 unsolved in 14373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 193/221 constraints, Known Traps: 7/7 constraints]
After SMT, in 18684ms problems are : Problem set: 28 solved, 193 unsolved
Search for dead transitions found 28 dead transitions in 18688ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 81/174 places, 196/258 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 80 transition count 201
Applied a total of 2 rules in 11 ms. Remains 80 /81 variables (removed 1) and now considering 201/196 (removed -5) transitions.
[2024-06-02 19:35:41] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
// Phase 1: matrix 190 rows 80 cols
[2024-06-02 19:35:41] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:35:41] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:35:41] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 19:35:41] [INFO ] Invariant cache hit.
[2024-06-02 19:35:41] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-02 19:35:41] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/174 places, 201/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19105 ms. Remains : 80/174 places, 201/258 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 2 reset in 91 ms.
Computed a total of 16 stabilizing places and 23 stable transitions
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3157 steps (279 resets) in 29 ms. (105 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-06-02 19:35:42] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 19:35:42] [INFO ] Invariant cache hit.
[2024-06-02 19:35:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 19:35:42] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 19:35:42] [INFO ] Invariant cache hit.
[2024-06-02 19:35:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-02 19:35:42] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-02 19:35:42] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-02 19:35:42] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 19:35:42] [INFO ] Invariant cache hit.
[2024-06-02 19:35:42] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:35:43] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:35:43] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:35:43] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:35:44] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 2 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 189/269 variables, 80/88 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 27/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 115 constraints, problems are : Problem set: 3 solved, 195 unsolved in 3912 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 189/269 variables, 80/88 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 27/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 195/310 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 310 constraints, problems are : Problem set: 3 solved, 195 unsolved in 9329 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 195/198 constraints, Known Traps: 4/4 constraints]
After SMT, in 13371ms problems are : Problem set: 3 solved, 195 unsolved
Search for dead transitions found 3 dead transitions in 13374ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 198/201 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-06-02 19:35:55] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 13583 ms. Remains : 80/80 places, 198/201 transitions.
Computed a total of 16 stabilizing places and 23 stable transitions
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 45 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1956 steps (177 resets) in 7 ms. (244 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 46 ms.
Product exploration explored 100000 steps with 0 reset in 146 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-06-02 19:35:56] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
// Phase 1: matrix 187 rows 80 cols
[2024-06-02 19:35:56] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:35:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 19:35:56] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
[2024-06-02 19:35:56] [INFO ] Invariant cache hit.
[2024-06-02 19:35:56] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-02 19:35:56] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 19:35:56] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-06-02 19:35:56] [INFO ] Flow matrix only has 187 transitions (discarded 11 similar events)
[2024-06-02 19:35:56] [INFO ] Invariant cache hit.
[2024-06-02 19:35:56] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 19:35:57] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:35:57] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:35:57] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 186/266 variables, 80/87 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 27/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/267 variables, and 114 constraints, problems are : Problem set: 0 solved, 195 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 186/266 variables, 80/87 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 27/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 195/309 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/267 variables, and 309 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7983 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 3/3 constraints]
After SMT, in 11619ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 11621ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11790 ms. Remains : 80/80 places, 198/198 transitions.
Treatment of property FireWire-PT-15-LTLCardinality-13 finished in 45902 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((X(X(p0))||(G(F(p1)) U !p0)))))'
Found a Lengthening insensitive property : FireWire-PT-15-LTLCardinality-11
Stuttering acceptance computed with spot in 235 ms :[false, false, false, false, false]
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Graph (trivial) has 123 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 464 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 163 transition count 229
Reduce places removed 19 places and 0 transitions.
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 1 with 22 rules applied. Total rules applied 43 place count 144 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 143 transition count 226
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 44 place count 143 transition count 211
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 74 place count 128 transition count 211
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 80 place count 122 transition count 203
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 122 transition count 203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 place count 122 transition count 202
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 88 place count 121 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 119 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 119 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 118 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 118 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 117 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 117 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 116 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 116 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 115 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 115 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 114 transition count 189
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 114 transition count 189
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 128 place count 101 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 100 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 100 transition count 174
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 162 place count 84 transition count 242
Applied a total of 162 rules in 29 ms. Remains 84 /174 variables (removed 90) and now considering 242/258 (removed 16) transitions.
[2024-06-02 19:36:08] [INFO ] Flow matrix only has 230 transitions (discarded 12 similar events)
// Phase 1: matrix 230 rows 84 cols
[2024-06-02 19:36:08] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:36:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:36:08] [INFO ] Flow matrix only has 230 transitions (discarded 12 similar events)
[2024-06-02 19:36:08] [INFO ] Invariant cache hit.
[2024-06-02 19:36:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 19:36:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-06-02 19:36:09] [INFO ] Flow matrix only has 230 transitions (discarded 12 similar events)
[2024-06-02 19:36:09] [INFO ] Invariant cache hit.
[2024-06-02 19:36:09] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 9/13 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 229/313 variables, 84/97 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 41/138 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/138 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/138 constraints. Problems are: Problem set: 28 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/314 variables, and 138 constraints, problems are : Problem set: 28 solved, 211 unsolved in 4900 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 28 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 4/5 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 3/8 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 5/13 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 229/313 variables, 84/97 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 41/138 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 211/349 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/349 constraints. Problems are: Problem set: 28 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/349 constraints. Problems are: Problem set: 28 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/314 variables, and 349 constraints, problems are : Problem set: 28 solved, 211 unsolved in 12032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 211/239 constraints, Known Traps: 9/9 constraints]
After SMT, in 17072ms problems are : Problem set: 28 solved, 211 unsolved
Search for dead transitions found 28 dead transitions in 17075ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 84/174 places, 214/258 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 219
Applied a total of 2 rules in 12 ms. Remains 83 /84 variables (removed 1) and now considering 219/214 (removed -5) transitions.
[2024-06-02 19:36:26] [INFO ] Flow matrix only has 207 transitions (discarded 12 similar events)
// Phase 1: matrix 207 rows 83 cols
[2024-06-02 19:36:26] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:36:26] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 19:36:26] [INFO ] Flow matrix only has 207 transitions (discarded 12 similar events)
[2024-06-02 19:36:26] [INFO ] Invariant cache hit.
[2024-06-02 19:36:26] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 19:36:26] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 83/174 places, 219/258 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 17459 ms. Remains : 83/174 places, 219/258 transitions.
Running random walk in product with property : FireWire-PT-15-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 36 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Computed a total of 18 stabilizing places and 25 stable transitions
Computed a total of 18 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (3280 resets) in 115 ms. (344 steps per ms) remains 1/4 properties
BEST_FIRST walk for 21163 steps (573 resets) in 27 ms. (755 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[false, false, false, false, false]
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-02 19:36:27] [INFO ] Flow matrix only has 207 transitions (discarded 12 similar events)
[2024-06-02 19:36:27] [INFO ] Invariant cache hit.
[2024-06-02 19:36:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:36:27] [INFO ] Flow matrix only has 207 transitions (discarded 12 similar events)
[2024-06-02 19:36:27] [INFO ] Invariant cache hit.
[2024-06-02 19:36:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 19:36:27] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-02 19:36:27] [INFO ] Flow matrix only has 207 transitions (discarded 12 similar events)
[2024-06-02 19:36:27] [INFO ] Invariant cache hit.
[2024-06-02 19:36:27] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 19:36:28] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:36:28] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:36:28] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:36:28] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:36:28] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:36:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:36:29] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:36:29] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 8/12 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 206/289 variables, 83/95 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 33/128 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/128 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/128 constraints. Problems are: Problem set: 3 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/290 variables, and 128 constraints, problems are : Problem set: 3 solved, 213 unsolved in 4585 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/12 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 206/289 variables, 83/95 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 33/128 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 213/341 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/290 variables, and 341 constraints, problems are : Problem set: 3 solved, 213 unsolved in 11877 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 213/216 constraints, Known Traps: 8/8 constraints]
After SMT, in 16593ms problems are : Problem set: 3 solved, 213 unsolved
Search for dead transitions found 3 dead transitions in 16595ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 83/83 places, 216/219 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16778 ms. Remains : 83/83 places, 216/219 transitions.
Computed a total of 18 stabilizing places and 25 stable transitions
Computed a total of 18 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (3236 resets) in 81 ms. (487 steps per ms) remains 1/4 properties
BEST_FIRST walk for 24064 steps (639 resets) in 35 ms. (668 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 216 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 4 reset in 41 ms.
Product exploration explored 100000 steps with 1 reset in 72 ms.
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-02 19:36:45] [INFO ] Flow matrix only has 204 transitions (discarded 12 similar events)
// Phase 1: matrix 204 rows 83 cols
[2024-06-02 19:36:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:36:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:36:45] [INFO ] Flow matrix only has 204 transitions (discarded 12 similar events)
[2024-06-02 19:36:45] [INFO ] Invariant cache hit.
[2024-06-02 19:36:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 19:36:45] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-02 19:36:45] [INFO ] Flow matrix only has 204 transitions (discarded 12 similar events)
[2024-06-02 19:36:45] [INFO ] Invariant cache hit.
[2024-06-02 19:36:45] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 19:36:46] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:36:46] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:36:47] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:36:47] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 19:36:47] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:36:47] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 203/286 variables, 83/93 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 33/126 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/286 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/287 variables, and 126 constraints, problems are : Problem set: 0 solved, 213 unsolved in 6109 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 203/286 variables, 83/93 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 33/126 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 213/339 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/286 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/287 variables, and 339 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 6/6 constraints]
After SMT, in 16237ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 16240ms
Finished structural reductions in LTL mode , in 1 iterations and 16417 ms. Remains : 83/83 places, 216/216 transitions.
Treatment of property FireWire-PT-15-LTLCardinality-11 finished in 53622 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)))'
[2024-06-02 19:37:02] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:37:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 19:37:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 258 transitions and 770 arcs took 4 ms.
Total runtime 308917 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-15-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-15-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717357030184

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-15-LTLCardinality-11
ltl formula formula --ltl=/tmp/1883/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 174 places, 258 transitions and 770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1883/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1883/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1883/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1883/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 173 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 175, there are 323 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~118 levels ~10000 states ~26636 transitions
pnml2lts-mc( 1/ 4): ~387 levels ~20000 states ~48076 transitions
pnml2lts-mc( 1/ 4): ~387 levels ~40000 states ~116444 transitions
pnml2lts-mc( 1/ 4): ~441 levels ~80000 states ~250360 transitions
pnml2lts-mc( 1/ 4): ~441 levels ~160000 states ~476508 transitions
pnml2lts-mc( 1/ 4): ~441 levels ~320000 states ~903144 transitions
pnml2lts-mc( 0/ 4): ~678 levels ~640000 states ~1948432 transitions
pnml2lts-mc( 0/ 4): ~678 levels ~1280000 states ~4151440 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1008230
pnml2lts-mc( 0/ 4): unique states count: 1441847
pnml2lts-mc( 0/ 4): unique transitions count: 4792450
pnml2lts-mc( 0/ 4): - self-loop count: 10281
pnml2lts-mc( 0/ 4): - claim dead count: 2952902
pnml2lts-mc( 0/ 4): - claim found count: 515995
pnml2lts-mc( 0/ 4): - claim success count: 1484361
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2419
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1500437 states 5113740 transitions, fanout: 3.408
pnml2lts-mc( 0/ 4): Total exploration time 7.050 sec (7.050 sec minimum, 7.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 212828, Transitions per second: 725353
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 11.5MB, 8.3 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 261 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 11.5MB (~256.0MB paged-in)
ltl formula name FireWire-PT-15-LTLCardinality-13
ltl formula formula --ltl=/tmp/1883/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 174 places, 258 transitions and 770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1883/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1883/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1883/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1883/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 174 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 175, there are 261 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~47!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15
pnml2lts-mc( 0/ 4): unique states count: 192
pnml2lts-mc( 0/ 4): unique transitions count: 486
pnml2lts-mc( 0/ 4): - self-loop count: 5
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 28
pnml2lts-mc( 0/ 4): - claim success count: 205
pnml2lts-mc( 0/ 4): - cum. max stack depth: 168
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 205 states 518 transitions, fanout: 2.527
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20500, Transitions per second: 51800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.5 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 261 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="FireWire-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FireWire-PT-15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901300283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;