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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-07-LTLCardinality-00
FORMULA_NAME FireWire-PT-07-LTLCardinality-01
FORMULA_NAME FireWire-PT-07-LTLCardinality-02
FORMULA_NAME FireWire-PT-07-LTLCardinality-03
FORMULA_NAME FireWire-PT-07-LTLCardinality-04
FORMULA_NAME FireWire-PT-07-LTLCardinality-05
FORMULA_NAME FireWire-PT-07-LTLCardinality-06
FORMULA_NAME FireWire-PT-07-LTLCardinality-07
FORMULA_NAME FireWire-PT-07-LTLCardinality-08
FORMULA_NAME FireWire-PT-07-LTLCardinality-09
FORMULA_NAME FireWire-PT-07-LTLCardinality-10
FORMULA_NAME FireWire-PT-07-LTLCardinality-11
FORMULA_NAME FireWire-PT-07-LTLCardinality-12
FORMULA_NAME FireWire-PT-07-LTLCardinality-13
FORMULA_NAME FireWire-PT-07-LTLCardinality-14
FORMULA_NAME FireWire-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717354341216

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:52:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:52:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:52:22] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 18:52:22] [INFO ] Transformed 126 places.
[2024-06-02 18:52:22] [INFO ] Transformed 396 transitions.
[2024-06-02 18:52:22] [INFO ] Found NUPN structural information;
[2024-06-02 18:52:22] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 121 transition count 329
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 119 transition count 325
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 119 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 119 transition count 319
Applied a total of 22 rules in 45 ms. Remains 119 /126 variables (removed 7) and now considering 319/343 (removed 24) transitions.
[2024-06-02 18:52:22] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
// Phase 1: matrix 293 rows 119 cols
[2024-06-02 18:52:22] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 18:52:22] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-02 18:52:22] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 18:52:22] [INFO ] Invariant cache hit.
[2024-06-02 18:52:23] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 18:52:23] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-06-02 18:52:23] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 18:52:23] [INFO ] Invariant cache hit.
[2024-06-02 18:52:23] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 18:52:25] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 12 ms to minimize.
[2024-06-02 18:52:25] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:52:25] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:52:25] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:52:25] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:52:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:52:26] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:52:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:52:26] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 18:52:26] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 292/411 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 1/412 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 180 constraints, problems are : Problem set: 0 solved, 318 unsolved in 11328 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 292/411 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 318/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 1/412 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 498 constraints, problems are : Problem set: 0 solved, 318 unsolved in 26146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 10/10 constraints]
After SMT, in 37859ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 37889ms
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 319/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38385 ms. Remains : 119/126 places, 319/343 transitions.
Support contains 41 out of 119 places after structural reductions.
[2024-06-02 18:53:01] [INFO ] Flatten gal took : 50 ms
[2024-06-02 18:53:01] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:53:01] [INFO ] Input system was already deterministic with 319 transitions.
RANDOM walk for 40000 steps (2261 resets) in 1746 ms. (22 steps per ms) remains 13/26 properties
BEST_FIRST walk for 40003 steps (566 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (629 resets) in 140 ms. (283 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (617 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (757 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (596 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (618 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (533 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (550 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (704 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (591 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (518 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (509 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
[2024-06-02 18:53:02] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 18:53:02] [INFO ] Invariant cache hit.
[2024-06-02 18:53:02] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 93/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/117 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 292/409 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 42/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 2/411 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/412 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/412 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 170 constraints, problems are : Problem set: 0 solved, 13 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 93/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 292/409 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:53:04] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2/411 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/412 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/412 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 189 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1766 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 6/6 constraints]
After SMT, in 2348ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 5 properties in 4121 ms.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 319/319 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 119 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 117 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 117 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 117 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 116 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 116 transition count 308
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 114 transition count 312
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 114 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 114 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 114 transition count 308
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 24 place count 113 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 113 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 112 transition count 303
Applied a total of 27 rules in 101 ms. Remains 112 /119 variables (removed 7) and now considering 303/319 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 112/119 places, 303/319 transitions.
RANDOM walk for 40000 steps (2434 resets) in 306 ms. (130 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (547 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (756 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (583 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (688 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (528 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (514 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (507 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 714551 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :3 out of 8
Probabilistic random walk after 714551 steps, saw 155870 distinct states, run finished after 3021 ms. (steps per millisecond=236 ) properties seen :3
[2024-06-02 18:53:12] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
// Phase 1: matrix 276 rows 112 cols
[2024-06-02 18:53:12] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 18:53:12] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 274/380 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 42/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 8/388 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 162 constraints, problems are : Problem set: 0 solved, 5 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:53:12] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:53:12] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 274/380 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:53:12] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 8/388 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 170 constraints, problems are : Problem set: 0 solved, 5 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1161 ms.
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 112/112 places, 303/303 transitions.
RANDOM walk for 40000 steps (2284 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (593 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (765 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (667 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (521 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 725371 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 5
Probabilistic random walk after 725371 steps, saw 158571 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2024-06-02 18:53:17] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 18:53:17] [INFO ] Invariant cache hit.
[2024-06-02 18:53:17] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 274/380 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 42/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 8/388 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 162 constraints, problems are : Problem set: 0 solved, 5 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:53:17] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 274/380 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/388 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 169 constraints, problems are : Problem set: 0 solved, 5 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 942 ms.
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 112/112 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-06-02 18:53:19] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 18:53:19] [INFO ] Invariant cache hit.
[2024-06-02 18:53:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:53:19] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 18:53:19] [INFO ] Invariant cache hit.
[2024-06-02 18:53:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:53:19] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 18:53:19] [INFO ] Redundant transitions in 14 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-02 18:53:19] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 18:53:19] [INFO ] Invariant cache hit.
[2024-06-02 18:53:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 18:53:20] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:53:20] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:53:20] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-06-02 18:53:20] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:53:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:53:20] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:53:20] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:53:21] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 18:53:21] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 276/387 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 42/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 18:53:25] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:53:25] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 18:53:32] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/388 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 301 unsolved in 19462 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 276/387 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 301/474 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 475 constraints, problems are : Problem set: 0 solved, 301 unsolved in 17614 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
After SMT, in 37294ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 37299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37560 ms. Remains : 112/112 places, 303/303 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 89 edges and 112 vertex of which 22 / 112 are part of one of the 3 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 92 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 91 transition count 194
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 90 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 90 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 90 transition count 192
Applied a total of 18 rules in 28 ms. Remains 90 /112 variables (removed 22) and now considering 192/303 (removed 111) transitions.
Running SMT prover for 5 properties.
[2024-06-02 18:53:56] [INFO ] Flow matrix only has 191 transitions (discarded 1 similar events)
// Phase 1: matrix 191 rows 90 cols
[2024-06-02 18:53:56] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 18:53:56] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 18:53:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:56] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 18:53:57] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 1
[2024-06-02 18:53:57] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 4 ms to minimize.
[2024-06-02 18:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
TRAPS : Iteration 2
[2024-06-02 18:53:57] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 18:53:57] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 501 ms.
Computed a total of 21 stabilizing places and 45 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(p1 U G(p2))))'
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 117 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 116 transition count 314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 114 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 114 transition count 314
Applied a total of 13 rules in 25 ms. Remains 114 /119 variables (removed 5) and now considering 314/319 (removed 5) transitions.
[2024-06-02 18:53:57] [INFO ] Flow matrix only has 284 transitions (discarded 30 similar events)
// Phase 1: matrix 284 rows 114 cols
[2024-06-02 18:53:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:53:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:53:57] [INFO ] Flow matrix only has 284 transitions (discarded 30 similar events)
[2024-06-02 18:53:57] [INFO ] Invariant cache hit.
[2024-06-02 18:53:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 18:53:57] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 18:53:57] [INFO ] Redundant transitions in 8 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-02 18:53:57] [INFO ] Flow matrix only has 284 transitions (discarded 30 similar events)
[2024-06-02 18:53:57] [INFO ] Invariant cache hit.
[2024-06-02 18:53:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:53:58] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 283/396 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:54:02] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/398 variables, and 176 constraints, problems are : Problem set: 0 solved, 311 unsolved in 14671 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 283/396 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 43/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 311/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:54:21] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:54:30] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/397 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 12 (OVERLAPS) 0/397 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/398 variables, and 489 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 13/13 constraints]
After SMT, in 44912ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 44915ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/119 places, 314/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45252 ms. Remains : 114/119 places, 314/319 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-00 finished in 45558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(G(p1)))))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 106 transition count 287
Applied a total of 27 rules in 18 ms. Remains 106 /119 variables (removed 13) and now considering 287/319 (removed 32) transitions.
[2024-06-02 18:54:43] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 18:54:43] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:54:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:54:43] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 18:54:43] [INFO ] Invariant cache hit.
[2024-06-02 18:54:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:54:43] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 18:54:43] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 18:54:43] [INFO ] Invariant cache hit.
[2024-06-02 18:54:43] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:54:44] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:54:44] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-02 18:54:44] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 3 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10379 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21487 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32013ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32016ms
Starting structural reductions in LTL mode, iteration 1 : 106/119 places, 287/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32241 ms. Remains : 106/119 places, 287/319 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 138 ms.
Entered a terminal (fully accepting) state of product in 36 steps with 1 reset in 1 ms.
FORMULA FireWire-PT-07-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-01 finished in 32596 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)) U G(p1)))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 110 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 109 transition count 296
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 106 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 106 transition count 296
Applied a total of 31 rules in 34 ms. Remains 106 /119 variables (removed 13) and now considering 296/319 (removed 23) transitions.
[2024-06-02 18:55:15] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
// Phase 1: matrix 263 rows 106 cols
[2024-06-02 18:55:15] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:55:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:55:15] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:55:15] [INFO ] Invariant cache hit.
[2024-06-02 18:55:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:55:16] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-06-02 18:55:16] [INFO ] Redundant transitions in 5 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-02 18:55:16] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:55:16] [INFO ] Invariant cache hit.
[2024-06-02 18:55:16] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:55:17] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:55:18] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 163 constraints, problems are : Problem set: 0 solved, 293 unsolved in 11616 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 293/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:55:36] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:55:48] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/368 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 458 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 12/12 constraints]
After SMT, in 41793ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 41796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/119 places, 296/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42211 ms. Remains : 106/119 places, 296/319 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-02
Product exploration explored 100000 steps with 1 reset in 91 ms.
Product exploration explored 100000 steps with 1 reset in 90 ms.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (2333 resets) in 67 ms. (588 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-06-02 18:55:58] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:55:58] [INFO ] Invariant cache hit.
[2024-06-02 18:55:58] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/257 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/322 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 28/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/365 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/368 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:55:58] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 191/257 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/322 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 42/365 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 11/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/368 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/369 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 308ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 105 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 103 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 103 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 102 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 102 transition count 281
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 283
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 101 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 101 transition count 279
Applied a total of 20 rules in 22 ms. Remains 101 /106 variables (removed 5) and now considering 279/296 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 101/106 places, 279/296 transitions.
RANDOM walk for 40000 steps (2314 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 660105 steps, run visited all 1 properties in 918 ms. (steps per millisecond=719 )
Probabilistic random walk after 660105 steps, saw 146375 distinct states, run finished after 921 ms. (steps per millisecond=716 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-02 18:56:00] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:56:00] [INFO ] Invariant cache hit.
[2024-06-02 18:56:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 18:56:00] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:56:00] [INFO ] Invariant cache hit.
[2024-06-02 18:56:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:56:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 18:56:00] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-02 18:56:00] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:56:00] [INFO ] Invariant cache hit.
[2024-06-02 18:56:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:56:02] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:56:02] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 163 constraints, problems are : Problem set: 0 solved, 293 unsolved in 11789 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 293/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:56:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:56:33] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/368 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 458 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 12/12 constraints]
After SMT, in 41971ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 41975ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42178 ms. Remains : 106/106 places, 296/296 transitions.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (2356 resets) in 158 ms. (251 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-06-02 18:56:42] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:56:42] [INFO ] Invariant cache hit.
[2024-06-02 18:56:42] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/257 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/322 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 28/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/365 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/368 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 191/257 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/322 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 42/365 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 11/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/368 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/369 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 105 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 103 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 103 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 102 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 102 transition count 281
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 283
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 101 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 101 transition count 279
Applied a total of 20 rules in 18 ms. Remains 101 /106 variables (removed 5) and now considering 279/296 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 101/106 places, 279/296 transitions.
RANDOM walk for 40000 steps (2417 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 660105 steps, run visited all 1 properties in 925 ms. (steps per millisecond=713 )
Probabilistic random walk after 660105 steps, saw 146375 distinct states, run finished after 925 ms. (steps per millisecond=713 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 57 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 296/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-02 18:56:44] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:56:44] [INFO ] Invariant cache hit.
[2024-06-02 18:56:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:56:44] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:56:44] [INFO ] Invariant cache hit.
[2024-06-02 18:56:44] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:56:44] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-02 18:56:44] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-02 18:56:44] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 18:56:44] [INFO ] Invariant cache hit.
[2024-06-02 18:56:44] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:56:45] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:56:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:56:45] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:56:45] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:56:45] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:56:45] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:56:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:56:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-06-02 18:56:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:56:46] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 163 constraints, problems are : Problem set: 0 solved, 293 unsolved in 11628 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 293/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:57:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:57:17] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/368 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 458 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 12/12 constraints]
After SMT, in 41795ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 41798ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42040 ms. Remains : 106/106 places, 296/296 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-02 finished in 130680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Applied a total of 9 rules in 7 ms. Remains 115 /119 variables (removed 4) and now considering 308/319 (removed 11) transitions.
[2024-06-02 18:57:26] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 18:57:26] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:57:26] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-02 18:57:26] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 18:57:26] [INFO ] Invariant cache hit.
[2024-06-02 18:57:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:57:26] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 18:57:26] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 18:57:26] [INFO ] Invariant cache hit.
[2024-06-02 18:57:26] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 18:57:28] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:57:28] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:57:28] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:57:28] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:57:28] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:57:28] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:57:29] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:57:29] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-06-02 18:57:29] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:57:29] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 174 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11994 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 481 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 42151ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 42155ms
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 308/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42564 ms. Remains : 115/119 places, 308/319 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-07-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-03 finished in 42780 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(p1))||p0)))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 116 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 116 transition count 311
Applied a total of 6 rules in 4 ms. Remains 116 /119 variables (removed 3) and now considering 311/319 (removed 8) transitions.
[2024-06-02 18:58:09] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 116 cols
[2024-06-02 18:58:09] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:58:09] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:58:09] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 18:58:09] [INFO ] Invariant cache hit.
[2024-06-02 18:58:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:58:09] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-06-02 18:58:09] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 18:58:09] [INFO ] Invariant cache hit.
[2024-06-02 18:58:09] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 18:58:11] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:58:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:58:11] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-06-02 18:58:11] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:58:11] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:58:11] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:58:11] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 172 constraints, problems are : Problem set: 0 solved, 310 unsolved in 12388 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 310/481 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 482 constraints, problems are : Problem set: 0 solved, 310 unsolved in 25393 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints]
After SMT, in 37936ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 37940ms
Starting structural reductions in LTL mode, iteration 1 : 116/119 places, 311/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38193 ms. Remains : 116/119 places, 311/319 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Computed a total of 18 stabilizing places and 37 stable transitions
Computed a total of 18 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-04 finished in 38632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 109 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 108 transition count 294
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 105 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 105 transition count 294
Applied a total of 33 rules in 20 ms. Remains 105 /119 variables (removed 14) and now considering 294/319 (removed 25) transitions.
[2024-06-02 18:58:47] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
// Phase 1: matrix 261 rows 105 cols
[2024-06-02 18:58:47] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:58:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:58:47] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 18:58:47] [INFO ] Invariant cache hit.
[2024-06-02 18:58:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:58:48] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-06-02 18:58:48] [INFO ] Redundant transitions in 1 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-02 18:58:48] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 18:58:48] [INFO ] Invariant cache hit.
[2024-06-02 18:58:48] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 18:58:48] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:58:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:58:49] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:58:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:58:49] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:58:49] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:58:49] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 18:58:52] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:58:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 291 unsolved in 12873 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 291/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 18:59:03] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 454 constraints, problems are : Problem set: 0 solved, 291 unsolved in 26462 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 11/11 constraints]
After SMT, in 39473ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 39476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/119 places, 294/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39778 ms. Remains : 105/119 places, 294/319 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Computed a total of 11 stabilizing places and 23 stable transitions
Computed a total of 11 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2317 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (830 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2358032 steps, run timeout after 3001 ms. (steps per millisecond=785 ) properties seen :0 out of 1
Probabilistic random walk after 2358032 steps, saw 430437 distinct states, run finished after 3001 ms. (steps per millisecond=785 ) properties seen :0
[2024-06-02 18:59:30] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 18:59:30] [INFO ] Invariant cache hit.
[2024-06-02 18:59:30] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/365 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/365 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 294/294 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 290
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 104 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 104 transition count 286
Applied a total of 12 rules in 11 ms. Remains 104 /105 variables (removed 1) and now considering 286/294 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 104/105 places, 286/294 transitions.
RANDOM walk for 40000 steps (2376 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (720 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1986806 steps, run timeout after 3001 ms. (steps per millisecond=662 ) properties seen :0 out of 1
Probabilistic random walk after 1986806 steps, saw 405349 distinct states, run finished after 3001 ms. (steps per millisecond=662 ) properties seen :0
[2024-06-02 18:59:34] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
// Phase 1: matrix 257 rows 104 cols
[2024-06-02 18:59:34] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:59:34] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/361 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/361 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/104 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 18:59:34] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 18:59:34] [INFO ] Invariant cache hit.
[2024-06-02 18:59:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:59:34] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 18:59:34] [INFO ] Invariant cache hit.
[2024-06-02 18:59:34] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:59:34] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-02 18:59:34] [INFO ] Redundant transitions in 1 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 18:59:34] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 18:59:34] [INFO ] Invariant cache hit.
[2024-06-02 18:59:34] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:59:35] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:59:35] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:59:35] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:59:35] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:59:35] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:59:36] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:59:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 18:59:39] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:59:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 160 constraints, problems are : Problem set: 0 solved, 284 unsolved in 12773 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 284/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 444 constraints, problems are : Problem set: 0 solved, 284 unsolved in 14171 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
After SMT, in 27122ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 27126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27341 ms. Remains : 104/104 places, 286/286 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 104 vertex of which 27 / 104 are part of one of the 3 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 79 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 79 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 78 transition count 162
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 78 transition count 161
Applied a total of 13 rules in 14 ms. Remains 78 /104 variables (removed 26) and now considering 161/286 (removed 125) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:00:01] [INFO ] Flow matrix only has 159 transitions (discarded 2 similar events)
// Phase 1: matrix 159 rows 78 cols
[2024-06-02 19:00:01] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:00:01] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:00:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 19:00:01] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 1
[2024-06-02 19:00:01] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:00:01] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 175 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-02 19:00:02] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
// Phase 1: matrix 261 rows 105 cols
[2024-06-02 19:00:02] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:00:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:00:02] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 19:00:02] [INFO ] Invariant cache hit.
[2024-06-02 19:00:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:00:02] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-02 19:00:02] [INFO ] Redundant transitions in 2 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-02 19:00:02] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 19:00:02] [INFO ] Invariant cache hit.
[2024-06-02 19:00:02] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:00:03] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:00:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-02 19:00:03] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:00:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:00:03] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:00:03] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:00:04] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:00:06] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:00:07] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 291 unsolved in 13312 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 291/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:00:18] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:00:24] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 454 constraints, problems are : Problem set: 0 solved, 291 unsolved in 27029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 11/11 constraints]
After SMT, in 40479ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 40482ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40684 ms. Remains : 105/105 places, 294/294 transitions.
Computed a total of 11 stabilizing places and 23 stable transitions
Computed a total of 11 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2309 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (735 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2397292 steps, run timeout after 3001 ms. (steps per millisecond=798 ) properties seen :0 out of 1
Probabilistic random walk after 2397292 steps, saw 436869 distinct states, run finished after 3001 ms. (steps per millisecond=798 ) properties seen :0
[2024-06-02 19:00:46] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 19:00:46] [INFO ] Invariant cache hit.
[2024-06-02 19:00:46] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/365 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/365 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 294/294 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 290
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 104 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 104 transition count 286
Applied a total of 12 rules in 10 ms. Remains 104 /105 variables (removed 1) and now considering 286/294 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 104/105 places, 286/294 transitions.
RANDOM walk for 40000 steps (2358 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (766 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2242202 steps, run timeout after 3001 ms. (steps per millisecond=747 ) properties seen :0 out of 1
Probabilistic random walk after 2242202 steps, saw 448858 distinct states, run finished after 3001 ms. (steps per millisecond=747 ) properties seen :0
[2024-06-02 19:00:49] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
// Phase 1: matrix 257 rows 104 cols
[2024-06-02 19:00:49] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:00:49] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/361 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/361 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 19:00:49] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 19:00:49] [INFO ] Invariant cache hit.
[2024-06-02 19:00:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:00:49] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 19:00:49] [INFO ] Invariant cache hit.
[2024-06-02 19:00:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:00:49] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-02 19:00:49] [INFO ] Redundant transitions in 1 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 19:00:49] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 19:00:49] [INFO ] Invariant cache hit.
[2024-06-02 19:00:49] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 19:00:50] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:00:50] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:00:50] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:00:51] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:00:51] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:00:51] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:00:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 19:00:54] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:00:55] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 160 constraints, problems are : Problem set: 0 solved, 284 unsolved in 12764 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 284/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 444 constraints, problems are : Problem set: 0 solved, 284 unsolved in 14314 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
After SMT, in 27240ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 27244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27458 ms. Remains : 104/104 places, 286/286 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 104 vertex of which 27 / 104 are part of one of the 3 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 79 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 79 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 78 transition count 162
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 78 transition count 161
Applied a total of 13 rules in 16 ms. Remains 78 /104 variables (removed 26) and now considering 161/286 (removed 125) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:01:17] [INFO ] Flow matrix only has 159 transitions (discarded 2 similar events)
// Phase 1: matrix 159 rows 78 cols
[2024-06-02 19:01:17] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:01:17] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:01:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 19:01:17] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:01:17] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-02 19:01:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-02 19:01:17] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:01:17] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 178 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 42 ms.
Product exploration explored 100000 steps with 1 reset in 45 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 294/294 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-02 19:01:17] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
// Phase 1: matrix 261 rows 105 cols
[2024-06-02 19:01:17] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:01:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:01:17] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 19:01:17] [INFO ] Invariant cache hit.
[2024-06-02 19:01:17] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:01:17] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 19:01:17] [INFO ] Redundant transitions in 2 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-02 19:01:17] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 19:01:17] [INFO ] Invariant cache hit.
[2024-06-02 19:01:17] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:01:19] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:01:19] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:01:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:01:22] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:01:22] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 291 unsolved in 13056 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 291/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:01:33] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 19:01:39] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 454 constraints, problems are : Problem set: 0 solved, 291 unsolved in 26040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 11/11 constraints]
After SMT, in 39240ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 39243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39471 ms. Remains : 105/105 places, 294/294 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-05 finished in 189370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 105 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 101 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 101 transition count 285
Applied a total of 41 rules in 20 ms. Remains 101 /119 variables (removed 18) and now considering 285/319 (removed 34) transitions.
[2024-06-02 19:01:57] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
// Phase 1: matrix 252 rows 101 cols
[2024-06-02 19:01:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:01:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 19:01:57] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:01:57] [INFO ] Invariant cache hit.
[2024-06-02 19:01:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:01:57] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-02 19:01:57] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 19:01:57] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:01:57] [INFO ] Invariant cache hit.
[2024-06-02 19:01:57] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:01:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:59] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:01:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:01:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 159 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9444 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 441 constraints, problems are : Problem set: 0 solved, 282 unsolved in 13030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
After SMT, in 22609ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 22612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/119 places, 285/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22836 ms. Remains : 101/119 places, 285/319 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 42 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 68 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 8753 steps (483 resets) in 29 ms. (291 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 285/285 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 19:02:20] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:02:20] [INFO ] Invariant cache hit.
[2024-06-02 19:02:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 19:02:20] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:02:20] [INFO ] Invariant cache hit.
[2024-06-02 19:02:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:02:20] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 19:02:20] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 19:02:20] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:02:20] [INFO ] Invariant cache hit.
[2024-06-02 19:02:20] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 19:02:21] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:02:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:02:21] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:02:21] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:02:21] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:02:22] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:02:22] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:02:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:02:22] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:02:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:02:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:02:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 159 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9388 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 441 constraints, problems are : Problem set: 0 solved, 282 unsolved in 13183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
After SMT, in 22709ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 22712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22913 ms. Remains : 101/101 places, 285/285 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 5375 steps (322 resets) in 18 ms. (282 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 43 ms.
Product exploration explored 100000 steps with 0 reset in 46 ms.
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 285/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 19:02:44] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:02:44] [INFO ] Invariant cache hit.
[2024-06-02 19:02:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:02:44] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:02:44] [INFO ] Invariant cache hit.
[2024-06-02 19:02:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:02:44] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 19:02:44] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 19:02:44] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 19:02:44] [INFO ] Invariant cache hit.
[2024-06-02 19:02:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:02:45] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:02:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:02:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:02:46] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 159 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9569 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 441 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12574 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
After SMT, in 22281ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 22283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22501 ms. Remains : 101/101 places, 285/285 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-06 finished in 69570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p0)||G(p1))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Applied a total of 9 rules in 5 ms. Remains 115 /119 variables (removed 4) and now considering 308/319 (removed 11) transitions.
[2024-06-02 19:03:06] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 19:03:06] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:03:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:03:06] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 19:03:06] [INFO ] Invariant cache hit.
[2024-06-02 19:03:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 19:03:06] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 19:03:06] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 19:03:06] [INFO ] Invariant cache hit.
[2024-06-02 19:03:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 19:03:08] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:03:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:03:08] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:03:08] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:03:08] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
[2024-06-02 19:03:08] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2024-06-02 19:03:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:03:09] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:03:09] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2024-06-02 19:03:09] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 174 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11553 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 481 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 41715ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 41718ms
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 308/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41943 ms. Remains : 115/119 places, 308/319 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 18 stabilizing places and 37 stable transitions
Computed a total of 18 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-07 finished in 42418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Applied a total of 15 rules in 6 ms. Remains 112 /119 variables (removed 7) and now considering 301/319 (removed 18) transitions.
[2024-06-02 19:03:49] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 112 cols
[2024-06-02 19:03:49] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:03:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 19:03:49] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 19:03:49] [INFO ] Invariant cache hit.
[2024-06-02 19:03:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 19:03:49] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-02 19:03:49] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 19:03:49] [INFO ] Invariant cache hit.
[2024-06-02 19:03:49] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 19:03:50] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:03:51] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:03:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/386 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 172 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11613 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/386 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 300/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 472 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20083 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 12/12 constraints]
After SMT, in 31861ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 31864ms
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 301/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32129 ms. Remains : 112/119 places, 301/319 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-08 finished in 32229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(F(p2))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Applied a total of 9 rules in 10 ms. Remains 115 /119 variables (removed 4) and now considering 308/319 (removed 11) transitions.
[2024-06-02 19:04:21] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 19:04:21] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:04:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:04:21] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 19:04:21] [INFO ] Invariant cache hit.
[2024-06-02 19:04:21] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 19:04:21] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 19:04:21] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 19:04:21] [INFO ] Invariant cache hit.
[2024-06-02 19:04:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-06-02 19:04:24] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:04:24] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 174 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11778 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 481 constraints, problems are : Problem set: 0 solved, 307 unsolved in 29801 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 41732ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 41736ms
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 308/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41979 ms. Remains : 115/119 places, 308/319 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 18 stabilizing places and 37 stable transitions
Computed a total of 18 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-09 finished in 42360 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(p0))||G(p1)))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 106 transition count 287
Applied a total of 27 rules in 14 ms. Remains 106 /119 variables (removed 13) and now considering 287/319 (removed 32) transitions.
[2024-06-02 19:05:03] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 19:05:03] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:05:03] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 19:05:03] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:05:03] [INFO ] Invariant cache hit.
[2024-06-02 19:05:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:05:03] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 19:05:03] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:05:03] [INFO ] Invariant cache hit.
[2024-06-02 19:05:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 19:05:05] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:05:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:05:05] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:05:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:05:05] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:05:05] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:05:06] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:05:06] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 19:05:06] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:05:06] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10414 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21777 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32341ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32345ms
Starting structural reductions in LTL mode, iteration 1 : 106/119 places, 287/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32570 ms. Remains : 106/119 places, 287/319 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 1 reset in 48 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (2196 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (659 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2200619 steps, run timeout after 3001 ms. (steps per millisecond=733 ) properties seen :0 out of 1
Probabilistic random walk after 2200619 steps, saw 398873 distinct states, run finished after 3001 ms. (steps per millisecond=733 ) properties seen :0
[2024-06-02 19:05:39] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:05:39] [INFO ] Invariant cache hit.
[2024-06-02 19:05:39] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 260/364 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 37/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:05:40] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:05:40] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 260/364 variables, 104/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/366 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/367 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 104 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 104 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 104 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 104 transition count 284
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 103 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 103 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 102 transition count 279
Applied a total of 20 rules in 16 ms. Remains 102 /106 variables (removed 4) and now considering 279/287 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 102/106 places, 279/287 transitions.
RANDOM walk for 40000 steps (2303 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (652 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2124392 steps, run timeout after 3001 ms. (steps per millisecond=707 ) properties seen :0 out of 1
Probabilistic random walk after 2124392 steps, saw 428636 distinct states, run finished after 3001 ms. (steps per millisecond=707 ) properties seen :0
[2024-06-02 19:05:43] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
// Phase 1: matrix 252 rows 102 cols
[2024-06-02 19:05:43] [INFO ] Computed 8 invariants in 7 ms
[2024-06-02 19:05:43] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/351 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 21/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/354 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/351 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 21/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/354 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 102/102 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 19:05:43] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 19:05:43] [INFO ] Invariant cache hit.
[2024-06-02 19:05:43] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 19:05:43] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 19:05:43] [INFO ] Invariant cache hit.
[2024-06-02 19:05:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:05:43] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 19:05:43] [INFO ] Redundant transitions in 1 ms returned []
Running 277 sub problems to find dead transitions.
[2024-06-02 19:05:43] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 19:05:43] [INFO ] Invariant cache hit.
[2024-06-02 19:05:43] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 19:05:44] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:05:44] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:05:44] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-06-02 19:05:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:05:44] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:05:44] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:05:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:05:45] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:05:45] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/118 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 19:05:49] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-02 19:05:49] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:05:49] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:05:49] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 163 constraints, problems are : Problem set: 0 solved, 277 unsolved in 13843 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 277/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 440 constraints, problems are : Problem set: 0 solved, 277 unsolved in 15591 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
After SMT, in 29586ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 29590ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29801 ms. Remains : 102/102 places, 279/279 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 102 vertex of which 28 / 102 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 122 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 77 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 77 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 77 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 76 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 75 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 75 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 74 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 73 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 73 transition count 126
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 121
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 70 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 70 transition count 120
Applied a total of 26 rules in 20 ms. Remains 70 /102 variables (removed 32) and now considering 120/279 (removed 159) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:06:13] [INFO ] Flow matrix only has 118 transitions (discarded 2 similar events)
// Phase 1: matrix 118 rows 70 cols
[2024-06-02 19:06:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:06:13] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:06:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 19:06:13] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:06:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-02 19:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-06-02 19:06:13] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:06:13] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 165 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p1)]
Support contains 2 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 287/287 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 19:06:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 19:06:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:06:13] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:06:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:06:13] [INFO ] Invariant cache hit.
[2024-06-02 19:06:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:06:13] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 19:06:13] [INFO ] Redundant transitions in 1 ms returned []
Running 286 sub problems to find dead transitions.
[2024-06-02 19:06:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:06:13] [INFO ] Invariant cache hit.
[2024-06-02 19:06:13] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 19:06:15] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:06:15] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:06:15] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:06:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:06:15] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:06:15] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:06:16] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:06:16] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 19:06:16] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:06:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10612 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21899 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32662ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32872 ms. Remains : 106/106 places, 287/287 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (2207 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (669 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2390772 steps, run timeout after 3001 ms. (steps per millisecond=796 ) properties seen :0 out of 1
Probabilistic random walk after 2390772 steps, saw 428228 distinct states, run finished after 3001 ms. (steps per millisecond=796 ) properties seen :0
[2024-06-02 19:06:49] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:06:49] [INFO ] Invariant cache hit.
[2024-06-02 19:06:49] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 260/364 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 37/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:06:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:06:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 260/364 variables, 104/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/366 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/367 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 104 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 104 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 104 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 104 transition count 284
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 103 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 103 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 102 transition count 279
Applied a total of 20 rules in 16 ms. Remains 102 /106 variables (removed 4) and now considering 279/287 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 102/106 places, 279/287 transitions.
RANDOM walk for 40000 steps (2363 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (647 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2234701 steps, run timeout after 3001 ms. (steps per millisecond=744 ) properties seen :0 out of 1
Probabilistic random walk after 2234701 steps, saw 447171 distinct states, run finished after 3001 ms. (steps per millisecond=744 ) properties seen :0
[2024-06-02 19:06:53] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
// Phase 1: matrix 252 rows 102 cols
[2024-06-02 19:06:53] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:06:53] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/351 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 21/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/354 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/351 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 21/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/354 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 102/102 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 19:06:53] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 19:06:53] [INFO ] Invariant cache hit.
[2024-06-02 19:06:53] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 19:06:53] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 19:06:53] [INFO ] Invariant cache hit.
[2024-06-02 19:06:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:06:53] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-02 19:06:53] [INFO ] Redundant transitions in 1 ms returned []
Running 277 sub problems to find dead transitions.
[2024-06-02 19:06:53] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 19:06:53] [INFO ] Invariant cache hit.
[2024-06-02 19:06:53] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/118 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 19:06:57] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:06:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 19:06:59] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:06:59] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:06:59] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:06:59] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 163 constraints, problems are : Problem set: 0 solved, 277 unsolved in 13824 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 277/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 440 constraints, problems are : Problem set: 0 solved, 277 unsolved in 15473 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
After SMT, in 29422ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 29425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29636 ms. Remains : 102/102 places, 279/279 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 102 vertex of which 28 / 102 are part of one of the 4 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 122 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 77 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 77 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 77 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 76 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 75 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 75 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 74 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 73 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 73 transition count 126
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 121
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 70 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 70 transition count 120
Applied a total of 26 rules in 16 ms. Remains 70 /102 variables (removed 32) and now considering 120/279 (removed 159) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:07:23] [INFO ] Flow matrix only has 118 transitions (discarded 2 similar events)
// Phase 1: matrix 118 rows 70 cols
[2024-06-02 19:07:23] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:07:23] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:07:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 19:07:23] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:07:23] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-02 19:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-06-02 19:07:23] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:07:23] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 145 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 47 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 287/287 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 103 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 transition count 286
Applied a total of 8 rules in 7 ms. Remains 103 /106 variables (removed 3) and now considering 286/287 (removed 1) transitions.
[2024-06-02 19:07:23] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
// Phase 1: matrix 256 rows 103 cols
[2024-06-02 19:07:23] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:07:23] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:07:23] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 19:07:23] [INFO ] Invariant cache hit.
[2024-06-02 19:07:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:07:23] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-02 19:07:23] [INFO ] Redundant transitions in 1 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 19:07:23] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 19:07:23] [INFO ] Invariant cache hit.
[2024-06-02 19:07:23] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 19:07:24] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:07:24] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-06-02 19:07:24] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:07:24] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:07:24] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:07:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:07:25] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:07:25] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 19:07:25] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:07:26] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-02 19:07:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 255/357 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 19:07:27] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2024-06-02 19:07:28] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:07:28] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:07:28] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/358 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/359 variables, and 164 constraints, problems are : Problem set: 0 solved, 283 unsolved in 12667 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 255/357 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 283/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 19:07:41] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/358 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/359 variables, and 448 constraints, problems are : Problem set: 0 solved, 283 unsolved in 23234 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 16/16 constraints]
After SMT, in 36049ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 36052ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 286/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36252 ms. Remains : 103/106 places, 286/287 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-11 finished in 176015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 106 transition count 287
Applied a total of 27 rules in 8 ms. Remains 106 /119 variables (removed 13) and now considering 287/319 (removed 32) transitions.
[2024-06-02 19:07:59] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 19:07:59] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 19:07:59] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 19:07:59] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:07:59] [INFO ] Invariant cache hit.
[2024-06-02 19:07:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:07:59] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 19:07:59] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 19:07:59] [INFO ] Invariant cache hit.
[2024-06-02 19:07:59] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:08:02] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-06-02 19:08:02] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:08:02] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10296 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21510 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 31934ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 31937ms
Starting structural reductions in LTL mode, iteration 1 : 106/119 places, 287/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32133 ms. Remains : 106/119 places, 287/319 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 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 17 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-07-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-13 finished in 32461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||((!p1||X(F((!p2||G(!p3))))) U (G((!p1||X(F((!p2||G(!p3))))))||(!p3&&(!p1||X(F((!p2||G(!p3)))))))))))'
Support contains 8 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Applied a total of 7 rules in 2 ms. Remains 116 /119 variables (removed 3) and now considering 311/319 (removed 8) transitions.
[2024-06-02 19:08:32] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 116 cols
[2024-06-02 19:08:32] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:08:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:08:32] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 19:08:32] [INFO ] Invariant cache hit.
[2024-06-02 19:08:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 19:08:32] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-06-02 19:08:32] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 19:08:32] [INFO ] Invariant cache hit.
[2024-06-02 19:08:32] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 19:08:34] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:08:34] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:08:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:08:34] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:08:34] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 19:08:34] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:08:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:08:35] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2024-06-02 19:08:35] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 175 constraints, problems are : Problem set: 0 solved, 310 unsolved in 11853 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 485 constraints, problems are : Problem set: 0 solved, 310 unsolved in 27562 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 9/9 constraints]
After SMT, in 39581ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 39586ms
Starting structural reductions in LTL mode, iteration 1 : 116/119 places, 311/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39899 ms. Remains : 116/119 places, 311/319 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1 p3 p2), (AND p3 p2), (AND p3 p2 p0 p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-15 finished in 40054 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)) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
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(p0))||G(p1)))'
[2024-06-02 19:09:12] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:09:12] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-02 19:09:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 319 transitions and 1175 arcs took 16 ms.
Total runtime 1010585 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-07-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-07-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-07-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-07-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717355360831

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-07-LTLCardinality-02
ltl formula formula --ltl=/tmp/2676/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 119 places, 319 transitions and 1175 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2676/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2676/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2676/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2676/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 120 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 120, there are 343 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~25!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21
pnml2lts-mc( 0/ 4): unique states count: 83
pnml2lts-mc( 0/ 4): unique transitions count: 358
pnml2lts-mc( 0/ 4): - self-loop count: 44
pnml2lts-mc( 0/ 4): - claim dead count: 11
pnml2lts-mc( 0/ 4): - claim found count: 41
pnml2lts-mc( 0/ 4): - claim success count: 93
pnml2lts-mc( 0/ 4): - cum. max stack depth: 72
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 93 states 384 transitions, fanout: 4.129
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 21.6 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FireWire-PT-07-LTLCardinality-05
ltl formula formula --ltl=/tmp/2676/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 119 places, 319 transitions and 1175 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2676/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2676/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2676/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2676/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 121 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 120, there are 326 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~229 levels ~10000 states ~34928 transitions
pnml2lts-mc( 1/ 4): ~524 levels ~20000 states ~68208 transitions
pnml2lts-mc( 1/ 4): ~743 levels ~40000 states ~152736 transitions
pnml2lts-mc( 1/ 4): ~832 levels ~80000 states ~314520 transitions
pnml2lts-mc( 1/ 4): ~3541 levels ~160000 states ~677428 transitions
pnml2lts-mc( 1/ 4): ~3541 levels ~320000 states ~1393840 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~489!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 123646
pnml2lts-mc( 0/ 4): unique states count: 360476
pnml2lts-mc( 0/ 4): unique transitions count: 1747747
pnml2lts-mc( 0/ 4): - self-loop count: 135156
pnml2lts-mc( 0/ 4): - claim dead count: 562749
pnml2lts-mc( 0/ 4): - claim found count: 695999
pnml2lts-mc( 0/ 4): - claim success count: 362924
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10181
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 368892 states 1797202 transitions, fanout: 4.872
pnml2lts-mc( 0/ 4): Total exploration time 2.140 sec (2.120 sec minimum, 2.135 sec on average)
pnml2lts-mc( 0/ 4): States per second: 172379, Transitions per second: 839814
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.1MB, 8.9 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~256.0MB paged-in)
ltl formula name FireWire-PT-07-LTLCardinality-06
ltl formula formula --ltl=/tmp/2676/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 119 places, 319 transitions and 1175 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2676/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2676/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2676/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2676/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 121 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 120, there are 332 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~39!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 54
pnml2lts-mc( 0/ 4): unique states count: 209
pnml2lts-mc( 0/ 4): unique transitions count: 859
pnml2lts-mc( 0/ 4): - self-loop count: 97
pnml2lts-mc( 0/ 4): - claim dead count: 54
pnml2lts-mc( 0/ 4): - claim found count: 131
pnml2lts-mc( 0/ 4): - claim success count: 223
pnml2lts-mc( 0/ 4): - cum. max stack depth: 172
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 223 states 898 transitions, fanout: 4.027
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22300, Transitions per second: 89800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.5 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FireWire-PT-07-LTLCardinality-11
ltl formula formula --ltl=/tmp/2676/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 119 places, 319 transitions and 1175 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2676/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2676/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2676/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2676/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 121 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 120, there are 367 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~189 levels ~10000 states ~64096 transitions
pnml2lts-mc( 3/ 4): ~451 levels ~20000 states ~149412 transitions
pnml2lts-mc( 0/ 4): ~797 levels ~40000 states ~349532 transitions
pnml2lts-mc( 3/ 4): ~987 levels ~80000 states ~713644 transitions
pnml2lts-mc( 3/ 4): ~987 levels ~160000 states ~1395132 transitions
pnml2lts-mc( 2/ 4): ~2789 levels ~320000 states ~2802304 transitions
pnml2lts-mc( 2/ 4): ~3171 levels ~640000 states ~5674784 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~114!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 287995
pnml2lts-mc( 0/ 4): unique states count: 840234
pnml2lts-mc( 0/ 4): unique transitions count: 7540024
pnml2lts-mc( 0/ 4): - self-loop count: 592644
pnml2lts-mc( 0/ 4): - claim dead count: 2827339
pnml2lts-mc( 0/ 4): - claim found count: 3293909
pnml2lts-mc( 0/ 4): - claim success count: 843172
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13486
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 848222 states 7617428 transitions, fanout: 8.980
pnml2lts-mc( 0/ 4): Total exploration time 4.680 sec (4.680 sec minimum, 4.680 sec on average)
pnml2lts-mc( 0/ 4): States per second: 181244, Transitions per second: 1627656
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 7.0MB, 8.7 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 7.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901200219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-07.tgz
mv FireWire-PT-07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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