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-171734901300292.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300292
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME FireWire-PT-16-LTLFireability-01
FORMULA_NAME FireWire-PT-16-LTLFireability-02
FORMULA_NAME FireWire-PT-16-LTLFireability-03
FORMULA_NAME FireWire-PT-16-LTLFireability-04
FORMULA_NAME FireWire-PT-16-LTLFireability-05
FORMULA_NAME FireWire-PT-16-LTLFireability-06
FORMULA_NAME FireWire-PT-16-LTLFireability-07
FORMULA_NAME FireWire-PT-16-LTLFireability-08
FORMULA_NAME FireWire-PT-16-LTLFireability-09
FORMULA_NAME FireWire-PT-16-LTLFireability-10
FORMULA_NAME FireWire-PT-16-LTLFireability-11
FORMULA_NAME FireWire-PT-16-LTLFireability-12
FORMULA_NAME FireWire-PT-16-LTLFireability-13
FORMULA_NAME FireWire-PT-16-LTLFireability-14
FORMULA_NAME FireWire-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717356999038

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
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:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:36:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:36:40] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 19:36:40] [INFO ] Transformed 254 places.
[2024-06-02 19:36:40] [INFO ] Transformed 368 transitions.
[2024-06-02 19:36:40] [INFO ] Found NUPN structural information;
[2024-06-02 19:36:40] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FireWire-PT-16-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 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 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 54 place count 200 transition count 317
Iterating global reduction 1 with 51 rules applied. Total rules applied 105 place count 200 transition count 317
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 119 place count 186 transition count 299
Iterating global reduction 1 with 14 rules applied. Total rules applied 133 place count 186 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 184 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 184 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 183 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 183 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 182 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 182 transition count 295
Applied a total of 141 rules in 78 ms. Remains 182 /254 variables (removed 72) and now considering 295/368 (removed 73) transitions.
// Phase 1: matrix 295 rows 182 cols
[2024-06-02 19:36:40] [INFO ] Computed 4 invariants in 19 ms
[2024-06-02 19:36:40] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-02 19:36:40] [INFO ] Invariant cache hit.
[2024-06-02 19:36:41] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-06-02 19:36:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 19:36:43] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 15 ms to minimize.
[2024-06-02 19:36:43] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:36:43] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:36:43] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 2 ms to minimize.
[2024-06-02 19:36:43] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:36:43] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:36:44] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:36:44] [INFO ] Deduced a trap composed of 110 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:36:44] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:36:44] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 3 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD233 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:45] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-06-02 19:36:45] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 12/16 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/16 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 295/477 variables, 182/198 constraints. Problems are: Problem set: 11 solved, 283 unsolved
[2024-06-02 19:36:47] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 1/199 constraints. Problems are: Problem set: 11 solved, 283 unsolved
[2024-06-02 19:36:50] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/200 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/200 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/477 variables, 0/200 constraints. Problems are: Problem set: 11 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 200 constraints, problems are : Problem set: 11 solved, 283 unsolved in 16414 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 11 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 14/18 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/18 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 295/477 variables, 182/200 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 283/483 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/483 constraints. Problems are: Problem set: 11 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/483 constraints. Problems are: Problem set: 11 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 483 constraints, problems are : Problem set: 11 solved, 283 unsolved in 12685 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 283/294 constraints, Known Traps: 14/14 constraints]
After SMT, in 29224ms problems are : Problem set: 11 solved, 283 unsolved
Search for dead transitions found 11 dead transitions in 29246ms
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 : 182/254 places, 284/368 transitions.
Applied a total of 0 rules in 11 ms. Remains 182 /182 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29772 ms. Remains : 182/254 places, 284/368 transitions.
Support contains 40 out of 182 places after structural reductions.
[2024-06-02 19:37:10] [INFO ] Flatten gal took : 46 ms
[2024-06-02 19:37:10] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:37:10] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 38 out of 182 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2402 ms. (16 steps per ms) remains 18/27 properties
BEST_FIRST walk for 4000 steps (9 resets) in 179 ms. (22 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4001 steps (9 resets) in 100 ms. (39 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (9 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (10 resets) in 82 ms. (48 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (10 resets) in 90 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (10 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (9 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (10 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (9 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (10 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (9 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
// Phase 1: matrix 284 rows 182 cols
[2024-06-02 19:37:11] [INFO ] Computed 4 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 127/153 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 13 unsolved
[2024-06-02 19:37:11] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:37:11] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:37:11] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 2 ms to minimize.
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
Problem AtomicPropp13 is UNSAT
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 7/10 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/165 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:37:12] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 5/17 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 266/431 variables, 165/182 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/182 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 9/440 variables, 4/186 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/186 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 10/450 variables, 5/191 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 0/191 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 6/456 variables, 3/194 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/194 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 7/463 variables, 3/197 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/197 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 3/466 variables, 2/199 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/466 variables, 0/199 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 0/466 variables, 0/199 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 199 constraints, problems are : Problem set: 5 solved, 12 unsolved in 2483 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 137/153 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 9/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-02 19:37:14] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/165 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 4/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 266/431 variables, 165/183 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 12/195 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/195 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 9/440 variables, 4/199 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/199 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 10/450 variables, 5/204 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/204 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 6/456 variables, 3/207 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 7/463 variables, 3/210 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-02 19:37:15] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/463 variables, 1/211 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/463 variables, 0/211 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 3/466 variables, 2/213 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/466 variables, 0/213 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 0/466 variables, 0/213 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 213 constraints, problems are : Problem set: 5 solved, 12 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 15/15 constraints]
After SMT, in 4538ms problems are : Problem set: 5 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 4995 ms.
Support contains 16 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 284/284 transitions.
Graph (trivial) has 132 edges and 182 vertex of which 18 / 182 are part of one of the 3 SCC in 5 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 167 transition count 236
Reduce places removed 28 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 32 rules applied. Total rules applied 61 place count 139 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 137 transition count 232
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 63 place count 137 transition count 220
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 87 place count 125 transition count 220
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 123 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 123 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 92 place count 123 transition count 199
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 132 place count 103 transition count 179
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 160 place count 89 transition count 223
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 89 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 177 place count 89 transition count 206
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 190 place count 89 transition count 193
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 205 place count 76 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 229 place count 76 transition count 167
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 76 transition count 167
Applied a total of 231 rules in 98 ms. Remains 76 /182 variables (removed 106) and now considering 167/284 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 76/182 places, 167/284 transitions.
RANDOM walk for 40000 steps (3093 resets) in 392 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (948 resets) in 342 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1329 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1303 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1328 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1331 resets) in 117 ms. (338 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1330 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1344 resets) in 117 ms. (338 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1337 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1313 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1329 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1225 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1201 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 20023 steps, run visited all 12 properties in 96 ms. (steps per millisecond=208 )
Probabilistic random walk after 20023 steps, saw 6677 distinct states, run finished after 100 ms. (steps per millisecond=200 ) properties seen :12
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA FireWire-PT-16-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 23 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' '!(G((X(p0)&&((X(X(p1))&&F(p2))||X(X(G(p1)))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 176 transition count 269
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 176 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 174 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 174 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 174 transition count 266
Applied a total of 17 rules in 8 ms. Remains 174 /182 variables (removed 8) and now considering 266/284 (removed 18) transitions.
// Phase 1: matrix 266 rows 174 cols
[2024-06-02 19:37:22] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:37:22] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 19:37:22] [INFO ] Invariant cache hit.
[2024-06-02 19:37:23] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-02 19:37:23] [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:37:25] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:37:25] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:37:25] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:37:25] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-02 19:37:25] [INFO ] Deduced a trap composed of 88 places in 56 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
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:37:26] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/10 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 266/440 variables, 174/184 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:37:29] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:37:29] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 2/186 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:37:34] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:37:34] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:37:35] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/440 variables, 3/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 189 constraints, problems are : Problem set: 15 solved, 250 unsolved in 16856 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 11/11 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, 11/15 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 266/440 variables, 174/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 250/439 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:37:43] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/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
[2024-06-02 19:37:49] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/440 variables, 1/441 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 441 constraints, problems are : Problem set: 15 solved, 250 unsolved in 21351 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 250/265 constraints, Known Traps: 13/13 constraints]
After SMT, in 38265ms problems are : Problem set: 15 solved, 250 unsolved
Search for dead transitions found 15 dead transitions in 38272ms
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/182 places, 251/284 transitions.
Applied a total of 0 rules in 10 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 38589 ms. Remains : 174/182 places, 251/284 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-00 finished in 38897 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((X(p1)&&p0))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 175 transition count 268
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 175 transition count 268
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 172 transition count 265
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 172 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 172 transition count 263
Applied a total of 22 rules in 7 ms. Remains 172 /182 variables (removed 10) and now considering 263/284 (removed 21) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-06-02 19:38:01] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:38:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:38:01] [INFO ] Invariant cache hit.
[2024-06-02 19:38:01] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 19:38:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 19:38:03] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:38:03] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:38:03] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:38:03] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:38:03] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:38:03] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:38:03] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:38:04] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:38:04] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 2 ms to minimize.
[2024-06-02 19:38:04] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:38:04] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:38:04] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:38:04] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 19:38:05] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 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
[2024-06-02 19:38:05] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 4 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:05] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:38:05] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:07] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:38:07] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:38:07] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/24 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:08] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:38:08] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 263/435 variables, 172/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 198 constraints, problems are : Problem set: 15 solved, 247 unsolved in 13822 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:17] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/27 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:18] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/200 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/447 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:21] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 15 solved, 247 unsolved in 17143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 25/25 constraints]
After SMT, in 31021ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 31024ms
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 : 172/182 places, 248/284 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31262 ms. Remains : 172/182 places, 248/284 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-01
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 5 ms.
FORMULA FireWire-PT-16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-01 finished in 31422 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 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 175 transition count 268
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 175 transition count 268
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 172 transition count 265
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 172 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 172 transition count 263
Applied a total of 22 rules in 4 ms. Remains 172 /182 variables (removed 10) and now considering 263/284 (removed 21) transitions.
[2024-06-02 19:38:33] [INFO ] Invariant cache hit.
[2024-06-02 19:38:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 19:38:33] [INFO ] Invariant cache hit.
[2024-06-02 19:38:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 19:38:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 19:38:34] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:38:34] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:38:34] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 2 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:38:35] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 19:38:36] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 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
[2024-06-02 19:38:36] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:37] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 2 ms to minimize.
[2024-06-02 19:38:37] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:38] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:38:38] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:38:39] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/24 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:40] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:38:40] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 263/435 variables, 172/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 198 constraints, problems are : Problem set: 15 solved, 247 unsolved in 13812 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:48] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/27 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:49] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/200 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/447 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:38:52] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 15 solved, 247 unsolved in 16908 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 25/25 constraints]
After SMT, in 30765ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 30769ms
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 : 172/182 places, 248/284 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30970 ms. Remains : 172/182 places, 248/284 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 1 ms.
FORMULA FireWire-PT-16-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-16-LTLFireability-02 finished in 31233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Graph (trivial) has 149 edges and 182 vertex of which 18 / 182 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 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 166 transition count 238
Reduce places removed 29 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 33 rules applied. Total rules applied 63 place count 137 transition count 234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 135 transition count 234
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 65 place count 135 transition count 219
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 95 place count 120 transition count 219
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 116 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 116 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 116 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 104 place count 116 transition count 195
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 115 transition count 195
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 113 transition count 193
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 113 transition count 193
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 4 with 2 rules applied. Total rules applied 112 place count 113 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 113 place count 112 transition count 191
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 6 with 34 rules applied. Total rules applied 147 place count 95 transition count 174
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 183 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 6 with 21 rules applied. Total rules applied 204 place count 77 transition count 211
Applied a total of 204 rules in 34 ms. Remains 77 /182 variables (removed 105) and now considering 211/284 (removed 73) transitions.
[2024-06-02 19:39:04] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
// Phase 1: matrix 202 rows 77 cols
[2024-06-02 19:39:04] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 19:39:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:39:04] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2024-06-02 19:39:04] [INFO ] Invariant cache hit.
[2024-06-02 19:39:04] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:39:04] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 19:39:04] [INFO ] Redundant transitions in 9 ms returned []
Running 207 sub problems to find dead transitions.
[2024-06-02 19:39:04] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2024-06-02 19:39:04] [INFO ] Invariant cache hit.
[2024-06-02 19:39:04] [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:39:05] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
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 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, 8/12 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 201/278 variables, 77/89 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 32/121 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/121 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 0/121 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/279 variables, and 121 constraints, problems are : Problem set: 32 solved, 175 unsolved in 3816 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: 8/8 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, 3/4 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/7 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 5/12 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 201/278 variables, 77/89 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 32/121 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 175/296 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/296 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/296 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/279 variables, and 296 constraints, problems are : Problem set: 32 solved, 175 unsolved in 6446 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: 8/8 constraints]
After SMT, in 10368ms problems are : Problem set: 32 solved, 175 unsolved
Search for dead transitions found 32 dead transitions in 10371ms
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/182 places, 179/284 transitions.
Applied a total of 0 rules in 10 ms. Remains 77 /77 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-02 19:39:14] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 10618 ms. Remains : 77/182 places, 179/284 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-04 finished in 10664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Graph (trivial) has 148 edges and 182 vertex of which 18 / 182 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 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 166 transition count 238
Reduce places removed 29 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 33 rules applied. Total rules applied 63 place count 137 transition count 234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 135 transition count 234
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 65 place count 135 transition count 219
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 95 place count 120 transition count 219
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 115 transition count 196
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 115 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 115 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 106 place count 115 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 113 transition count 193
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 111 transition count 191
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 111 transition count 191
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 4 with 2 rules applied. Total rules applied 116 place count 111 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 110 transition count 189
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 149 place count 94 transition count 173
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 6 with 34 rules applied. Total rules applied 183 place count 77 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 204 place count 77 transition count 210
Applied a total of 204 rules in 39 ms. Remains 77 /182 variables (removed 105) and now considering 210/284 (removed 74) transitions.
[2024-06-02 19:39:15] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
// Phase 1: matrix 201 rows 77 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 53 ms returned []
[2024-06-02 19:39:15] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-02 19:39:15] [INFO ] Invariant cache hit.
[2024-06-02 19:39:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:39:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-02 19:39:15] [INFO ] Redundant transitions in 3 ms returned []
Running 206 sub problems to find dead transitions.
[2024-06-02 19:39:15] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-02 19:39:15] [INFO ] Invariant cache hit.
[2024-06-02 19:39:15] [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, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 40 places in 39 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 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 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 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 TDEAD98 is UNSAT
Problem TDEAD188 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
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 4/8 constraints. Problems are: Problem set: 32 solved, 174 unsolved
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:39:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 200/277 variables, 77/88 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 32/120 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/120 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/120 constraints. Problems are: Problem set: 32 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/278 variables, and 120 constraints, problems are : Problem set: 32 solved, 174 unsolved in 5101 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 32 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/7 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 4/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 200/277 variables, 77/88 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 32/120 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 174/294 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/294 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/294 constraints. Problems are: Problem set: 32 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/278 variables, and 294 constraints, problems are : Problem set: 32 solved, 174 unsolved in 6414 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 174/206 constraints, Known Traps: 7/7 constraints]
After SMT, in 11610ms problems are : Problem set: 32 solved, 174 unsolved
Search for dead transitions found 32 dead transitions in 11614ms
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/182 places, 178/284 transitions.
Applied a total of 0 rules in 9 ms. Remains 77 /77 variables (removed 0) and now considering 178/178 (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 11848 ms. Remains : 77/182 places, 178/284 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-06 finished in 11898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 176 transition count 269
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 176 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 174 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 174 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 174 transition count 266
Applied a total of 17 rules in 6 ms. Remains 174 /182 variables (removed 8) and now considering 266/284 (removed 18) transitions.
// Phase 1: matrix 266 rows 174 cols
[2024-06-02 19:39:26] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:39:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:39:26] [INFO ] Invariant cache hit.
[2024-06-02 19:39:27] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-02 19:39:27] [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:39:28] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:39:29] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:39:29] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:39:29] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-02 19:39:29] [INFO ] Deduced a trap composed of 88 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
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:39:30] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/10 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 266/440 variables, 174/184 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:39:33] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:39:33] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 2/186 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:39:38] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:39:38] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:39:39] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/440 variables, 3/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 189 constraints, problems are : Problem set: 15 solved, 250 unsolved in 16704 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 11/11 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, 11/15 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 266/440 variables, 174/189 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 250/439 constraints. Problems are: Problem set: 15 solved, 250 unsolved
[2024-06-02 19:39:47] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/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
[2024-06-02 19:39:53] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/440 variables, 1/441 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 441 constraints, problems are : Problem set: 15 solved, 250 unsolved in 21676 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 250/265 constraints, Known Traps: 13/13 constraints]
After SMT, in 38422ms problems are : Problem set: 15 solved, 250 unsolved
Search for dead transitions found 15 dead transitions in 38425ms
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/182 places, 251/284 transitions.
Applied a total of 0 rules in 4 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 38622 ms. Remains : 174/182 places, 251/284 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 126 ms.
Product exploration explored 100000 steps with 33333 reset in 117 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-16-LTLFireability-07 finished in 39016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (!p1 U p2))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 175 transition count 268
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 175 transition count 268
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 172 transition count 265
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 172 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 172 transition count 263
Applied a total of 22 rules in 5 ms. Remains 172 /182 variables (removed 10) and now considering 263/284 (removed 21) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-06-02 19:40:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:40:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 19:40:05] [INFO ] Invariant cache hit.
[2024-06-02 19:40:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 19:40:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:40:07] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 76 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:40:08] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 0 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 19:40:09] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 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
[2024-06-02 19:40:09] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:40:10] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:40:10] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:40:11] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:40:11] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:40:12] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/24 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:40:12] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:40:12] [INFO ] Deduced a trap composed of 95 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 263/435 variables, 172/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 198 constraints, problems are : Problem set: 15 solved, 247 unsolved in 13904 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:40:21] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/27 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:40:22] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/200 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/447 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:40:25] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 15 solved, 247 unsolved in 16976 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 25/25 constraints]
After SMT, in 30928ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 30930ms
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 : 172/182 places, 248/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31133 ms. Remains : 172/182 places, 248/284 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-09 finished in 31269 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)&&F(G(p1)))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Graph (trivial) has 146 edges and 182 vertex of which 18 / 182 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 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 166 transition count 240
Reduce places removed 27 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 31 rules applied. Total rules applied 59 place count 139 transition count 236
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 137 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 136 transition count 235
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 63 place count 136 transition count 220
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 93 place count 121 transition count 220
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 98 place count 116 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 103 place count 116 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 116 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 104 place count 116 transition count 194
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 108 place count 114 transition count 194
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 110 place count 112 transition count 192
Iterating global reduction 5 with 2 rules applied. Total rules applied 112 place count 112 transition count 192
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 5 with 2 rules applied. Total rules applied 114 place count 112 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 115 place count 111 transition count 190
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 147 place count 95 transition count 174
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 181 place count 78 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 200 place count 78 transition count 211
Applied a total of 200 rules in 31 ms. Remains 78 /182 variables (removed 104) and now considering 211/284 (removed 73) transitions.
[2024-06-02 19:40:37] [INFO ] Flow matrix only has 205 transitions (discarded 6 similar events)
// Phase 1: matrix 205 rows 78 cols
[2024-06-02 19:40:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:40:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 19:40:37] [INFO ] Flow matrix only has 205 transitions (discarded 6 similar events)
[2024-06-02 19:40:37] [INFO ] Invariant cache hit.
[2024-06-02 19:40:37] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:40:37] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 19:40:37] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-06-02 19:40:37] [INFO ] Flow matrix only has 205 transitions (discarded 6 similar events)
[2024-06-02 19:40:37] [INFO ] Invariant cache hit.
[2024-06-02 19:40:37] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-02 19:40:38] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:40:38] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-02 19:40:38] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:40:38] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-02 19:40:38] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 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 TDEAD85 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem 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/78 variables, 5/9 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 204/282 variables, 78/87 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 32/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/283 variables, and 119 constraints, problems are : Problem set: 32 solved, 175 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 32 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 3/5 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 4/9 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 204/282 variables, 78/87 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 32/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 175/294 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/294 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/294 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/283 variables, and 294 constraints, problems are : Problem set: 32 solved, 175 unsolved in 5823 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 175/207 constraints, Known Traps: 5/5 constraints]
After SMT, in 9589ms problems are : Problem set: 32 solved, 175 unsolved
Search for dead transitions found 32 dead transitions in 9592ms
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 : 78/182 places, 179/284 transitions.
Applied a total of 0 rules in 9 ms. Remains 78 /78 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-02 19:40:46] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 9802 ms. Remains : 78/182 places, 179/284 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-10 finished in 9918 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 U p1))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Graph (trivial) has 146 edges and 182 vertex of which 14 / 182 are part of one of the 2 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 169 transition count 242
Reduce places removed 28 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 32 rules applied. Total rules applied 61 place count 141 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 139 transition count 238
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 63 place count 139 transition count 222
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 95 place count 123 transition count 222
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 118 transition count 199
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 118 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 118 transition count 198
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 106 place count 118 transition count 196
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 116 transition count 196
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 114 transition count 194
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 114 transition count 194
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 4 with 2 rules applied. Total rules applied 116 place count 114 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 113 transition count 192
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 6 with 32 rules applied. Total rules applied 149 place count 97 transition count 176
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 185 place count 79 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 206 place count 79 transition count 213
Applied a total of 206 rules in 20 ms. Remains 79 /182 variables (removed 103) and now considering 213/284 (removed 71) transitions.
[2024-06-02 19:40:47] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 79 cols
[2024-06-02 19:40:47] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 19:40:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 19:40:47] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
[2024-06-02 19:40:47] [INFO ] Invariant cache hit.
[2024-06-02 19:40:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 19:40:47] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 19:40:47] [INFO ] Redundant transitions in 1 ms returned []
Running 209 sub problems to find dead transitions.
[2024-06-02 19:40:47] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
[2024-06-02 19:40:47] [INFO ] Invariant cache hit.
[2024-06-02 19:40:47] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 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 TDEAD191 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
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 7/11 constraints. Problems are: Problem set: 32 solved, 177 unsolved
[2024-06-02 19:40:49] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/12 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 204/283 variables, 79/91 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 32/123 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/123 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/124 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/124 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/284 variables, 0/124 constraints. Problems are: Problem set: 32 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 124 constraints, problems are : Problem set: 32 solved, 177 unsolved in 6146 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 32 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 4/5 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/8 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 4/12 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 204/283 variables, 79/91 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 32/123 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 177/300 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/300 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 1/284 variables, 1/301 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/301 constraints. Problems are: Problem set: 32 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/284 variables, 0/301 constraints. Problems are: Problem set: 32 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 301 constraints, problems are : Problem set: 32 solved, 177 unsolved in 9653 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 177/209 constraints, Known Traps: 8/8 constraints]
After SMT, in 15877ms problems are : Problem set: 32 solved, 177 unsolved
Search for dead transitions found 32 dead transitions in 15880ms
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/182 places, 181/284 transitions.
Applied a total of 0 rules in 8 ms. Remains 79 /79 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-06-02 19:41:03] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 16086 ms. Remains : 79/182 places, 181/284 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-11 finished in 16160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((!p1 U p2)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 177 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 177 transition count 279
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 175 transition count 277
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 175 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 175 transition count 276
Applied a total of 15 rules in 5 ms. Remains 175 /182 variables (removed 7) and now considering 276/284 (removed 8) transitions.
// Phase 1: matrix 276 rows 175 cols
[2024-06-02 19:41:03] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:41:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:41:03] [INFO ] Invariant cache hit.
[2024-06-02 19:41:03] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-06-02 19:41:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 19:41:05] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:41:05] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:41:05] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
[2024-06-02 19:41:06] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
[2024-06-02 19:41:06] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 260 unsolved
[2024-06-02 19:41:06] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 276/451 variables, 175/185 constraints. Problems are: Problem set: 15 solved, 260 unsolved
[2024-06-02 19:41:09] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:41:10] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 2/187 constraints. Problems are: Problem set: 15 solved, 260 unsolved
[2024-06-02 19:41:13] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:41:13] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:41:14] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 3/190 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/190 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/451 variables, 0/190 constraints. Problems are: Problem set: 15 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 190 constraints, problems are : Problem set: 15 solved, 260 unsolved in 16242 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 15 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 276/451 variables, 175/190 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 260/450 constraints. Problems are: Problem set: 15 solved, 260 unsolved
[2024-06-02 19:41:23] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 3 ms to minimize.
[2024-06-02 19:41:23] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 2/452 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/452 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/452 constraints. Problems are: Problem set: 15 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 452 constraints, problems are : Problem set: 15 solved, 260 unsolved in 15722 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 260/275 constraints, Known Traps: 13/13 constraints]
After SMT, in 32016ms problems are : Problem set: 15 solved, 260 unsolved
Search for dead transitions found 15 dead transitions in 32018ms
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 : 175/182 places, 261/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32244 ms. Remains : 175/182 places, 261/284 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-12
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-12 finished in 32394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 176 transition count 269
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 176 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 174 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 174 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 174 transition count 265
Applied a total of 18 rules in 3 ms. Remains 174 /182 variables (removed 8) and now considering 265/284 (removed 19) transitions.
// Phase 1: matrix 265 rows 174 cols
[2024-06-02 19:41:35] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:41:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 19:41:35] [INFO ] Invariant cache hit.
[2024-06-02 19:41:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-02 19:41:35] [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:41:37] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:41:37] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:41:38] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-02 19:41:38] [INFO ] Deduced a trap composed of 86 places in 57 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:41:38] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-06-02 19:41:38] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:41:38] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:41:39] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:41:40] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 2/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 265/439 variables, 174/187 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:41:42] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:41:42] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/439 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 189 constraints, problems are : Problem set: 15 solved, 249 unsolved in 12400 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 11/11 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, 11/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 249/438 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 19:41:51] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:41:52] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/439 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 440 constraints, problems are : Problem set: 15 solved, 249 unsolved in 13351 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 13/13 constraints]
After SMT, in 25794ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 25797ms
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/182 places, 250/284 transitions.
Applied a total of 0 rules in 1 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 26001 ms. Remains : 174/182 places, 250/284 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-13 finished in 26092 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((X(G(p1))||p0))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 284/284 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 175 transition count 268
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 175 transition count 268
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 172 transition count 265
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 172 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 172 transition count 263
Applied a total of 22 rules in 4 ms. Remains 172 /182 variables (removed 10) and now considering 263/284 (removed 21) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-06-02 19:42:01] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:42:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 19:42:01] [INFO ] Invariant cache hit.
[2024-06-02 19:42:01] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 19:42:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 19:42:03] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:42:03] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:42:03] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:42:03] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:42:03] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:42:03] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:42:03] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:42:04] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:42:04] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:42:04] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:42:04] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:42:04] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:42:04] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 19:42:05] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 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
[2024-06-02 19:42:05] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:42:05] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:42:05] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:42:07] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:42:07] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:42:07] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/24 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:42:08] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:42:08] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 263/435 variables, 172/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 198 constraints, problems are : Problem set: 15 solved, 247 unsolved in 13924 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:42:17] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/27 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:42:18] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/200 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/447 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 19:42:21] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 15 solved, 247 unsolved in 17096 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 25/25 constraints]
After SMT, in 31065ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 31067ms
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 : 172/182 places, 248/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31299 ms. Remains : 172/182 places, 248/284 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-15 finished in 31447 ms.
All properties solved by simple procedures.
Total runtime 352975 ms.
ITS solved all properties within timeout

BK_STOP 1717357353211

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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 LTLFireability -timeout 360 -rebuildPNML

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="LTLFireability"
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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901300292"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;