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.r550-tall-171734898900259.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 itstools
Input is FireWire-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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-12-LTLCardinality-00
FORMULA_NAME FireWire-PT-12-LTLCardinality-01
FORMULA_NAME FireWire-PT-12-LTLCardinality-02
FORMULA_NAME FireWire-PT-12-LTLCardinality-03
FORMULA_NAME FireWire-PT-12-LTLCardinality-04
FORMULA_NAME FireWire-PT-12-LTLCardinality-05
FORMULA_NAME FireWire-PT-12-LTLCardinality-06
FORMULA_NAME FireWire-PT-12-LTLCardinality-07
FORMULA_NAME FireWire-PT-12-LTLCardinality-08
FORMULA_NAME FireWire-PT-12-LTLCardinality-09
FORMULA_NAME FireWire-PT-12-LTLCardinality-10
FORMULA_NAME FireWire-PT-12-LTLCardinality-11
FORMULA_NAME FireWire-PT-12-LTLCardinality-12
FORMULA_NAME FireWire-PT-12-LTLCardinality-13
FORMULA_NAME FireWire-PT-12-LTLCardinality-14
FORMULA_NAME FireWire-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717363441155

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 21:24:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:24:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:24:02] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 21:24:02] [INFO ] Transformed 169 places.
[2024-06-02 21:24:02] [INFO ] Transformed 508 transitions.
[2024-06-02 21:24:02] [INFO ] Found NUPN structural information;
[2024-06-02 21:24:02] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1889 arcs in 176 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 68 transitions
Reduce redundant transitions removed 68 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-12-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 440/440 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 167 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 167 transition count 436
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 10 place count 167 transition count 430
Applied a total of 10 rules in 52 ms. Remains 167 /169 variables (removed 2) and now considering 430/440 (removed 10) transitions.
[2024-06-02 21:24:02] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
// Phase 1: matrix 398 rows 167 cols
[2024-06-02 21:24:02] [INFO ] Computed 10 invariants in 22 ms
[2024-06-02 21:24:02] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-02 21:24:02] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
[2024-06-02 21:24:02] [INFO ] Invariant cache hit.
[2024-06-02 21:24:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:24:03] [INFO ] Implicit Places using invariants and state equation in 288 ms returned [63, 114, 165]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 563 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/169 places, 430/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 643 ms. Remains : 164/169 places, 430/440 transitions.
Support contains 33 out of 164 places after structural reductions.
[2024-06-02 21:24:03] [INFO ] Flatten gal took : 57 ms
[2024-06-02 21:24:03] [INFO ] Flatten gal took : 28 ms
[2024-06-02 21:24:03] [INFO ] Input system was already deterministic with 430 transitions.
RANDOM walk for 40000 steps (1069 resets) in 2077 ms. (19 steps per ms) remains 8/20 properties
BEST_FIRST walk for 40003 steps (200 resets) in 94 ms. (421 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (211 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (219 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (20 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (210 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (213 resets) in 74 ms. (533 steps per ms) remains 3/6 properties
[2024-06-02 21:24:04] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
// Phase 1: matrix 398 rows 164 cols
[2024-06-02 21:24:04] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 21:24:04] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 385/534 variables, 149/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 54/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 27/561 variables, 15/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/562 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 229 constraints, problems are : Problem set: 0 solved, 3 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 10 ms to minimize.
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 8 ms to minimize.
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 385/534 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 54/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 27/561 variables, 15/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/562 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/562 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1177ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 377 ms.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 430/430 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 164 transition count 427
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 164 transition count 421
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 158 transition count 421
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 157 transition count 419
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 157 transition count 419
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 21 place count 155 transition count 425
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 25 place count 155 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 155 transition count 419
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 155 transition count 426
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 47 place count 149 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 54 place count 149 transition count 411
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 148 transition count 410
Applied a total of 55 rules in 103 ms. Remains 148 /164 variables (removed 16) and now considering 410/430 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 148/164 places, 410/430 transitions.
RANDOM walk for 40000 steps (1270 resets) in 442 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (254 resets) in 331 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (280 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 640549 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 2
Probabilistic random walk after 640549 steps, saw 181612 distinct states, run finished after 3012 ms. (steps per millisecond=212 ) properties seen :0
[2024-06-02 21:24:09] [INFO ] Flow matrix only has 375 transitions (discarded 35 similar events)
// Phase 1: matrix 375 rows 148 cols
[2024-06-02 21:24:09] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 21:24:09] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 238/317 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 115/432 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/433 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 81/514 variables, 41/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/522 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/523 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/523 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 238/317 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 115/432 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/433 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 81/514 variables, 41/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/514 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/522 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/523 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/523 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/523 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 523/523 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 552ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 410/410 transitions.
Applied a total of 0 rules in 17 ms. Remains 148 /148 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 148/148 places, 410/410 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 410/410 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2024-06-02 21:24:10] [INFO ] Flow matrix only has 375 transitions (discarded 35 similar events)
[2024-06-02 21:24:10] [INFO ] Invariant cache hit.
[2024-06-02 21:24:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:24:10] [INFO ] Flow matrix only has 375 transitions (discarded 35 similar events)
[2024-06-02 21:24:10] [INFO ] Invariant cache hit.
[2024-06-02 21:24:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:24:10] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 21:24:10] [INFO ] Redundant transitions in 24 ms returned []
Running 404 sub problems to find dead transitions.
[2024-06-02 21:24:10] [INFO ] Flow matrix only has 375 transitions (discarded 35 similar events)
[2024-06-02 21:24:10] [INFO ] Invariant cache hit.
[2024-06-02 21:24:10] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-06-02 21:24:12] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:24:12] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:24:12] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:24:12] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:24:12] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 2 ms to minimize.
[2024-06-02 21:24:13] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 7 ms to minimize.
[2024-06-02 21:24:13] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 375/523 variables, 148/162 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 56/218 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-06-02 21:24:20] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:24:20] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:24:20] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 0/523 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 221 constraints, problems are : Problem set: 0 solved, 404 unsolved in 19595 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 375/523 variables, 148/165 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 404/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 0/523 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Int declared 523/523 variables, and 625 constraints, problems are : Problem set: 0 solved, 404 unsolved in 27286 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 10/10 constraints]
After SMT, in 47323ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 47331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47699 ms. Remains : 148/148 places, 410/410 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 123 edges and 148 vertex of which 24 / 148 are part of one of the 4 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 127 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 19 place count 127 transition count 266
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 21 place count 126 transition count 266
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 0 with 4 rules applied. Total rules applied 25 place count 124 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 124 transition count 263
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 28 place count 123 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 122 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 122 transition count 223
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 122 transition count 208
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 51 place count 113 transition count 205
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 113 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 113 transition count 204
Applied a total of 58 rules in 66 ms. Remains 113 /148 variables (removed 35) and now considering 204/410 (removed 206) transitions.
Running SMT prover for 2 properties.
[2024-06-02 21:24:57] [INFO ] Flow matrix only has 203 transitions (discarded 1 similar events)
// Phase 1: matrix 203 rows 113 cols
[2024-06-02 21:24:57] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:24:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:24:57] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:24:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:24:58] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 21:24:58] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
TRAPS : Iteration 1
[2024-06-02 21:24:58] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:24:58] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 358 ms.
Computed a total of 20 stabilizing places and 33 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(X(G(p0))))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 4 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:24:58] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 21:24:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:24:58] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 21:24:58] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:24:58] [INFO ] Invariant cache hit.
[2024-06-02 21:24:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:24:58] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:24:59] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:24:59] [INFO ] Invariant cache hit.
[2024-06-02 21:24:59] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:25:01] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:25:01] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:25:02] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:25:02] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:25:02] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:25:02] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:25:13] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:25:13] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23978 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:25:24] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:25:33] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:25:33] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:25:37] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54360ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54368ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54868 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLCardinality-00 finished in 55147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((F(!p1) U p2)))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 3 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:25:53] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:25:53] [INFO ] Invariant cache hit.
[2024-06-02 21:25:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:25:53] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:25:53] [INFO ] Invariant cache hit.
[2024-06-02 21:25:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:25:53] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:25:53] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:25:53] [INFO ] Invariant cache hit.
[2024-06-02 21:25:53] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:25:56] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:25:56] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:25:56] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:25:57] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:25:57] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:25:57] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:26:08] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:26:08] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:26:19] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:26:28] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:26:28] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:26:32] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54367ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54371ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54716 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 173 ms.
Product exploration explored 100000 steps with 2 reset in 106 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 128 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (1084 resets) in 203 ms. (196 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40002 steps (30 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (44 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (216 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (23 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
[2024-06-02 21:26:49] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:26:49] [INFO ] Invariant cache hit.
[2024-06-02 21:26:49] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf1 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 127/559 variables, and 3 constraints, problems are : Problem set: 4 solved, 0 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/163 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1 p0)))), (G (OR p2 (NOT p1))), (G (OR p2 p0 (NOT p1))), (G (OR p2 (NOT p0))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (AND p2 p0 p1))), (F (NOT (AND p2 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 263 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Support contains 4 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 18 place count 153 transition count 430
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 24 place count 153 transition count 424
Applied a total of 24 rules in 24 ms. Remains 153 /163 variables (removed 10) and now considering 424/428 (removed 4) transitions.
[2024-06-02 21:26:50] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 21:26:50] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:26:50] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:26:50] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:26:50] [INFO ] Invariant cache hit.
[2024-06-02 21:26:50] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:26:50] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-02 21:26:50] [INFO ] Redundant transitions in 6 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 21:26:50] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:26:50] [INFO ] Invariant cache hit.
[2024-06-02 21:26:50] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 0 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:27:00] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:27:00] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:27:00] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:27:01] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:27:08] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 27916 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:27:26] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:27:29] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:27:29] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:27:38] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 58244ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58248ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58600 ms. Remains : 153/163 places, 424/428 transitions.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 33840 steps (1104 resets) in 84 ms. (398 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 1 reset in 76 ms.
Built C files in :
/tmp/ltsmin10394295380911308847
[2024-06-02 21:27:49] [INFO ] Computing symmetric may disable matrix : 424 transitions.
[2024-06-02 21:27:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:49] [INFO ] Computing symmetric may enable matrix : 424 transitions.
[2024-06-02 21:27:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:49] [INFO ] Computing Do-Not-Accords matrix : 424 transitions.
[2024-06-02 21:27:49] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:49] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10394295380911308847
Running compilation step : cd /tmp/ltsmin10394295380911308847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1110 ms.
Running link step : cd /tmp/ltsmin10394295380911308847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10394295380911308847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1357167329836865990.hoa' '--buchi-type=spotba'
LTSmin run took 1721 ms.
FORMULA FireWire-PT-12-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-12-LTLCardinality-01 finished in 118870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 3 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:27:52] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 21:27:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:27:52] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:27:52] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:27:52] [INFO ] Invariant cache hit.
[2024-06-02 21:27:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:27:52] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:27:52] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:27:52] [INFO ] Invariant cache hit.
[2024-06-02 21:27:52] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:27:55] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:27:55] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:27:55] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:27:56] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:27:56] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:27:56] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:28:07] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:28:07] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23969 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:28:18] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:28:27] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:28:27] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:28:31] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54325ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54330ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54675 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLCardinality-02 finished in 54816 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&&F(p1)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 2 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:28:47] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:28:47] [INFO ] Invariant cache hit.
[2024-06-02 21:28:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:28:47] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:28:47] [INFO ] Invariant cache hit.
[2024-06-02 21:28:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:28:47] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:28:47] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:28:47] [INFO ] Invariant cache hit.
[2024-06-02 21:28:47] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:28:51] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:29:01] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:29:01] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23823 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:29:13] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:29:21] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:29:22] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:29:26] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54140ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54146ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54491 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 11 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-12-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-12-LTLCardinality-03 finished in 54985 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||G(p1)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 163 transition count 423
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 157 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 156 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 20 place count 153 transition count 430
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 26 place count 153 transition count 424
Applied a total of 26 rules in 21 ms. Remains 153 /164 variables (removed 11) and now considering 424/430 (removed 6) transitions.
[2024-06-02 21:29:42] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 21:29:42] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:29:42] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 21:29:42] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:29:42] [INFO ] Invariant cache hit.
[2024-06-02 21:29:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:29:42] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-06-02 21:29:42] [INFO ] Redundant transitions in 8 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 21:29:42] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:29:42] [INFO ] Invariant cache hit.
[2024-06-02 21:29:42] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:29:44] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:29:44] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:29:44] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:29:44] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2024-06-02 21:29:44] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:29:45] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:29:52] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:29:52] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:29:52] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:29:53] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:30:00] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 27873 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 644 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
After SMT, in 58193ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/164 places, 424/430 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58625 ms. Remains : 153/164 places, 424/430 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-04
Product exploration explored 100000 steps with 3 reset in 138 ms.
Product exploration explored 100000 steps with 17 reset in 81 ms.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1264 resets) in 174 ms. (228 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (273 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-06-02 21:30:41] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:30:41] [INFO ] Invariant cache hit.
[2024-06-02 21:30:41] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/489 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/533 variables, 26/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/537 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/489 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/533 variables, 26/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/537 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 651 steps, including 37 resets, run visited all 1 properties in 3 ms. (steps per millisecond=217 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 232 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 424/424 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 21:30:42] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:30:42] [INFO ] Invariant cache hit.
[2024-06-02 21:30:42] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:30:42] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:30:42] [INFO ] Invariant cache hit.
[2024-06-02 21:30:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:30:42] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 21:30:42] [INFO ] Redundant transitions in 7 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 21:30:42] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:30:42] [INFO ] Invariant cache hit.
[2024-06-02 21:30:42] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:30:44] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:30:44] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:30:44] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:30:44] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:30:44] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 3 ms to minimize.
[2024-06-02 21:30:44] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:30:52] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:30:52] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:30:52] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:30:53] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 27736 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 644 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
After SMT, in 58072ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58426 ms. Remains : 153/153 places, 424/424 transitions.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1266 resets) in 253 ms. (157 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (295 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-06-02 21:31:40] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:31:40] [INFO ] Invariant cache hit.
[2024-06-02 21:31:40] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/489 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/533 variables, 26/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/537 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/489 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/533 variables, 26/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/537 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 341 steps, including 19 resets, run visited all 1 properties in 2 ms. (steps per millisecond=170 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Built C files in :
/tmp/ltsmin7556490889373505522
[2024-06-02 21:31:41] [INFO ] Computing symmetric may disable matrix : 424 transitions.
[2024-06-02 21:31:41] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:31:41] [INFO ] Computing symmetric may enable matrix : 424 transitions.
[2024-06-02 21:31:41] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:31:41] [INFO ] Computing Do-Not-Accords matrix : 424 transitions.
[2024-06-02 21:31:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:31:41] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7556490889373505522
Running compilation step : cd /tmp/ltsmin7556490889373505522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1138 ms.
Running link step : cd /tmp/ltsmin7556490889373505522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7556490889373505522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased233326014017988956.hoa' '--buchi-type=spotba'
LTSmin run took 1455 ms.
FORMULA FireWire-PT-12-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-12-LTLCardinality-04 finished in 122321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 4 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:31:44] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 21:31:44] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:31:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:31:44] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:31:44] [INFO ] Invariant cache hit.
[2024-06-02 21:31:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:31:44] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:31:44] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:31:44] [INFO ] Invariant cache hit.
[2024-06-02 21:31:44] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:31:47] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:31:47] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:31:47] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:31:48] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:31:48] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:31:48] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23700 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:32:10] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:32:19] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:32:19] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:32:23] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54074ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54083ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54413 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLCardinality-05 finished in 54528 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 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-06-02 21:32:39] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
// Phase 1: matrix 398 rows 164 cols
[2024-06-02 21:32:39] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:32:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:32:39] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
[2024-06-02 21:32:39] [INFO ] Invariant cache hit.
[2024-06-02 21:32:39] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:32:39] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2024-06-02 21:32:39] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
[2024-06-02 21:32:39] [INFO ] Invariant cache hit.
[2024-06-02 21:32:39] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:32:42] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:32:42] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:32:42] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:32:42] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:32:42] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:32:43] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:32:43] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 397/561 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/235 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 236 constraints, problems are : Problem set: 0 solved, 429 unsolved in 22810 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 397/561 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/235 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 429/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 21:33:13] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:33:16] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 2 ms to minimize.
[2024-06-02 21:33:17] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 429 unsolved
SMT process timed out in 53138ms, After SMT, problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 53141ms
Finished structural reductions in LTL mode , in 1 iterations and 53478 ms. Remains : 164/164 places, 430/430 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLCardinality-06 finished in 53573 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(G(p0)) U p1)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 2 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:33:32] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 21:33:32] [INFO ] Computed 7 invariants in 14 ms
[2024-06-02 21:33:32] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:33:32] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:33:32] [INFO ] Invariant cache hit.
[2024-06-02 21:33:32] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:33:33] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:33:33] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:33:33] [INFO ] Invariant cache hit.
[2024-06-02 21:33:33] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:33:35] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:33:35] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:33:36] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:33:36] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:33:36] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:33:36] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:33:47] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:33:47] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23770 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:33:58] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:34:07] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:34:07] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:34:11] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54096ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54100ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54454 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 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-12-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-12-LTLCardinality-08 finished in 54864 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||G(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 163 transition count 423
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 157 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 156 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 20 place count 153 transition count 430
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 26 place count 153 transition count 424
Applied a total of 26 rules in 21 ms. Remains 153 /164 variables (removed 11) and now considering 424/430 (removed 6) transitions.
[2024-06-02 21:34:27] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 21:34:27] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:34:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:34:27] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:34:27] [INFO ] Invariant cache hit.
[2024-06-02 21:34:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:34:27] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-02 21:34:27] [INFO ] Redundant transitions in 7 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 21:34:27] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 21:34:27] [INFO ] Invariant cache hit.
[2024-06-02 21:34:27] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:34:29] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:34:29] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:34:29] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:34:29] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:34:30] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:34:30] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:34:38] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:34:38] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:34:38] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:34:39] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:34:46] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 27941 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 644 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
After SMT, in 58260ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/164 places, 424/430 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58635 ms. Remains : 153/164 places, 424/430 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLCardinality-09 finished in 58730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U p1))&&F((p2||X(p2)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 3 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:35:26] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 21:35:26] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:35:26] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 21:35:26] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:35:26] [INFO ] Invariant cache hit.
[2024-06-02 21:35:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:35:26] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:35:26] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:35:26] [INFO ] Invariant cache hit.
[2024-06-02 21:35:26] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:35:29] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:35:29] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:35:29] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:35:29] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:35:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:35:30] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:35:40] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:35:41] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23801 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:35:52] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:36:00] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:36:01] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:36:05] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54119ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54124ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54430 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true, (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLCardinality-10 finished in 54624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 430/430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 428
Applied a total of 2 rules in 3 ms. Remains 163 /164 variables (removed 1) and now considering 428/430 (removed 2) transitions.
[2024-06-02 21:36:20] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:36:20] [INFO ] Invariant cache hit.
[2024-06-02 21:36:20] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:36:20] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:36:20] [INFO ] Invariant cache hit.
[2024-06-02 21:36:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:36:21] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 21:36:21] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 21:36:21] [INFO ] Invariant cache hit.
[2024-06-02 21:36:21] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:36:23] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:36:24] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:36:24] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:36:24] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:36:24] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:36:24] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:36:35] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:36:35] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23402 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:36:46] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:36:54] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:36:55] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-06-02 21:36:59] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 53748ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 53754ms
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 428/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54056 ms. Remains : 163/164 places, 428/430 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLCardinality-13 finished in 54184 ms.
All properties solved by simple procedures.
Total runtime 792834 ms.

BK_STOP 1717364235145

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-12, 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 r550-tall-171734898900259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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