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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-06-LTLCardinality-00
FORMULA_NAME FireWire-PT-06-LTLCardinality-01
FORMULA_NAME FireWire-PT-06-LTLCardinality-02
FORMULA_NAME FireWire-PT-06-LTLCardinality-03
FORMULA_NAME FireWire-PT-06-LTLCardinality-04
FORMULA_NAME FireWire-PT-06-LTLCardinality-05
FORMULA_NAME FireWire-PT-06-LTLCardinality-06
FORMULA_NAME FireWire-PT-06-LTLCardinality-07
FORMULA_NAME FireWire-PT-06-LTLCardinality-08
FORMULA_NAME FireWire-PT-06-LTLCardinality-09
FORMULA_NAME FireWire-PT-06-LTLCardinality-10
FORMULA_NAME FireWire-PT-06-LTLCardinality-11
FORMULA_NAME FireWire-PT-06-LTLCardinality-12
FORMULA_NAME FireWire-PT-06-LTLCardinality-13
FORMULA_NAME FireWire-PT-06-LTLCardinality-14
FORMULA_NAME FireWire-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717354202191

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:50:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:50:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:50:03] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-02 18:50:03] [INFO ] Transformed 116 places.
[2024-06-02 18:50:03] [INFO ] Transformed 368 transitions.
[2024-06-02 18:50:03] [INFO ] Found NUPN structural information;
[2024-06-02 18:50:03] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 163 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 2 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 312/312 transitions.
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 6 place count 116 transition count 306
Applied a total of 6 rules in 24 ms. Remains 116 /116 variables (removed 0) and now considering 306/312 (removed 6) transitions.
[2024-06-02 18:50:03] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 18:50:03] [INFO ] Computed 9 invariants in 24 ms
[2024-06-02 18:50:03] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-02 18:50:03] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 18:50:03] [INFO ] Invariant cache hit.
[2024-06-02 18:50:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:50:04] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 18:50:04] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 18:50:04] [INFO ] Invariant cache hit.
[2024-06-02 18:50:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 18:50:06] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 6 ms to minimize.
[2024-06-02 18:50:06] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:50:06] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:50:06] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:50:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:50:07] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:50:07] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:50:07] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:50:07] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 18:50:08] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:50:08] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 293 constraints, problems are : Problem set: 0 solved, 305 unsolved in 16143 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 305/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 598 constraints, problems are : Problem set: 0 solved, 305 unsolved in 20065 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
After SMT, in 36531ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 36554ms
Starting structural reductions in LTL mode, iteration 1 : 116/116 places, 306/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37039 ms. Remains : 116/116 places, 306/312 transitions.
Support contains 28 out of 116 places after structural reductions.
[2024-06-02 18:50:40] [INFO ] Flatten gal took : 57 ms
[2024-06-02 18:50:40] [INFO ] Flatten gal took : 34 ms
[2024-06-02 18:50:40] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 25 out of 116 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (1994 resets) in 2083 ms. (19 steps per ms) remains 14/20 properties
BEST_FIRST walk for 40002 steps (525 resets) in 227 ms. (175 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (527 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (514 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (522 resets) in 294 ms. (135 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (497 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (507 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (502 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (514 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (687 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (543 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (530 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (503 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (541 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (513 resets) in 112 ms. (354 steps per ms) remains 13/14 properties
[2024-06-02 18:50:42] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 18:50:42] [INFO ] Invariant cache hit.
[2024-06-02 18:50:42] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 87/104 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:42] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 12/116 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:50:42] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:42] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 279/395 variables, 116/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 40/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:43] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 1/396 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/396 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 287 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1159 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 87/104 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:43] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:43] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 12/116 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:44] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:50:44] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:50:44] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 279/395 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 40/291 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 13/304 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 1/396 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/396 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 305 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1331 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
After SMT, in 2513ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 4340 ms.
Support contains 17 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 306/306 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 116 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 302
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 115 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 113 transition count 300
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 1 with 4 rules applied. Total rules applied 13 place count 111 transition count 304
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 17 place count 111 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 111 transition count 296
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 111 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 110 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 109 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 109 transition count 294
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 108 transition count 294
Applied a total of 27 rules in 78 ms. Remains 108 /116 variables (removed 8) and now considering 294/306 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 108/116 places, 294/306 transitions.
RANDOM walk for 40000 steps (2381 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (621 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (602 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (630 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (632 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (614 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (612 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (629 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (895 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (598 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (601 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (539 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (640 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (639 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 1137164 steps, run visited all 13 properties in 2784 ms. (steps per millisecond=408 )
Probabilistic random walk after 1137164 steps, saw 218956 distinct states, run finished after 2788 ms. (steps per millisecond=407 ) properties seen :13
Computed a total of 3 stabilizing places and 2 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' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 6 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 18:50:52] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 18:50:52] [INFO ] Computed 9 invariants in 5 ms
[2024-06-02 18:50:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:50:53] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:50:53] [INFO ] Invariant cache hit.
[2024-06-02 18:50:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:50:53] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 270 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 279 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-06-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-06-LTLCardinality-00 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 109 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 108 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 107 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 107 transition count 298
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 24 place count 106 transition count 298
Applied a total of 24 rules in 45 ms. Remains 106 /116 variables (removed 10) and now considering 298/306 (removed 8) transitions.
[2024-06-02 18:50:53] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 106 cols
[2024-06-02 18:50:53] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:50:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:50:54] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:50:54] [INFO ] Invariant cache hit.
[2024-06-02 18:50:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:50:54] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 231 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/116 places, 298/306 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 104/116 places, 298/306 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-01
Product exploration explored 100000 steps with 2 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 74 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (2410 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (579 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (591 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2013 steps, run visited all 2 properties in 21 ms. (steps per millisecond=95 )
Probabilistic random walk after 2013 steps, saw 1099 distinct states, run finished after 21 ms. (steps per millisecond=95 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (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 138 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 298/298 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:50:55] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 104 cols
[2024-06-02 18:50:55] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 18:50:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:50:55] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:50:55] [INFO ] Invariant cache hit.
[2024-06-02 18:50:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:50:55] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-02 18:50:55] [INFO ] Redundant transitions in 18 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:50:55] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:50:55] [INFO ] Invariant cache hit.
[2024-06-02 18:50:55] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:50:56] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:50:57] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:50:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/369 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:00] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/370 variables, and 156 constraints, problems are : Problem set: 0 solved, 295 unsolved in 10452 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/369 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 295/452 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
[2024-06-02 18:51:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/370 variables, and 454 constraints, problems are : Problem set: 0 solved, 295 unsolved in 16018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 10/10 constraints]
After SMT, in 26695ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 26699ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26926 ms. Remains : 104/104 places, 298/298 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 147 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (2423 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (608 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (580 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2013 steps, run visited all 2 properties in 10 ms. (steps per millisecond=201 )
Probabilistic random walk after 2013 steps, saw 1099 distinct states, run finished after 10 ms. (steps per millisecond=201 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (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 134 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 1 reset in 62 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 298/298 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:51:23] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:51:23] [INFO ] Invariant cache hit.
[2024-06-02 18:51:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:51:23] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:51:23] [INFO ] Invariant cache hit.
[2024-06-02 18:51:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:51:23] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-02 18:51:23] [INFO ] Redundant transitions in 5 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:51:23] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:51:23] [INFO ] Invariant cache hit.
[2024-06-02 18:51:23] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:51:25] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/369 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:28] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/370 variables, and 156 constraints, problems are : Problem set: 0 solved, 295 unsolved in 10471 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/369 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 295/452 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:51:38] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:51:38] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/370 variables, and 454 constraints, problems are : Problem set: 0 solved, 295 unsolved in 16138 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 10/10 constraints]
After SMT, in 26795ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 26799ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27003 ms. Remains : 104/104 places, 298/298 transitions.
Treatment of property FireWire-PT-06-LTLCardinality-01 finished in 56344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 110 transition count 309
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 16 place count 110 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 109 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 108 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 108 transition count 301
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 20 place count 107 transition count 301
Applied a total of 20 rules in 24 ms. Remains 107 /116 variables (removed 9) and now considering 301/306 (removed 5) transitions.
[2024-06-02 18:51:50] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
// Phase 1: matrix 268 rows 107 cols
[2024-06-02 18:51:50] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:51:50] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-02 18:51:50] [INFO ] Flow matrix only has 268 transitions (discarded 33 similar events)
[2024-06-02 18:51:50] [INFO ] Invariant cache hit.
[2024-06-02 18:51:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:51:50] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 448 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/116 places, 301/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 476 ms. Remains : 105/116 places, 301/306 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-02 finished in 572 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(((!p1 U (p2||G(!p1)))&&p0)))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 18:51:50] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 18:51:50] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:51:50] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 18:51:50] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:50] [INFO ] Invariant cache hit.
[2024-06-02 18:51:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:51] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 297 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 304/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 303 ms. Remains : 114/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-04 finished in 436 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 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 3 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 18:51:51] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:51] [INFO ] Invariant cache hit.
[2024-06-02 18:51:51] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:51:51] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:51] [INFO ] Invariant cache hit.
[2024-06-02 18:51:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:51] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 258 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 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-06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-06-LTLCardinality-05 finished in 628 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)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 1 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 18:51:51] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:51] [INFO ] Invariant cache hit.
[2024-06-02 18:51:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:51:51] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:51] [INFO ] Invariant cache hit.
[2024-06-02 18:51:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:52] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 244 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-06-LTLCardinality-06 finished in 658 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&&F(p1)&&G(p2))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 3 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 18:51:52] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:52] [INFO ] Invariant cache hit.
[2024-06-02 18:51:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:51:52] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:52] [INFO ] Invariant cache hit.
[2024-06-02 18:51:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:52] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 239 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-07 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
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 4 place count 113 transition count 303
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 0 with 6 rules applied. Total rules applied 10 place count 110 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 110 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 109 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 108 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 20 place count 108 transition count 299
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 22 place count 107 transition count 299
Applied a total of 22 rules in 22 ms. Remains 107 /116 variables (removed 9) and now considering 299/306 (removed 7) transitions.
[2024-06-02 18:51:53] [INFO ] Flow matrix only has 267 transitions (discarded 32 similar events)
// Phase 1: matrix 267 rows 107 cols
[2024-06-02 18:51:53] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:51:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:51:53] [INFO ] Flow matrix only has 267 transitions (discarded 32 similar events)
[2024-06-02 18:51:53] [INFO ] Invariant cache hit.
[2024-06-02 18:51:53] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:51:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 232 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/116 places, 299/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 105/116 places, 299/306 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-09 finished in 330 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(p0))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 1 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2024-06-02 18:51:53] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 18:51:53] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:51:53] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:51:53] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:53] [INFO ] Invariant cache hit.
[2024-06-02 18:51:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:53] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 247 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/306 transitions.
Applied a total of 0 rules in 0 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 113/116 places, 304/306 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (2022 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (530 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2151382 steps, run timeout after 3001 ms. (steps per millisecond=716 ) properties seen :0 out of 1
Probabilistic random walk after 2151382 steps, saw 371752 distinct states, run finished after 3003 ms. (steps per millisecond=716 ) properties seen :0
[2024-06-02 18:51:57] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 18:51:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:51:57] [INFO ] State equation strengthened by 41 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/390 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/390 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/391 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/391 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 304/304 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 113 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 113 transition count 300
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 5 place count 112 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 110 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 13 place count 108 transition count 303
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 17 place count 108 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 108 transition count 295
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 108 transition count 295
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 29 place count 105 transition count 293
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 31 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 104 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 103 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 33 place count 103 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 102 transition count 289
Applied a total of 35 rules in 29 ms. Remains 102 /113 variables (removed 11) and now considering 289/304 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 102/113 places, 289/304 transitions.
RANDOM walk for 40000 steps (2482 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (663 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1972 steps, run visited all 1 properties in 6 ms. (steps per millisecond=328 )
Probabilistic random walk after 1972 steps, saw 1071 distinct states, run finished after 6 ms. (steps per millisecond=328 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 18:51:57] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:57] [INFO ] Invariant cache hit.
[2024-06-02 18:51:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:51:58] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:58] [INFO ] Invariant cache hit.
[2024-06-02 18:51:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:51:58] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 18:51:58] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:51:58] [INFO ] Invariant cache hit.
[2024-06-02 18:51:58] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:52:00] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:52:00] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12735 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:52:11] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:52:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:52:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 28660 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 41598ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 41601ms
Finished structural reductions in LTL mode , in 1 iterations and 41812 ms. Remains : 113/113 places, 304/304 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (2038 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (520 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2238064 steps, run timeout after 3001 ms. (steps per millisecond=745 ) properties seen :0 out of 1
Probabilistic random walk after 2238064 steps, saw 387895 distinct states, run finished after 3001 ms. (steps per millisecond=745 ) properties seen :0
[2024-06-02 18:52:43] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:52:43] [INFO ] Invariant cache hit.
[2024-06-02 18:52:43] [INFO ] State equation strengthened by 41 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/390 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/111 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:52:43] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:52:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 277/388 variables, 111/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/391 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/391 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 304/304 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 113 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 113 transition count 300
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 5 place count 112 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 110 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 13 place count 108 transition count 303
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 17 place count 108 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 108 transition count 295
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 108 transition count 295
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 29 place count 105 transition count 293
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 31 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 104 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 103 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 33 place count 103 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 102 transition count 289
Applied a total of 35 rules in 28 ms. Remains 102 /113 variables (removed 11) and now considering 289/304 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 102/113 places, 289/304 transitions.
RANDOM walk for 31103 steps (1958 resets) in 56 ms. (545 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 113 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 113 transition count 314
Deduced a syphon composed of 5 places in 0 ms
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 11 place count 113 transition count 308
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 19 ms. Remains 113 /113 variables (removed 0) and now considering 308/304 (removed -4) transitions.
[2024-06-02 18:52:44] [INFO ] Redundant transitions in 5 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 18:52:44] [INFO ] Flow matrix only has 279 transitions (discarded 29 similar events)
// Phase 1: matrix 279 rows 113 cols
[2024-06-02 18:52:44] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:52:44] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 18:52:45] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 18:52:46] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-02 18:52:46] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-06-02 18:52:46] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:52:46] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:52:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:52:46] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:52:46] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:52:47] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:52:47] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 10/17 constraints. Problems are: Problem set: 8 solved, 299 unsolved
[2024-06-02 18:52:47] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/18 constraints. Problems are: Problem set: 8 solved, 299 unsolved
[2024-06-02 18:52:48] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 278/391 variables, 113/132 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 42/174 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/174 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/175 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/175 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/175 constraints. Problems are: Problem set: 8 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 175 constraints, problems are : Problem set: 8 solved, 299 unsolved in 13919 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 8 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 6/113 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 12/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 278/391 variables, 113/132 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 42/174 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 299/473 constraints. Problems are: Problem set: 8 solved, 299 unsolved
[2024-06-02 18:53:02] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:53:02] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 2/475 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/475 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/476 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/476 constraints. Problems are: Problem set: 8 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/476 constraints. Problems are: Problem set: 8 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 476 constraints, problems are : Problem set: 8 solved, 299 unsolved in 23796 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 299/307 constraints, Known Traps: 14/14 constraints]
After SMT, in 37898ms problems are : Problem set: 8 solved, 299 unsolved
Search for dead transitions found 8 dead transitions in 37902ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/113 places, 300/304 transitions.
Graph (complete) has 585 edges and 113 vertex of which 108 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 108 /113 variables (removed 5) and now considering 300/300 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/113 places, 300/304 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37958 ms. Remains : 108/113 places, 300/304 transitions.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 18:53:22] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 18:53:22] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:53:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:53:22] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:53:22] [INFO ] Invariant cache hit.
[2024-06-02 18:53:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:53:22] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 18:53:22] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 18:53:22] [INFO ] Invariant cache hit.
[2024-06-02 18:53:22] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:53:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:53:24] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:53:24] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2024-06-02 18:53:24] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:53:24] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:53:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:53:25] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12622 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:53:36] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:53:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:53:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42044ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42049ms
Finished structural reductions in LTL mode , in 1 iterations and 42263 ms. Remains : 113/113 places, 304/304 transitions.
Treatment of property FireWire-PT-06-LTLCardinality-10 finished in 131439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 109 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 108 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 107 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 107 transition count 298
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 24 place count 106 transition count 298
Applied a total of 24 rules in 21 ms. Remains 106 /116 variables (removed 10) and now considering 298/306 (removed 8) transitions.
[2024-06-02 18:54:04] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 106 cols
[2024-06-02 18:54:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:54:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:54:04] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:54:04] [INFO ] Invariant cache hit.
[2024-06-02 18:54:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:54:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 237 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/116 places, 298/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 264 ms. Remains : 105/116 places, 298/306 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 2 reset in 71 ms.
Product exploration explored 100000 steps with 1 reset in 79 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 14136 steps (859 resets) in 31 ms. (441 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 298/298 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:54:05] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 18:54:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:54:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:54:05] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:54:05] [INFO ] Invariant cache hit.
[2024-06-02 18:54:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:54:05] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 18:54:05] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:54:05] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:54:05] [INFO ] Invariant cache hit.
[2024-06-02 18:54:05] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:54:07] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-06-02 18:54:07] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:54:07] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:08] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:54:08] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/370 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 161 constraints, problems are : Problem set: 0 solved, 295 unsolved in 10853 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 265/370 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 295/456 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:25] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/370 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 457 constraints, problems are : Problem set: 0 solved, 295 unsolved in 19128 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints]
After SMT, in 30167ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 30171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30377 ms. Remains : 105/105 places, 298/298 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 17910 steps (1137 resets) in 48 ms. (365 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 44 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 298/298 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 18:54:36] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:54:36] [INFO ] Invariant cache hit.
[2024-06-02 18:54:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:54:36] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:54:36] [INFO ] Invariant cache hit.
[2024-06-02 18:54:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:54:36] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-02 18:54:36] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 18:54:36] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:54:36] [INFO ] Invariant cache hit.
[2024-06-02 18:54:36] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:37] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:54:37] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 18:54:37] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:54:38] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:54:38] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:54:38] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:54:39] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 265/370 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:41] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:54:41] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/371 variables, and 161 constraints, problems are : Problem set: 0 solved, 295 unsolved in 10864 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 265/370 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 295/456 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/370 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/371 variables, and 457 constraints, problems are : Problem set: 0 solved, 295 unsolved in 19088 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints]
After SMT, in 30155ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 30159ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30379 ms. Remains : 105/105 places, 298/298 transitions.
Treatment of property FireWire-PT-06-LTLCardinality-12 finished in 62168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(F(!p0))&&p1)))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 109 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 108 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 107 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 107 transition count 298
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 24 place count 106 transition count 298
Applied a total of 24 rules in 25 ms. Remains 106 /116 variables (removed 10) and now considering 298/306 (removed 8) transitions.
[2024-06-02 18:55:06] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
// Phase 1: matrix 266 rows 106 cols
[2024-06-02 18:55:06] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:55:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:55:07] [INFO ] Flow matrix only has 266 transitions (discarded 32 similar events)
[2024-06-02 18:55:07] [INFO ] Invariant cache hit.
[2024-06-02 18:55:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:55:07] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 239 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/116 places, 298/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 104/116 places, 298/306 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-06-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-06-LTLCardinality-13 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(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(X(p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-02 18:55:07] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:55:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-02 18:55:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 306 transitions and 1118 arcs took 4 ms.
Total runtime 304317 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-06-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-06-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-06-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717354511712

--------------------
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-06-LTLCardinality-01
ltl formula formula --ltl=/tmp/1553/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 116 places, 306 transitions and 1118 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1553/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1553/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1553/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1553/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 118 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 117, there are 317 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): ~370 levels ~10000 states ~44032 transitions
pnml2lts-mc( 2/ 4): ~596 levels ~20000 states ~79700 transitions
pnml2lts-mc( 2/ 4): ~810 levels ~40000 states ~178748 transitions
pnml2lts-mc( 1/ 4): ~589 levels ~80000 states ~320384 transitions
pnml2lts-mc( 1/ 4): ~1250 levels ~160000 states ~660400 transitions
pnml2lts-mc( 1/ 4): ~1250 levels ~320000 states ~1355320 transitions
pnml2lts-mc( 2/ 4): ~810 levels ~640000 states ~2747060 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~749!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 225738
pnml2lts-mc( 0/ 4): unique states count: 688811
pnml2lts-mc( 0/ 4): unique transitions count: 3127322
pnml2lts-mc( 0/ 4): - self-loop count: 255363
pnml2lts-mc( 0/ 4): - claim dead count: 1259896
pnml2lts-mc( 0/ 4): - claim found count: 939113
pnml2lts-mc( 0/ 4): - claim success count: 693583
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6971
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 701152 states 3186994 transitions, fanout: 4.545
pnml2lts-mc( 0/ 4): Total exploration time 3.300 sec (3.300 sec minimum, 3.300 sec on average)
pnml2lts-mc( 0/ 4): States per second: 212470, Transitions per second: 965756
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.4MB, 8.1 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 309 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 5.4MB (~256.0MB paged-in)
ltl formula name FireWire-PT-06-LTLCardinality-10
ltl formula formula --ltl=/tmp/1553/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 116 places, 306 transitions and 1118 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.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1553/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1553/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1553/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1553/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 118 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 117, there are 314 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): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 13
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 23
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23 states 41 transitions, fanout: 1.783
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, 58.9 B/state, compr.: 12.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 309 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-06-LTLCardinality-12
ltl formula formula --ltl=/tmp/1553/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 116 places, 306 transitions and 1118 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.040 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1553/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1553/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1553/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1553/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 117 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 117, there are 318 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~15!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 41
pnml2lts-mc( 0/ 4): unique states count: 123
pnml2lts-mc( 0/ 4): unique transitions count: 474
pnml2lts-mc( 0/ 4): - self-loop count: 61
pnml2lts-mc( 0/ 4): - claim dead count: 29
pnml2lts-mc( 0/ 4): - claim found count: 53
pnml2lts-mc( 0/ 4): - claim success count: 135
pnml2lts-mc( 0/ 4): - cum. max stack depth: 91
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 135 states 504 transitions, fanout: 3.733
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, 16.1 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 309 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-06"
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-06, 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-171734901100211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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