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-171734898900252.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-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K 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-11-LTLFireability-00
FORMULA_NAME FireWire-PT-11-LTLFireability-01
FORMULA_NAME FireWire-PT-11-LTLFireability-02
FORMULA_NAME FireWire-PT-11-LTLFireability-03
FORMULA_NAME FireWire-PT-11-LTLFireability-04
FORMULA_NAME FireWire-PT-11-LTLFireability-05
FORMULA_NAME FireWire-PT-11-LTLFireability-06
FORMULA_NAME FireWire-PT-11-LTLFireability-07
FORMULA_NAME FireWire-PT-11-LTLFireability-08
FORMULA_NAME FireWire-PT-11-LTLFireability-09
FORMULA_NAME FireWire-PT-11-LTLFireability-10
FORMULA_NAME FireWire-PT-11-LTLFireability-11
FORMULA_NAME FireWire-PT-11-LTLFireability-12
FORMULA_NAME FireWire-PT-11-LTLFireability-13
FORMULA_NAME FireWire-PT-11-LTLFireability-14
FORMULA_NAME FireWire-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717362718178

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 21:11:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:11:59] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 21:11:59] [INFO ] Transformed 169 places.
[2024-06-02 21:11:59] [INFO ] Transformed 508 transitions.
[2024-06-02 21:11:59] [INFO ] Found NUPN structural information;
[2024-06-02 21:11:59] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
FORMULA FireWire-PT-11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 443/443 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 166 transition count 437
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 166 transition count 437
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 12 place count 166 transition count 431
Applied a total of 12 rules in 46 ms. Remains 166 /169 variables (removed 3) and now considering 431/443 (removed 12) transitions.
[2024-06-02 21:11:59] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 166 cols
[2024-06-02 21:11:59] [INFO ] Computed 10 invariants in 21 ms
[2024-06-02 21:12:00] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-02 21:12:00] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:12:00] [INFO ] Invariant cache hit.
[2024-06-02 21:12:00] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:12:00] [INFO ] Implicit Places using invariants and state equation in 373 ms returned [62, 113, 164]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 659 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/169 places, 431/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 728 ms. Remains : 163/169 places, 431/443 transitions.
Support contains 36 out of 163 places after structural reductions.
[2024-06-02 21:12:00] [INFO ] Flatten gal took : 54 ms
[2024-06-02 21:12:00] [INFO ] Flatten gal took : 28 ms
[2024-06-02 21:12:00] [INFO ] Input system was already deterministic with 431 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (1075 resets) in 1796 ms. (22 steps per ms) remains 9/32 properties
BEST_FIRST walk for 40003 steps (205 resets) in 240 ms. (165 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (220 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (252 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 83 ms. (476 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (200 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (250 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
[2024-06-02 21:12:01] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 21:12:01] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 21:12:01] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 91/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:12:01] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 48/148 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:12:01] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 386/534 variables, 148/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 54/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 27/561 variables, 15/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/562 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/562 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 230 constraints, problems are : Problem set: 0 solved, 5 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 91/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 48/148 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:12:02] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 386/534 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 54/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 27/561 variables, 15/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/562 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 236 constraints, problems are : Problem set: 0 solved, 5 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1721ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1704 ms.
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 431/431 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 163 transition count 428
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 163 transition count 422
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 157 transition count 422
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 1 with 6 rules applied. Total rules applied 21 place count 154 transition count 431
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 422
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 154 transition count 431
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 51 place count 148 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 148 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 147 transition count 415
Applied a total of 58 rules in 85 ms. Remains 147 /163 variables (removed 16) and now considering 415/431 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 147/163 places, 415/431 transitions.
RANDOM walk for 40000 steps (1303 resets) in 1052 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (263 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (380 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (256 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (274 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (370 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 875485 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :4 out of 5
Probabilistic random walk after 875485 steps, saw 215430 distinct states, run finished after 3007 ms. (steps per millisecond=291 ) properties seen :4
[2024-06-02 21:12:08] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
// Phase 1: matrix 378 rows 147 cols
[2024-06-02 21:12:08] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:12:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/163 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 183/346 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 158/505 variables, 78/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/505 variables, 38/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/523 variables, 10/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/523 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/525 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/525 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/163 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 183/346 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/347 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 158/505 variables, 78/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/505 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/523 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/523 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:12:09] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/525 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/525 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/525 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 576ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2316 steps, including 709 resets, run visited all 1 properties in 4 ms. (steps per millisecond=579 )
Parikh walk visited 1 properties in 7 ms.
FORMULA FireWire-PT-11-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 19 stabilizing places and 31 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 431/431 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 424
Deduced a syphon composed of 6 places in 1 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 424
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 18 place count 153 transition count 433
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 427
Applied a total of 24 rules in 31 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 21:12:09] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 21:12:09] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:12:09] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 21:12:09] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:12:09] [INFO ] Invariant cache hit.
[2024-06-02 21:12:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:12:10] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-06-02 21:12:10] [INFO ] Redundant transitions in 21 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:12:10] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:12:10] [INFO ] Invariant cache hit.
[2024-06-02 21:12:10] [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, 420 unsolved
[2024-06-02 21:12:12] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:12:12] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:12:12] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:12:12] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:12:12] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:12:12] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:12:12] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 2 ms to minimize.
[2024-06-02 21:12:13] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:12:18] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:12:19] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 3 ms to minimize.
[2024-06-02 21:12:20] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:12:21] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:12:22] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 229 constraints, problems are : Problem set: 0 solved, 420 unsolved in 23656 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 54099ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 54108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54584 ms. Remains : 153/163 places, 427/431 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-02 finished in 54769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 431/431 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 424
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 424
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 18 place count 153 transition count 433
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 427
Applied a total of 24 rules in 30 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 21:13:04] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:13:04] [INFO ] Invariant cache hit.
[2024-06-02 21:13:04] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-02 21:13:04] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:13:04] [INFO ] Invariant cache hit.
[2024-06-02 21:13:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:13:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-02 21:13:04] [INFO ] Redundant transitions in 10 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:13:04] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:13:04] [INFO ] Invariant cache hit.
[2024-06-02 21:13:04] [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, 420 unsolved
[2024-06-02 21:13:06] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:13:06] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:13:07] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:13:07] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:13:07] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:13:07] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:13:07] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:13:07] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:13:13] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 229 constraints, problems are : Problem set: 0 solved, 420 unsolved in 23687 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:13:39] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 54065ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 54070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54512 ms. Remains : 153/163 places, 427/431 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-03
Product exploration explored 100000 steps with 4 reset in 154 ms.
Product exploration explored 100000 steps with 1 reset in 92 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 p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 36514 steps (1193 resets) in 203 ms. (178 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 427/427 transitions.
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 21:14:00] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:14:00] [INFO ] Invariant cache hit.
[2024-06-02 21:14:00] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 21:14:00] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:14:00] [INFO ] Invariant cache hit.
[2024-06-02 21:14:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:14:00] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-06-02 21:14:00] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:14:00] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:14:00] [INFO ] Invariant cache hit.
[2024-06-02 21:14:00] [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, 420 unsolved
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:14:03] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:14:03] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:14:08] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:14:09] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:14:10] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:14:11] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:14:12] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 229 constraints, problems are : Problem set: 0 solved, 420 unsolved in 23549 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:14:34] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 53927ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 53932ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54304 ms. Remains : 153/153 places, 427/427 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 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (1326 resets) in 118 ms. (336 steps per ms) remains 1/2 properties
BEST_FIRST walk for 25641 steps (166 resets) in 88 ms. (288 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 144 ms.
Product exploration explored 100000 steps with 6 reset in 88 ms.
Built C files in :
/tmp/ltsmin4724619127554220401
[2024-06-02 21:14:55] [INFO ] Computing symmetric may disable matrix : 427 transitions.
[2024-06-02 21:14:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:14:55] [INFO ] Computing symmetric may enable matrix : 427 transitions.
[2024-06-02 21:14:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:14:55] [INFO ] Computing Do-Not-Accords matrix : 427 transitions.
[2024-06-02 21:14:55] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:14:55] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4724619127554220401
Running compilation step : cd /tmp/ltsmin4724619127554220401;'/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 1096 ms.
Running link step : cd /tmp/ltsmin4724619127554220401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4724619127554220401;'/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/stateBased4344593214254404710.hoa' '--buchi-type=spotba'
LTSmin run took 1132 ms.
FORMULA FireWire-PT-11-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-11-LTLFireability-03 finished in 113317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p1||X(p2)))||(X(F(p1))&&(p1 U p3))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:14:57] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 21:14:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:14:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:14:57] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:14:57] [INFO ] Invariant cache hit.
[2024-06-02 21:14:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:14:58] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:14:58] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:14:58] [INFO ] Invariant cache hit.
[2024-06-02 21:14:58] [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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:15:00] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:15:01] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:15:01] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:15:01] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:15:01] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 2 ms to minimize.
[2024-06-02 21:15:02] [INFO ] Deduced a trap composed of 36 places in 67 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, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23715 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:15:34] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:15:35] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 54087ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 54095ms
Finished structural reductions in LTL mode , in 1 iterations and 54460 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-06 finished in 54637 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 U p1)&&F(p2)))&&X(p3)))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:15:52] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:15:52] [INFO ] Invariant cache hit.
[2024-06-02 21:15:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:15:52] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:15:52] [INFO ] Invariant cache hit.
[2024-06-02 21:15:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:15:52] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:15:52] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:15:52] [INFO ] Invariant cache hit.
[2024-06-02 21:15: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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:15:55] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:15:55] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 5 ms to minimize.
[2024-06-02 21:15:55] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 36 places in 75 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, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:16:28] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:16:28] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:16:29] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 53502ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 53507ms
Finished structural reductions in LTL mode , in 1 iterations and 53828 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), true]
Running random walk in product with property : FireWire-PT-11-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-08 finished in 54087 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||(F(p1)&&F(p2)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 431/431 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 424
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 424
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 433
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 427
Applied a total of 24 rules in 24 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 21:16:46] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 21:16:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:16:46] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:16:46] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:16:46] [INFO ] Invariant cache hit.
[2024-06-02 21:16:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:16:46] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-06-02 21:16:46] [INFO ] Redundant transitions in 2 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:16:46] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:16:46] [INFO ] Invariant cache hit.
[2024-06-02 21:16:46] [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, 420 unsolved
[2024-06-02 21:16:48] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:16:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:16:48] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:16:48] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:16:49] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:16:49] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:16:49] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 0 ms to minimize.
[2024-06-02 21:16:49] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:16:54] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:16:55] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:16:56] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:16:57] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:16:58] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 229 constraints, problems are : Problem set: 0 solved, 420 unsolved in 23287 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:17:20] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 53608ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 53611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53986 ms. Remains : 153/163 places, 427/431 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-09 finished in 54118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:17:40] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 21:17:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:17:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:17:40] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:17:40] [INFO ] Invariant cache hit.
[2024-06-02 21:17:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:17:40] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:17:40] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:17:40] [INFO ] Invariant cache hit.
[2024-06-02 21:17:40] [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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:17:43] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:17:43] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:17:43] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:17:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:17:44] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:17:44] [INFO ] Deduced a trap composed of 36 places in 74 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, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:18:16] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:18:17] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:18:17] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 53597ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 53603ms
Finished structural reductions in LTL mode , in 1 iterations and 53906 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 99 ms.
Product exploration explored 100000 steps with 1 reset in 81 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 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 109 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1115 resets) in 201 ms. (198 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (221 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (38 resets) in 57 ms. (689 steps per ms) remains 1/3 properties
[2024-06-02 21:18:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:18:35] [INFO ] Invariant cache hit.
[2024-06-02 21:18:35] [INFO ] State equation strengthened by 58 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) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/148 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/534 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 54/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/561 variables, 15/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/562 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/562 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 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) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/148 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/534 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 54/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/561 variables, 15/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/562 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6242 steps, including 868 resets, run visited all 1 properties in 16 ms. (steps per millisecond=390 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 314 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:18:36] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:18:36] [INFO ] Invariant cache hit.
[2024-06-02 21:18:36] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:18:36] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:18:36] [INFO ] Invariant cache hit.
[2024-06-02 21:18:36] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:18:36] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:18:36] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:18:36] [INFO ] Invariant cache hit.
[2024-06-02 21:18:36] [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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:18:40] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:18:40] [INFO ] Deduced a trap composed of 36 places in 71 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, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23866 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:19:13] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:19:13] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:19:13] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 54230ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 54236ms
Finished structural reductions in LTL mode , in 1 iterations and 54543 ms. Remains : 163/163 places, 431/431 transitions.
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 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 115 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1112 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (214 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (196 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (54 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (57 resets) in 110 ms. (360 steps per ms) remains 1/6 properties
[2024-06-02 21:19:31] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:19:31] [INFO ] Invariant cache hit.
[2024-06-02 21:19:31] [INFO ] State equation strengthened by 58 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) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/148 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/534 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 54/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/561 variables, 15/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/562 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/562 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 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) 94/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/148 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/534 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 54/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/561 variables, 15/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/562 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 431/431 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 163 transition count 428
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 163 transition count 422
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 157 transition count 422
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 1 with 6 rules applied. Total rules applied 21 place count 154 transition count 431
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 422
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 154 transition count 430
Reduce places removed 5 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 13 rules applied. Total rules applied 48 place count 149 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 149 transition count 416
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 415
Applied a total of 55 rules in 43 ms. Remains 148 /163 variables (removed 15) and now considering 415/431 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 148/163 places, 415/431 transitions.
RANDOM walk for 40000 steps (1289 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (41 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 31730 steps, run visited all 1 properties in 75 ms. (steps per millisecond=423 )
Probabilistic random walk after 31730 steps, saw 10970 distinct states, run finished after 79 ms. (steps per millisecond=401 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 303 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 56 ms.
Product exploration explored 100000 steps with 1 reset in 155 ms.
Built C files in :
/tmp/ltsmin3586488946306093874
[2024-06-02 21:19:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3586488946306093874
Running compilation step : cd /tmp/ltsmin3586488946306093874;'/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 757 ms.
Running link step : cd /tmp/ltsmin3586488946306093874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3586488946306093874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6007190298960382054.hoa' '--buchi-type=spotba'
LTSmin run took 1076 ms.
FORMULA FireWire-PT-11-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-11-LTLFireability-10 finished in 114010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p1)&&p0))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:19:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:19:34] [INFO ] Invariant cache hit.
[2024-06-02 21:19:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 21:19:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:19:34] [INFO ] Invariant cache hit.
[2024-06-02 21:19:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:19:34] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:19:34] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:19:34] [INFO ] Invariant cache hit.
[2024-06-02 21:19:34] [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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:19:37] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:19:37] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:19:38] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:19:38] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:19:38] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:19:38] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23085 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:20:10] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:20:11] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:20:11] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 53446ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 53451ms
Finished structural reductions in LTL mode , in 1 iterations and 53766 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-11 finished in 53910 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 431/431 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 424
Deduced a syphon composed of 6 places in 1 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 424
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 433
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 427
Applied a total of 24 rules in 22 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 21:20:28] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 21:20:28] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:20:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 21:20:28] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:20:28] [INFO ] Invariant cache hit.
[2024-06-02 21:20:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:20:28] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-02 21:20:28] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:20:28] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 21:20:28] [INFO ] Invariant cache hit.
[2024-06-02 21:20:28] [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, 420 unsolved
[2024-06-02 21:20:30] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:20:30] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:20:37] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:20:38] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:20:38] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:20:39] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:20:40] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 229 constraints, problems are : Problem set: 0 solved, 420 unsolved in 23728 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:21:03] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 54033ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 54038ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54423 ms. Remains : 153/163 places, 427/431 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-12 finished in 54534 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(p1)&&p0) U G(p2))||F(p3))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:21:23] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 21:21:23] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:21:23] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:21:23] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:21:23] [INFO ] Invariant cache hit.
[2024-06-02 21:21:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:21:23] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:21:23] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:21:23] [INFO ] Invariant cache hit.
[2024-06-02 21:21:23] [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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:21:26] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:21:26] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:21:26] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:21:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:21:26] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:21:27] [INFO ] Deduced a trap composed of 36 places in 83 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, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:21:59] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 53520ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 53526ms
Finished structural reductions in LTL mode , in 1 iterations and 53894 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-13 finished in 54113 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' '!((((p1 U G(p2))&&p0) U X(X(X(p1)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:22:17] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:22:17] [INFO ] Invariant cache hit.
[2024-06-02 21:22:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:22:17] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:22:17] [INFO ] Invariant cache hit.
[2024-06-02 21:22:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:22:17] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:22:17] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:22:17] [INFO ] Invariant cache hit.
[2024-06-02 21:22:17] [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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:22:20] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:22:20] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:22:20] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:22:20] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:22:20] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:22:21] [INFO ] Deduced a trap composed of 36 places in 70 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, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23067 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:22:53] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:22:54] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:22:54] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 53369ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 53375ms
Finished structural reductions in LTL mode , in 1 iterations and 53664 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 667 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-14 finished in 54356 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((X(G(p2))&&p1)) U (G(p4)&&p3))))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:23:11] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:23:11] [INFO ] Invariant cache hit.
[2024-06-02 21:23:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:23:11] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:23:11] [INFO ] Invariant cache hit.
[2024-06-02 21:23:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:23:11] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 21:23:11] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 21:23:11] [INFO ] Invariant cache hit.
[2024-06-02 21:23:11] [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, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:23:14] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:23:14] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:23:14] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:23:15] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:23:15] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:23:15] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 430 unsolved in 23293 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/561 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 430/663 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:23:48] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:23:48] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:23:48] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 1/562 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 9/9 constraints]
After SMT, in 53616ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 53620ms
Finished structural reductions in LTL mode , in 1 iterations and 53935 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p3) (NOT p4)), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (AND (NOT p4) (NOT p0)), (NOT p4), (AND (NOT p0) (NOT p4)), true, (NOT p2), (OR (AND (NOT p1) p2) (AND p1 (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p0 (NOT p4)))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-15 finished in 54536 ms.
All properties solved by simple procedures.
Total runtime 726777 ms.

BK_STOP 1717363446161

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-11"
export BK_EXAMINATION="LTLFireability"
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-11, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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