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-171734901300291.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-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 84K 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-16-LTLCardinality-00
FORMULA_NAME FireWire-PT-16-LTLCardinality-01
FORMULA_NAME FireWire-PT-16-LTLCardinality-02
FORMULA_NAME FireWire-PT-16-LTLCardinality-03
FORMULA_NAME FireWire-PT-16-LTLCardinality-04
FORMULA_NAME FireWire-PT-16-LTLCardinality-05
FORMULA_NAME FireWire-PT-16-LTLCardinality-06
FORMULA_NAME FireWire-PT-16-LTLCardinality-07
FORMULA_NAME FireWire-PT-16-LTLCardinality-08
FORMULA_NAME FireWire-PT-16-LTLCardinality-09
FORMULA_NAME FireWire-PT-16-LTLCardinality-10
FORMULA_NAME FireWire-PT-16-LTLCardinality-11
FORMULA_NAME FireWire-PT-16-LTLCardinality-12
FORMULA_NAME FireWire-PT-16-LTLCardinality-13
FORMULA_NAME FireWire-PT-16-LTLCardinality-14
FORMULA_NAME FireWire-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717356966145

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:36:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:36:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:36:07] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 19:36:07] [INFO ] Transformed 254 places.
[2024-06-02 19:36:07] [INFO ] Transformed 368 transitions.
[2024-06-02 19:36:07] [INFO ] Found NUPN structural information;
[2024-06-02 19:36:07] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 51 place count 203 transition count 320
Iterating global reduction 1 with 48 rules applied. Total rules applied 99 place count 203 transition count 320
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 112 place count 190 transition count 295
Iterating global reduction 1 with 13 rules applied. Total rules applied 125 place count 190 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 190 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 189 transition count 293
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 189 transition count 293
Applied a total of 128 rules in 64 ms. Remains 189 /254 variables (removed 65) and now considering 293/368 (removed 75) transitions.
// Phase 1: matrix 293 rows 189 cols
[2024-06-02 19:36:07] [INFO ] Computed 4 invariants in 20 ms
[2024-06-02 19:36:08] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-06-02 19:36:08] [INFO ] Invariant cache hit.
[2024-06-02 19:36:08] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-06-02 19:36:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 19:36:10] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 18 ms to minimize.
[2024-06-02 19:36:11] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:36:11] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:36:11] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:36:11] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:36:11] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
[2024-06-02 19:36:12] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-06-02 19:36:12] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 8/12 constraints. Problems are: Problem set: 11 solved, 281 unsolved
[2024-06-02 19:36:13] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/13 constraints. Problems are: Problem set: 11 solved, 281 unsolved
[2024-06-02 19:36:14] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:36:15] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/15 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 293/482 variables, 189/204 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/204 constraints. Problems are: Problem set: 11 solved, 281 unsolved
[2024-06-02 19:36:21] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/482 variables, 1/205 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/205 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/205 constraints. Problems are: Problem set: 11 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 205 constraints, problems are : Problem set: 11 solved, 281 unsolved in 20303 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 11 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 12/16 constraints. Problems are: Problem set: 11 solved, 281 unsolved
[2024-06-02 19:36:30] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:36:30] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:36:30] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 3/19 constraints. Problems are: Problem set: 11 solved, 281 unsolved
[2024-06-02 19:36:31] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:36:32] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:36:32] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/22 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 293/482 variables, 189/211 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 281/492 constraints. Problems are: Problem set: 11 solved, 281 unsolved
[2024-06-02 19:36:35] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:36:35] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:36:35] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:36:36] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 4/496 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/496 constraints. Problems are: Problem set: 11 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/496 constraints. Problems are: Problem set: 11 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 496 constraints, problems are : Problem set: 11 solved, 281 unsolved in 22114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 281/292 constraints, Known Traps: 22/22 constraints]
After SMT, in 42570ms problems are : Problem set: 11 solved, 281 unsolved
Search for dead transitions found 11 dead transitions in 42593ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/254 places, 282/368 transitions.
Applied a total of 0 rules in 5 ms. Remains 189 /189 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43230 ms. Remains : 189/254 places, 282/368 transitions.
Support contains 23 out of 189 places after structural reductions.
[2024-06-02 19:36:51] [INFO ] Flatten gal took : 42 ms
[2024-06-02 19:36:51] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:36:51] [INFO ] Input system was already deterministic with 282 transitions.
RANDOM walk for 40000 steps (10 resets) in 1642 ms. (24 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40000 steps (12 resets) in 672 ms. (59 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 402 ms. (99 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (9 resets) in 272 ms. (146 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (10 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (10 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (9 resets) in 160 ms. (248 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (10 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (9 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
// Phase 1: matrix 282 rows 189 cols
[2024-06-02 19:36:52] [INFO ] Computed 4 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 265/435 variables, 170/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 13/448 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 12/460 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 10/470 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 10 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:36:53] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:36:53] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:36:53] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:36:53] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:36:53] [INFO ] Deduced a trap composed of 106 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:36:53] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:36:53] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 2 ms to minimize.
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 265/435 variables, 170/187 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:36:54] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 13/448 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:36:55] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 12/460 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:36:55] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 10/470 variables, 6/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/470 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 1/471 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/471 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/471 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 220 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 17/17 constraints]
After SMT, in 3298ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 10184 ms.
Support contains 17 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 282/282 transitions.
Graph (trivial) has 132 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 174 transition count 234
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 145 transition count 233
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 60 place count 145 transition count 223
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 80 place count 135 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 134 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 134 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 134 transition count 212
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 123 place count 114 transition count 192
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -61
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 153 place count 99 transition count 253
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 157 place count 99 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 178 place count 99 transition count 228
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 190 place count 99 transition count 216
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 202 place count 87 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 219 place count 87 transition count 199
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 87 transition count 199
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 87 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 222 place count 86 transition count 198
Applied a total of 222 rules in 73 ms. Remains 86 /189 variables (removed 103) and now considering 198/282 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 86/189 places, 198/282 transitions.
RANDOM walk for 40000 steps (3612 resets) in 407 ms. (98 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1042 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1057 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1052 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1038 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1049 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1050 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1046 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1082 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1040 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1050 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 9639 steps, run visited all 10 properties in 73 ms. (steps per millisecond=132 )
Probabilistic random walk after 9639 steps, saw 3048 distinct states, run finished after 76 ms. (steps per millisecond=126 ) properties seen :10
Computed a total of 26 stabilizing places and 28 stable transitions
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 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Graph (trivial) has 157 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 173 transition count 229
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 137 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 225
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 135 transition count 214
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 124 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 119 transition count 200
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 119 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 119 transition count 199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 119 transition count 195
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 115 transition count 195
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 158 place count 96 transition count 176
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 192 place count 79 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 213 place count 79 transition count 212
Applied a total of 213 rules in 43 ms. Remains 79 /189 variables (removed 110) and now considering 212/282 (removed 70) transitions.
[2024-06-02 19:37:07] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
// Phase 1: matrix 203 rows 79 cols
[2024-06-02 19:37:07] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:37:07] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 19:37:07] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
[2024-06-02 19:37:07] [INFO ] Invariant cache hit.
[2024-06-02 19:37:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 19:37:07] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 19:37:07] [INFO ] Redundant transitions in 6 ms returned []
Running 208 sub problems to find dead transitions.
[2024-06-02 19:37:07] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
[2024-06-02 19:37:07] [INFO ] Invariant cache hit.
[2024-06-02 19:37:07] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-02 19:37:08] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
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 TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 8/12 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 202/281 variables, 79/91 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 30/121 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/121 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/121 constraints. Problems are: Problem set: 32 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/282 variables, and 121 constraints, problems are : Problem set: 32 solved, 176 unsolved in 3926 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 32 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/3 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/6 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 6/12 constraints. Problems are: Problem set: 32 solved, 176 unsolved
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/13 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 202/281 variables, 79/92 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 30/122 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 176/298 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/298 constraints. Problems are: Problem set: 32 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/281 variables, 0/298 constraints. Problems are: Problem set: 32 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/282 variables, and 298 constraints, problems are : Problem set: 32 solved, 176 unsolved in 5915 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 176/208 constraints, Known Traps: 9/9 constraints]
After SMT, in 9955ms problems are : Problem set: 32 solved, 176 unsolved
Search for dead transitions found 32 dead transitions in 9959ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/189 places, 180/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-02 19:37:17] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10205 ms. Remains : 79/189 places, 180/282 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-03
Product exploration explored 100000 steps with 1 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5252 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1717 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2459 steps, run visited all 1 properties in 8 ms. (steps per millisecond=307 )
Probabilistic random walk after 2459 steps, saw 982 distinct states, run finished after 8 ms. (steps per millisecond=307 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 180/180 transitions.
Applied a total of 0 rules in 17 ms. Remains 79 /79 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-02 19:37:18] [INFO ] Flow matrix only has 171 transitions (discarded 9 similar events)
// Phase 1: matrix 171 rows 79 cols
[2024-06-02 19:37:18] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:37:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 19:37:18] [INFO ] Flow matrix only has 171 transitions (discarded 9 similar events)
[2024-06-02 19:37:18] [INFO ] Invariant cache hit.
[2024-06-02 19:37:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-02 19:37:18] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-02 19:37:18] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 19:37:18] [INFO ] Flow matrix only has 171 transitions (discarded 9 similar events)
[2024-06-02 19:37:18] [INFO ] Invariant cache hit.
[2024-06-02 19:37:18] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:37:19] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:37:19] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:37:19] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:37:19] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:37:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:37:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:37:19] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 7/11 constraints. Problems are: Problem set: 2 solved, 174 unsolved
[2024-06-02 19:37:20] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:37:20] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 170/249 variables, 79/92 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 23/115 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/250 variables, and 115 constraints, problems are : Problem set: 2 solved, 174 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 2 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 170/249 variables, 79/92 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 23/115 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 174/289 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/289 constraints. Problems are: Problem set: 2 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/289 constraints. Problems are: Problem set: 2 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/250 variables, and 289 constraints, problems are : Problem set: 2 solved, 174 unsolved in 5392 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 174/176 constraints, Known Traps: 9/9 constraints]
After SMT, in 10504ms problems are : Problem set: 2 solved, 174 unsolved
Search for dead transitions found 2 dead transitions in 10506ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/79 places, 178/180 transitions.
Applied a total of 0 rules in 9 ms. Remains 79 /79 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-06-02 19:37:29] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10707 ms. Remains : 79/79 places, 178/180 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5278 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1716 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2459 steps, run visited all 1 properties in 17 ms. (steps per millisecond=144 )
Probabilistic random walk after 2459 steps, saw 982 distinct states, run finished after 17 ms. (steps per millisecond=144 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-06-02 19:37:29] [INFO ] Flow matrix only has 169 transitions (discarded 9 similar events)
// Phase 1: matrix 169 rows 79 cols
[2024-06-02 19:37:29] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:37:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:37:29] [INFO ] Flow matrix only has 169 transitions (discarded 9 similar events)
[2024-06-02 19:37:29] [INFO ] Invariant cache hit.
[2024-06-02 19:37:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-02 19:37:29] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-02 19:37:29] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-06-02 19:37:29] [INFO ] Flow matrix only has 169 transitions (discarded 9 similar events)
[2024-06-02 19:37:29] [INFO ] Invariant cache hit.
[2024-06-02 19:37:29] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:37:30] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:37:30] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:37:30] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:37:30] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:37:30] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:37:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:37:31] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:37:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 168/247 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/248 variables, and 114 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 168/247 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 174/288 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:37:36] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 0/247 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/248 variables, and 289 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6952 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 9/9 constraints]
After SMT, in 12038ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 12041ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12205 ms. Remains : 79/79 places, 178/178 transitions.
Treatment of property FireWire-PT-16-LTLCardinality-03 finished in 34598 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(G(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 178 transition count 271
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 178 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 178 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 176 transition count 267
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 176 transition count 267
Applied a total of 27 rules in 5 ms. Remains 176 /189 variables (removed 13) and now considering 267/282 (removed 15) transitions.
// Phase 1: matrix 267 rows 176 cols
[2024-06-02 19:37:41] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 19:37:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 19:37:41] [INFO ] Invariant cache hit.
[2024-06-02 19:37:42] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 19:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 19:37:44] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:37:44] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:37:44] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:37:44] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
[2024-06-02 19:37:44] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 2 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 251 unsolved
[2024-06-02 19:37:45] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:37:45] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:37:45] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:37:45] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 4/13 constraints. Problems are: Problem set: 15 solved, 251 unsolved
[2024-06-02 19:37:47] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 267/443 variables, 176/190 constraints. Problems are: Problem set: 15 solved, 251 unsolved
[2024-06-02 19:37:50] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:37:51] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 2/192 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/192 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 9 (OVERLAPS) 0/443 variables, 0/192 constraints. Problems are: Problem set: 15 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 192 constraints, problems are : Problem set: 15 solved, 251 unsolved in 15011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 15 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 267/443 variables, 176/192 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 251/443 constraints. Problems are: Problem set: 15 solved, 251 unsolved
[2024-06-02 19:38:00] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:38:00] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:38:00] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 3/446 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/446 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/446 constraints. Problems are: Problem set: 15 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 446 constraints, problems are : Problem set: 15 solved, 251 unsolved in 14275 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 251/266 constraints, Known Traps: 15/15 constraints]
After SMT, in 29333ms problems are : Problem set: 15 solved, 251 unsolved
Search for dead transitions found 15 dead transitions in 29337ms
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 : 176/189 places, 252/282 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29557 ms. Remains : 176/189 places, 252/282 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 71 ms.
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-05 finished in 29734 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(p1)&&p0)) U p2))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Graph (trivial) has 149 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 173 transition count 234
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 142 transition count 233
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 64 place count 142 transition count 222
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 131 transition count 222
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 126 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 126 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 126 transition count 207
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 97 place count 126 transition count 203
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 122 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 121 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 121 transition count 202
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 147 place count 101 transition count 182
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -70
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 179 place count 85 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 213 place count 85 transition count 218
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 85 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 84 transition count 217
Applied a total of 215 rules in 36 ms. Remains 84 /189 variables (removed 105) and now considering 217/282 (removed 65) transitions.
[2024-06-02 19:38:11] [INFO ] Flow matrix only has 194 transitions (discarded 23 similar events)
// Phase 1: matrix 194 rows 84 cols
[2024-06-02 19:38:11] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 19:38:11] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 19:38:11] [INFO ] Flow matrix only has 194 transitions (discarded 23 similar events)
[2024-06-02 19:38:11] [INFO ] Invariant cache hit.
[2024-06-02 19:38:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 19:38:11] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 19:38:11] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-02 19:38:11] [INFO ] Flow matrix only has 194 transitions (discarded 23 similar events)
[2024-06-02 19:38:11] [INFO ] Invariant cache hit.
[2024-06-02 19:38:11] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:38:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 10/14 constraints. Problems are: Problem set: 24 solved, 189 unsolved
[2024-06-02 19:38:13] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/15 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 193/276 variables, 83/98 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 30/128 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/128 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 1/277 variables, 1/129 constraints. Problems are: Problem set: 24 solved, 189 unsolved
[2024-06-02 19:38:16] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/130 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/278 variables, and 130 constraints, problems are : Problem set: 24 solved, 189 unsolved in 7516 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 24 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 12/16 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 193/276 variables, 83/99 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 30/129 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 189/318 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/318 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 1/277 variables, 1/319 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/319 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/319 constraints. Problems are: Problem set: 24 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/278 variables, and 319 constraints, problems are : Problem set: 24 solved, 189 unsolved in 8395 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 189/213 constraints, Known Traps: 12/12 constraints]
After SMT, in 15992ms problems are : Problem set: 24 solved, 189 unsolved
Search for dead transitions found 24 dead transitions in 15995ms
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 : 84/189 places, 193/282 transitions.
Applied a total of 0 rules in 13 ms. Remains 84 /84 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-06-02 19:38:27] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 16224 ms. Remains : 84/189 places, 193/282 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-06 finished in 16395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 178 transition count 271
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 178 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 178 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 175 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 173 transition count 264
Applied a total of 33 rules in 12 ms. Remains 173 /189 variables (removed 16) and now considering 264/282 (removed 18) transitions.
// Phase 1: matrix 264 rows 173 cols
[2024-06-02 19:38:27] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:38:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 19:38:28] [INFO ] Invariant cache hit.
[2024-06-02 19:38:28] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-02 19:38:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 19:38:30] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:38:30] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:38:30] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-02 19:38:30] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
[2024-06-02 19:38:30] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 19:38:31] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:38:31] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:38:31] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 3/12 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 19:38:33] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 264/437 variables, 173/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 19:38:37] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/187 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 19:38:38] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:38:39] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 2/189 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 0/437 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 189 constraints, problems are : Problem set: 15 solved, 248 unsolved in 16083 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 15 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 19:38:45] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:38:45] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/18 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 19:38:46] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/19 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 264/437 variables, 173/192 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 248/440 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 19:38:50] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 1/441 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 0/437 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 441 constraints, problems are : Problem set: 15 solved, 248 unsolved in 17643 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 248/263 constraints, Known Traps: 16/16 constraints]
After SMT, in 33773ms problems are : Problem set: 15 solved, 248 unsolved
Search for dead transitions found 15 dead transitions in 33776ms
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 : 173/189 places, 249/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34003 ms. Remains : 173/189 places, 249/282 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-07 finished in 34171 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 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Graph (trivial) has 156 edges and 189 vertex of which 15 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 176 transition count 233
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 140 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 138 transition count 229
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 138 transition count 218
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 127 transition count 218
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 123 transition count 214
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 123 transition count 214
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 109 place count 123 transition count 210
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 119 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 118 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 118 transition count 209
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 161 place count 97 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 96 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 96 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 96 transition count 177
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 198 place count 79 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 79 transition count 232
Applied a total of 201 rules in 38 ms. Remains 79 /189 variables (removed 110) and now considering 232/282 (removed 50) transitions.
[2024-06-02 19:39:02] [INFO ] Flow matrix only has 224 transitions (discarded 8 similar events)
// Phase 1: matrix 224 rows 79 cols
[2024-06-02 19:39:02] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:39:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 19:39:02] [INFO ] Flow matrix only has 224 transitions (discarded 8 similar events)
[2024-06-02 19:39:02] [INFO ] Invariant cache hit.
[2024-06-02 19:39:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 19:39:02] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-02 19:39:02] [INFO ] Redundant transitions in 3 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-02 19:39:02] [INFO ] Flow matrix only has 224 transitions (discarded 8 similar events)
[2024-06-02 19:39:02] [INFO ] Invariant cache hit.
[2024-06-02 19:39:02] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
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 TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 9/13 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 223/302 variables, 79/92 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 16/108 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/108 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/108 constraints. Problems are: Problem set: 32 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/303 variables, and 108 constraints, problems are : Problem set: 32 solved, 196 unsolved in 4740 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 32 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/3 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/6 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 7/13 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 223/302 variables, 79/92 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 16/108 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 196/304 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/304 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/304 constraints. Problems are: Problem set: 32 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/303 variables, and 304 constraints, problems are : Problem set: 32 solved, 196 unsolved in 7387 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 196/228 constraints, Known Traps: 9/9 constraints]
After SMT, in 12254ms problems are : Problem set: 32 solved, 196 unsolved
Search for dead transitions found 32 dead transitions in 12257ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/189 places, 200/282 transitions.
Applied a total of 0 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-02 19:39:14] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 12480 ms. Remains : 79/189 places, 200/282 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 93 ms.
Product exploration explored 100000 steps with 3 reset in 92 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 1512 steps (176 resets) in 7 ms. (189 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 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-02 19:39:15] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
// Phase 1: matrix 192 rows 79 cols
[2024-06-02 19:39:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:39:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:39:15] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2024-06-02 19:39:15] [INFO ] Invariant cache hit.
[2024-06-02 19:39:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:39:15] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-02 19:39:15] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2024-06-02 19:39:15] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2024-06-02 19:39:15] [INFO ] Invariant cache hit.
[2024-06-02 19:39:15] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 191/270 variables, 79/91 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 9/100 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/271 variables, and 100 constraints, problems are : Problem set: 2 solved, 194 unsolved in 4454 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 191/270 variables, 79/91 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 9/100 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 194/294 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/294 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/294 constraints. Problems are: Problem set: 2 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/271 variables, and 294 constraints, problems are : Problem set: 2 solved, 194 unsolved in 6163 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 194/196 constraints, Known Traps: 8/8 constraints]
After SMT, in 10711ms problems are : Problem set: 2 solved, 194 unsolved
Search for dead transitions found 2 dead transitions in 10713ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/79 places, 198/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-06-02 19:39:26] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10910 ms. Remains : 79/79 places, 198/200 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 1305 steps (165 resets) in 8 ms. (145 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 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 43 ms.
Product exploration explored 100000 steps with 1 reset in 41 ms.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-06-02 19:39:26] [INFO ] Flow matrix only has 190 transitions (discarded 8 similar events)
// Phase 1: matrix 190 rows 79 cols
[2024-06-02 19:39:26] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:39:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:39:26] [INFO ] Flow matrix only has 190 transitions (discarded 8 similar events)
[2024-06-02 19:39:26] [INFO ] Invariant cache hit.
[2024-06-02 19:39:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:39:26] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-02 19:39:26] [INFO ] Redundant transitions in 0 ms returned []
Running 194 sub problems to find dead transitions.
[2024-06-02 19:39:26] [INFO ] Flow matrix only has 190 transitions (discarded 8 similar events)
[2024-06-02 19:39:26] [INFO ] Invariant cache hit.
[2024-06-02 19:39:26] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 189/268 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/269 variables, and 99 constraints, problems are : Problem set: 0 solved, 194 unsolved in 4253 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 189/268 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 194/293 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/269 variables, and 293 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5951 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints]
After SMT, in 10288ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 10290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10465 ms. Remains : 79/79 places, 198/198 transitions.
Treatment of property FireWire-PT-16-LTLCardinality-11 finished in 34939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U !p1) U (X(G(p0))&&F(p1)))))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 179 transition count 272
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 179 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 179 transition count 271
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 176 transition count 267
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 176 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 175 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 174 transition count 265
Applied a total of 31 rules in 7 ms. Remains 174 /189 variables (removed 15) and now considering 265/282 (removed 17) transitions.
// Phase 1: matrix 265 rows 174 cols
[2024-06-02 19:39:37] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:39:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:39:37] [INFO ] Invariant cache hit.
[2024-06-02 19:39:37] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-02 19:39:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:39:39] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:39:39] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:39:39] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-02 19:39:39] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:39:39] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-06-02 19:39:40] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:39:40] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:39:40] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:39:40] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:39:42] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:39:42] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:39:43] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 1/16 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 265/439 variables, 174/190 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:39:46] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 1/191 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/191 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 10 (OVERLAPS) 0/439 variables, 0/191 constraints. Problems are: Problem set: 15 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 191 constraints, problems are : Problem set: 15 solved, 249 unsolved in 15146 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/191 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 249/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:39:55] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 1/441 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/439 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 441 constraints, problems are : Problem set: 15 solved, 249 unsolved in 13951 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 14/14 constraints]
After SMT, in 29141ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 29146ms
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 : 174/189 places, 250/282 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29349 ms. Remains : 174/189 places, 250/282 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), (AND p1 (NOT p0)), true]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-12 finished in 29590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Graph (trivial) has 157 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 173 transition count 229
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 137 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 225
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 135 transition count 214
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 124 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 119 transition count 200
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 119 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 119 transition count 199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 119 transition count 195
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 115 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 114 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 114 transition count 194
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 162 place count 94 transition count 174
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 196 place count 77 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 217 place count 77 transition count 211
Applied a total of 217 rules in 20 ms. Remains 77 /189 variables (removed 112) and now considering 211/282 (removed 71) transitions.
[2024-06-02 19:40:06] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
// Phase 1: matrix 202 rows 77 cols
[2024-06-02 19:40:06] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:40:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:40:06] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2024-06-02 19:40:06] [INFO ] Invariant cache hit.
[2024-06-02 19:40:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:40:06] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 19:40:06] [INFO ] Redundant transitions in 0 ms returned []
Running 207 sub problems to find dead transitions.
[2024-06-02 19:40:06] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2024-06-02 19:40:06] [INFO ] Invariant cache hit.
[2024-06-02 19:40:06] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
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 TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 7/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 201/278 variables, 77/88 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 32/120 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/120 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 0/120 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/279 variables, and 120 constraints, problems are : Problem set: 32 solved, 175 unsolved in 4085 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 32 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/6 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 5/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 201/278 variables, 77/88 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 32/120 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 175/295 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/295 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/295 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/279 variables, and 295 constraints, problems are : Problem set: 32 solved, 175 unsolved in 6059 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 175/207 constraints, Known Traps: 7/7 constraints]
After SMT, in 10238ms problems are : Problem set: 32 solved, 175 unsolved
Search for dead transitions found 32 dead transitions in 10240ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/189 places, 179/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 77 /77 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-02 19:40:17] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10444 ms. Remains : 77/189 places, 179/282 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 37 ms.
Product exploration explored 100000 steps with 2 reset in 37 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5302 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1710 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4385 steps, run visited all 1 properties in 10 ms. (steps per millisecond=438 )
Probabilistic random walk after 4385 steps, saw 1657 distinct states, run finished after 10 ms. (steps per millisecond=438 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 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 89 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-02 19:40:17] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
// Phase 1: matrix 170 rows 77 cols
[2024-06-02 19:40:17] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 19:40:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:40:17] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
[2024-06-02 19:40:17] [INFO ] Invariant cache hit.
[2024-06-02 19:40:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:40:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-02 19:40:17] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-06-02 19:40:17] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
[2024-06-02 19:40:17] [INFO ] Invariant cache hit.
[2024-06-02 19:40:17] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-02 19:40:18] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:40:18] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:40:18] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:40:18] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:40:18] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:40:19] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 169/246 variables, 77/87 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 25/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/247 variables, and 112 constraints, problems are : Problem set: 2 solved, 173 unsolved in 3549 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 2 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 169/246 variables, 77/87 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 25/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 173/285 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/247 variables, and 285 constraints, problems are : Problem set: 2 solved, 173 unsolved in 4761 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 173/175 constraints, Known Traps: 6/6 constraints]
After SMT, in 8389ms problems are : Problem set: 2 solved, 173 unsolved
Search for dead transitions found 2 dead transitions in 8392ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/77 places, 177/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-06-02 19:40:26] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 8569 ms. Remains : 77/77 places, 177/179 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 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 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5246 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1708 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4385 steps, run visited all 1 properties in 10 ms. (steps per millisecond=438 )
Probabilistic random walk after 4385 steps, saw 1657 distinct states, run finished after 10 ms. (steps per millisecond=438 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 33 ms.
Product exploration explored 100000 steps with 0 reset in 35 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 177/177 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-06-02 19:40:26] [INFO ] Flow matrix only has 168 transitions (discarded 9 similar events)
// Phase 1: matrix 168 rows 77 cols
[2024-06-02 19:40:26] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:40:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:40:26] [INFO ] Flow matrix only has 168 transitions (discarded 9 similar events)
[2024-06-02 19:40:27] [INFO ] Invariant cache hit.
[2024-06-02 19:40:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:40:27] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-02 19:40:27] [INFO ] Redundant transitions in 0 ms returned []
Running 173 sub problems to find dead transitions.
[2024-06-02 19:40:27] [INFO ] Flow matrix only has 168 transitions (discarded 9 similar events)
[2024-06-02 19:40:27] [INFO ] Invariant cache hit.
[2024-06-02 19:40:27] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-02 19:40:27] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:40:27] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:40:28] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:40:28] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 167/244 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 25/110 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/244 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 110 constraints, problems are : Problem set: 0 solved, 173 unsolved in 3446 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 167/244 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 25/110 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 173/283 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-02 19:40:34] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:40:34] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/244 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (OVERLAPS) 0/244 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 285 constraints, problems are : Problem set: 0 solved, 173 unsolved in 9308 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 6/6 constraints]
After SMT, in 12828ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 12830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13020 ms. Remains : 77/77 places, 177/177 transitions.
Treatment of property FireWire-PT-16-LTLCardinality-13 finished in 33331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 178 transition count 271
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 178 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 178 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 176 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 176 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 175 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 175 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 174 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 174 transition count 266
Applied a total of 31 rules in 9 ms. Remains 174 /189 variables (removed 15) and now considering 266/282 (removed 16) transitions.
// Phase 1: matrix 266 rows 174 cols
[2024-06-02 19:40:40] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:40:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:40:40] [INFO ] Invariant cache hit.
[2024-06-02 19:40:40] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-02 19:40:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 19:40:41] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:40:42] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:40:42] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:40:42] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
[2024-06-02 19:40:42] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-06-02 19:40:43] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 266/440 variables, 174/184 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:40:45] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 1/185 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/185 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:40:50] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:40:50] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/440 variables, 2/187 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/187 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/187 constraints. Problems are: Problem set: 15 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 187 constraints, problems are : Problem set: 15 solved, 250 unsolved in 15669 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 15 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:40:56] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:40:56] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:40:57] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/16 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 266/440 variables, 174/190 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 250/440 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 440 constraints, problems are : Problem set: 15 solved, 250 unsolved in 11445 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 250/265 constraints, Known Traps: 12/12 constraints]
After SMT, in 27156ms problems are : Problem set: 15 solved, 250 unsolved
Search for dead transitions found 15 dead transitions in 27159ms
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 : 174/189 places, 251/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 174 /174 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27391 ms. Remains : 174/189 places, 251/282 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-14
Product exploration explored 100000 steps with 1 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Computed a total of 21 stabilizing places and 23 stable transitions
Computed a total of 21 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (9 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (11 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (10 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (9 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 614994 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 6
Probabilistic random walk after 614994 steps, saw 122926 distinct states, run finished after 3011 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 251 rows 174 cols
[2024-06-02 19:41:11] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 74/158 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 19:41:11] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:41:11] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:41:11] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 236/394 variables, 158/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/403 variables, 5/170 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/409 variables, 3/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/415 variables, 3/176 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 7/422 variables, 3/179 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 3/425 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/425 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 181 constraints, problems are : Problem set: 1 solved, 5 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 74/158 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 19:41:12] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:41:12] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 236/394 variables, 158/167 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 9/403 variables, 5/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 4/177 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 19:41:12] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/409 variables, 3/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/415 variables, 3/184 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 7/422 variables, 3/187 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 3/425 variables, 2/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/425 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 189 constraints, problems are : Problem set: 1 solved, 5 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 1462ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1184 ms.
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 251/251 transitions.
Graph (trivial) has 138 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 159 transition count 205
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 132 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 131 transition count 203
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 131 transition count 186
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 114 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 113 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 113 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 113 transition count 175
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 129 place count 96 transition count 158
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 163 place count 79 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 169 place count 79 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 204 place count 79 transition count 192
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 214 place count 79 transition count 182
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 224 place count 69 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 246 place count 69 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 69 transition count 160
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 69 transition count 160
Applied a total of 248 rules in 27 ms. Remains 69 /174 variables (removed 105) and now considering 160/251 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 69/174 places, 160/251 transitions.
RANDOM walk for 40000 steps (4023 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1213 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1278 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1263 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1226 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1226 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 1730 steps, run visited all 5 properties in 37 ms. (steps per millisecond=46 )
Probabilistic random walk after 1730 steps, saw 759 distinct states, run finished after 38 ms. (steps per millisecond=45 ) properties seen :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 308 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 251/251 transitions.
Graph (trivial) has 138 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 158 transition count 207
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 131 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 130 transition count 205
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 130 transition count 188
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 113 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 112 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 112 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 112 transition count 177
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 4 with 32 rules applied. Total rules applied 127 place count 96 transition count 161
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 159 place count 80 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 197 place count 80 transition count 193
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 80 transition count 193
Applied a total of 198 rules in 21 ms. Remains 80 /174 variables (removed 94) and now considering 193/251 (removed 58) transitions.
[2024-06-02 19:41:15] [INFO ] Flow matrix only has 166 transitions (discarded 27 similar events)
// Phase 1: matrix 166 rows 80 cols
[2024-06-02 19:41:15] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:41:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:41:15] [INFO ] Flow matrix only has 166 transitions (discarded 27 similar events)
[2024-06-02 19:41:15] [INFO ] Invariant cache hit.
[2024-06-02 19:41:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:41:15] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-06-02 19:41:15] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-06-02 19:41:15] [INFO ] Flow matrix only has 166 transitions (discarded 27 similar events)
[2024-06-02 19:41:15] [INFO ] Invariant cache hit.
[2024-06-02 19:41:15] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-02 19:41:16] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 9/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 165/245 variables, 80/93 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 25/118 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/246 variables, and 118 constraints, problems are : Problem set: 3 solved, 187 unsolved in 4446 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 3 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 7/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 165/245 variables, 80/93 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 25/118 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 187/305 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/305 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/305 constraints. Problems are: Problem set: 3 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/246 variables, and 305 constraints, problems are : Problem set: 3 solved, 187 unsolved in 5583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 187/190 constraints, Known Traps: 9/9 constraints]
After SMT, in 10123ms problems are : Problem set: 3 solved, 187 unsolved
Search for dead transitions found 3 dead transitions in 10125ms
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/174 places, 190/251 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-06-02 19:41:25] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10321 ms. Remains : 80/174 places, 190/251 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (4464 resets) in 338 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1506 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1509 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1463 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1465 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1436 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1417 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
Probably explored full state space saw : 34281 states, properties seen :5
Probabilistic random walk after 143601 steps, saw 34281 distinct states, run finished after 278 ms. (steps per millisecond=516 ) properties seen :5
Explored full state space saw : 34281 states, properties seen :0
Exhaustive walk after 143601 steps, saw 34281 distinct states, run finished after 135 ms. (steps per millisecond=1063 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 14 factoid took 246 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-06-02 19:41:28] [INFO ] Flow matrix only has 163 transitions (discarded 27 similar events)
// Phase 1: matrix 163 rows 80 cols
[2024-06-02 19:41:28] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:41:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:41:28] [INFO ] Flow matrix only has 163 transitions (discarded 27 similar events)
[2024-06-02 19:41:28] [INFO ] Invariant cache hit.
[2024-06-02 19:41:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:41:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-02 19:41:28] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-02 19:41:28] [INFO ] Flow matrix only has 163 transitions (discarded 27 similar events)
[2024-06-02 19:41:28] [INFO ] Invariant cache hit.
[2024-06-02 19:41:28] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 0 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:41:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 162/242 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/243 variables, and 118 constraints, problems are : Problem set: 0 solved, 187 unsolved in 4549 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 162/242 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 187/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/243 variables, and 305 constraints, problems are : Problem set: 0 solved, 187 unsolved in 6238 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 9/9 constraints]
After SMT, in 10869ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 10871ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11041 ms. Remains : 80/80 places, 190/190 transitions.
Treatment of property FireWire-PT-16-LTLCardinality-14 finished in 59351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Graph (trivial) has 155 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 173 transition count 229
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 137 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 225
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 135 transition count 214
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 124 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 119 transition count 200
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 119 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 119 transition count 199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 119 transition count 195
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 115 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 114 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 114 transition count 194
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 160 place count 95 transition count 175
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 192 place count 79 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 211 place count 79 transition count 206
Applied a total of 211 rules in 21 ms. Remains 79 /189 variables (removed 110) and now considering 206/282 (removed 76) transitions.
[2024-06-02 19:41:39] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
// Phase 1: matrix 197 rows 79 cols
[2024-06-02 19:41:39] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:41:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 19:41:39] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2024-06-02 19:41:39] [INFO ] Invariant cache hit.
[2024-06-02 19:41:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 19:41:39] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 19:41:39] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-06-02 19:41:39] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2024-06-02 19:41:39] [INFO ] Invariant cache hit.
[2024-06-02 19:41:39] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-02 19:41:40] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:41:40] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-02 19:41:40] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:41:40] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:41:40] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 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 TDEAD106 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/9 constraints. Problems are: Problem set: 32 solved, 170 unsolved
[2024-06-02 19:41:41] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/10 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 196/275 variables, 79/89 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 30/119 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/276 variables, and 119 constraints, problems are : Problem set: 32 solved, 170 unsolved in 5171 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 32 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/7 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 3/10 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 196/275 variables, 79/89 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 30/119 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 170/289 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/276 variables, and 289 constraints, problems are : Problem set: 32 solved, 170 unsolved in 5370 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 170/202 constraints, Known Traps: 6/6 constraints]
After SMT, in 10616ms problems are : Problem set: 32 solved, 170 unsolved
Search for dead transitions found 32 dead transitions in 10618ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/189 places, 174/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-06-02 19:41:50] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10831 ms. Remains : 79/189 places, 174/282 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 38 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5194 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1744 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1265 steps, run visited all 1 properties in 5 ms. (steps per millisecond=253 )
Probabilistic random walk after 1265 steps, saw 568 distinct states, run finished after 5 ms. (steps per millisecond=253 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-06-02 19:41:50] [INFO ] Flow matrix only has 165 transitions (discarded 9 similar events)
// Phase 1: matrix 165 rows 79 cols
[2024-06-02 19:41:50] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:41:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:41:50] [INFO ] Flow matrix only has 165 transitions (discarded 9 similar events)
[2024-06-02 19:41:50] [INFO ] Invariant cache hit.
[2024-06-02 19:41:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-02 19:41:50] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-06-02 19:41:50] [INFO ] Redundant transitions in 0 ms returned []
Running 170 sub problems to find dead transitions.
[2024-06-02 19:41:51] [INFO ] Flow matrix only has 165 transitions (discarded 9 similar events)
[2024-06-02 19:41:51] [INFO ] Invariant cache hit.
[2024-06-02 19:41:51] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-02 19:41:51] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:41:51] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:41:51] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:41:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:41:52] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 164/243 variables, 79/88 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 23/111 constraints. Problems are: Problem set: 2 solved, 168 unsolved
[2024-06-02 19:41:53] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/112 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/244 variables, and 112 constraints, problems are : Problem set: 2 solved, 168 unsolved in 4834 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 2 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 164/243 variables, 79/89 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 23/112 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 168/280 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/280 constraints. Problems are: Problem set: 2 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/280 constraints. Problems are: Problem set: 2 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/244 variables, and 280 constraints, problems are : Problem set: 2 solved, 168 unsolved in 5094 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 168/170 constraints, Known Traps: 6/6 constraints]
After SMT, in 9982ms problems are : Problem set: 2 solved, 168 unsolved
Search for dead transitions found 2 dead transitions in 9984ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/79 places, 172/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-06-02 19:42:00] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10157 ms. Remains : 79/79 places, 172/174 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5170 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1706 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1265 steps, run visited all 1 properties in 6 ms. (steps per millisecond=210 )
Probabilistic random walk after 1265 steps, saw 568 distinct states, run finished after 6 ms. (steps per millisecond=210 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 38 ms.
Product exploration explored 100000 steps with 0 reset in 38 ms.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-06-02 19:42:01] [INFO ] Flow matrix only has 163 transitions (discarded 9 similar events)
// Phase 1: matrix 163 rows 79 cols
[2024-06-02 19:42:01] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:42:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:42:01] [INFO ] Flow matrix only has 163 transitions (discarded 9 similar events)
[2024-06-02 19:42:01] [INFO ] Invariant cache hit.
[2024-06-02 19:42:01] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-02 19:42:01] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 19:42:01] [INFO ] Redundant transitions in 1 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-02 19:42:01] [INFO ] Flow matrix only has 163 transitions (discarded 9 similar events)
[2024-06-02 19:42:01] [INFO ] Invariant cache hit.
[2024-06-02 19:42:01] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 19:42:02] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:42:02] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 162/241 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/242 variables, and 108 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3171 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 162/241 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 168/276 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/242 variables, and 276 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4509 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 2/2 constraints]
After SMT, in 7744ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 7746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7902 ms. Remains : 79/79 places, 172/172 transitions.
Treatment of property FireWire-PT-16-LTLCardinality-15 finished in 30179 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)))'
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)))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Found a Shortening insensitive property : FireWire-PT-16-LTLCardinality-14
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 189/189 places, 282/282 transitions.
Graph (trivial) has 153 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 173 transition count 230
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 138 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 136 transition count 226
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 77 place count 136 transition count 216
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 97 place count 126 transition count 216
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 120 transition count 201
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 120 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 120 transition count 200
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 110 place count 120 transition count 195
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 120 place count 115 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 114 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 114 transition count 194
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 156 place count 97 transition count 177
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 188 place count 81 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 191 place count 81 transition count 231
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 81 transition count 231
Applied a total of 192 rules in 31 ms. Remains 81 /189 variables (removed 108) and now considering 231/282 (removed 51) transitions.
[2024-06-02 19:42:10] [INFO ] Flow matrix only has 222 transitions (discarded 9 similar events)
// Phase 1: matrix 222 rows 81 cols
[2024-06-02 19:42:10] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:42:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:42:10] [INFO ] Flow matrix only has 222 transitions (discarded 9 similar events)
[2024-06-02 19:42:10] [INFO ] Invariant cache hit.
[2024-06-02 19:42:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:42:10] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-02 19:42:10] [INFO ] Flow matrix only has 222 transitions (discarded 9 similar events)
[2024-06-02 19:42:10] [INFO ] Invariant cache hit.
[2024-06-02 19:42:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 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 TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 7/11 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 221/302 variables, 81/92 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 37/129 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/129 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/129 constraints. Problems are: Problem set: 32 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/303 variables, and 129 constraints, problems are : Problem set: 32 solved, 196 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 32 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 3/6 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 5/11 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 221/302 variables, 81/92 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 37/129 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 196/325 constraints. Problems are: Problem set: 32 solved, 196 unsolved
[2024-06-02 19:42:17] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 1/326 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/326 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/326 constraints. Problems are: Problem set: 32 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/303 variables, and 326 constraints, problems are : Problem set: 32 solved, 196 unsolved in 9312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 196/228 constraints, Known Traps: 8/8 constraints]
After SMT, in 14392ms problems are : Problem set: 32 solved, 196 unsolved
Search for dead transitions found 32 dead transitions in 14395ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 81/189 places, 199/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 14606 ms. Remains : 81/189 places, 199/282 transitions.
Running random walk in product with property : FireWire-PT-16-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 2 reset in 56 ms.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (4304 resets) in 327 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1398 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1462 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1442 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1438 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1411 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1390 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
Probably explored full state space saw : 37197 states, properties seen :5
Probabilistic random walk after 155064 steps, saw 37197 distinct states, run finished after 227 ms. (steps per millisecond=683 ) properties seen :5
Explored full state space saw : 37197 states, properties seen :0
Exhaustive walk after 155064 steps, saw 37197 distinct states, run finished after 137 ms. (steps per millisecond=1131 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 310 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 199/199 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 81 transition count 181
Applied a total of 18 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 181/199 (removed 18) transitions.
[2024-06-02 19:42:26] [INFO ] Flow matrix only has 172 transitions (discarded 9 similar events)
// Phase 1: matrix 172 rows 81 cols
[2024-06-02 19:42:26] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:42:26] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 19:42:26] [INFO ] Flow matrix only has 172 transitions (discarded 9 similar events)
[2024-06-02 19:42:26] [INFO ] Invariant cache hit.
[2024-06-02 19:42:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-02 19:42:27] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-02 19:42:27] [INFO ] Redundant transitions in 0 ms returned []
Running 178 sub problems to find dead transitions.
[2024-06-02 19:42:27] [INFO ] Flow matrix only has 172 transitions (discarded 9 similar events)
[2024-06-02 19:42:27] [INFO ] Invariant cache hit.
[2024-06-02 19:42:27] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 19:42:27] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:42:27] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:42:27] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:42:28] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:42:28] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:42:28] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:42:28] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:42:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 171/252 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 23/116 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/253 variables, and 116 constraints, problems are : Problem set: 2 solved, 176 unsolved in 4190 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 171/252 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 23/116 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 176/292 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 176 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/253 variables, and 292 constraints, problems are : Problem set: 2 solved, 176 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 176/178 constraints, Known Traps: 8/8 constraints]
After SMT, in 9331ms problems are : Problem set: 2 solved, 176 unsolved
Search for dead transitions found 2 dead transitions in 9333ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 179/199 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-02 19:42:36] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 9548 ms. Remains : 81/81 places, 179/199 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 186 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (4286 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1435 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1471 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1432 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1436 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1368 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1431 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
Probably explored full state space saw : 37197 states, properties seen :5
Probabilistic random walk after 153332 steps, saw 37197 distinct states, run finished after 309 ms. (steps per millisecond=496 ) properties seen :5
Explored full state space saw : 37197 states, properties seen :0
Exhaustive walk after 153332 steps, saw 37197 distinct states, run finished after 164 ms. (steps per millisecond=934 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 14 factoid took 398 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 451 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 448 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1 reset in 56 ms.
Product exploration explored 100000 steps with 1 reset in 74 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-02 19:42:39] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
// Phase 1: matrix 170 rows 81 cols
[2024-06-02 19:42:39] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:42:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:42:39] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
[2024-06-02 19:42:39] [INFO ] Invariant cache hit.
[2024-06-02 19:42:39] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-02 19:42:39] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-02 19:42:39] [INFO ] Redundant transitions in 0 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 19:42:39] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
[2024-06-02 19:42:39] [INFO ] Invariant cache hit.
[2024-06-02 19:42:39] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:42:40] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:42:40] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:42:40] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:42:40] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:42:40] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:42:40] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 169/250 variables, 81/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/251 variables, and 114 constraints, problems are : Problem set: 0 solved, 176 unsolved in 3691 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 169/250 variables, 81/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 176/290 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/251 variables, and 290 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4882 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 6/6 constraints]
After SMT, in 8635ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 8637ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8817 ms. Remains : 81/81 places, 179/179 transitions.
Treatment of property FireWire-PT-16-LTLCardinality-14 finished in 38367 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:42:48] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:42:48] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-02 19:42:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 282 transitions and 802 arcs took 6 ms.
Total runtime 401241 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-16-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-16-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-16-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-16-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-16-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717357370147

--------------------
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-16-LTLCardinality-03
ltl formula formula --ltl=/tmp/2556/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 189 places, 282 transitions and 802 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.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2556/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2556/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2556/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2556/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 190 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 294 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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~256!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 619
pnml2lts-mc( 0/ 4): unique states count: 1755
pnml2lts-mc( 0/ 4): unique transitions count: 3205
pnml2lts-mc( 0/ 4): - self-loop count: 145
pnml2lts-mc( 0/ 4): - claim dead count: 457
pnml2lts-mc( 0/ 4): - claim found count: 237
pnml2lts-mc( 0/ 4): - claim success count: 1993
pnml2lts-mc( 0/ 4): - cum. max stack depth: 890
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2010 states 3570 transitions, fanout: 1.776
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 100500, Transitions per second: 178500
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, 11.3 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 285 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)
ltl formula name FireWire-PT-16-LTLCardinality-11
ltl formula formula --ltl=/tmp/2556/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 189 places, 282 transitions and 802 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.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2556/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2556/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2556/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2556/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 190 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 294 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):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~43!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6
pnml2lts-mc( 0/ 4): unique states count: 182
pnml2lts-mc( 0/ 4): unique transitions count: 497
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 22
pnml2lts-mc( 0/ 4): - claim success count: 193
pnml2lts-mc( 0/ 4): - cum. max stack depth: 179
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 193 states 521 transitions, fanout: 2.699
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: 19300, Transitions per second: 52100
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.7 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 285 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)
ltl formula name FireWire-PT-16-LTLCardinality-13
ltl formula formula --ltl=/tmp/2556/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 189 places, 282 transitions and 802 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2556/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2556/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2556/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2556/ltl_2_
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 191 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 291 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): ~152 levels ~10000 states ~24520 transitions
pnml2lts-mc( 1/ 4): ~318 levels ~20000 states ~47692 transitions
pnml2lts-mc( 3/ 4): ~1436 levels ~40000 states ~97964 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~738!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28331
pnml2lts-mc( 0/ 4): unique states count: 56180
pnml2lts-mc( 0/ 4): unique transitions count: 153931
pnml2lts-mc( 0/ 4): - self-loop count: 1491
pnml2lts-mc( 0/ 4): - claim dead count: 76804
pnml2lts-mc( 0/ 4): - claim found count: 19900
pnml2lts-mc( 0/ 4): - claim success count: 58120
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3514
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 58575 states 162007 transitions, fanout: 2.766
pnml2lts-mc( 0/ 4): Total exploration time 0.400 sec (0.400 sec minimum, 0.400 sec on average)
pnml2lts-mc( 0/ 4): States per second: 146438, Transitions per second: 405018
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 8.6 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 285 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name FireWire-PT-16-LTLCardinality-14
ltl formula formula --ltl=/tmp/2556/ltl_3_
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
pnml2lts-mc( 0/ 4): Petri net has 189 places, 282 transitions and 802 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2556/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2556/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2556/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2556/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 191 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 301 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): ~304 levels ~10000 states ~18840 transitions
pnml2lts-mc( 3/ 4): ~334 levels ~20000 states ~48956 transitions
pnml2lts-mc( 2/ 4): ~188 levels ~40000 states ~164884 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~347!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31376
pnml2lts-mc( 0/ 4): unique states count: 52800
pnml2lts-mc( 0/ 4): unique transitions count: 204132
pnml2lts-mc( 0/ 4): - self-loop count: 674
pnml2lts-mc( 0/ 4): - claim dead count: 138707
pnml2lts-mc( 0/ 4): - claim found count: 12598
pnml2lts-mc( 0/ 4): - claim success count: 53873
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1033
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 54056 states 208714 transitions, fanout: 3.861
pnml2lts-mc( 0/ 4): Total exploration time 0.370 sec (0.370 sec minimum, 0.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 146097, Transitions per second: 564092
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 8.6 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 285 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name FireWire-PT-16-LTLCardinality-15
ltl formula formula --ltl=/tmp/2556/ltl_4_
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 189 places, 282 transitions and 802 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/2556/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2556/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2556/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2556/ltl_4_
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 191 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 291 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):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~162!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 489
pnml2lts-mc( 0/ 4): unique states count: 1510
pnml2lts-mc( 0/ 4): unique transitions count: 2625
pnml2lts-mc( 0/ 4): - self-loop count: 137
pnml2lts-mc( 0/ 4): - claim dead count: 212
pnml2lts-mc( 0/ 4): - claim found count: 154
pnml2lts-mc( 0/ 4): - claim success count: 1595
pnml2lts-mc( 0/ 4): - cum. max stack depth: 765
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1595 states 2766 transitions, fanout: 1.734
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: 159500, Transitions per second: 276600
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, 11.7 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 285 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-16"
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-16, 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-171734901300291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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