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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 91K 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-05-LTLFireability-00
FORMULA_NAME FireWire-PT-05-LTLFireability-01
FORMULA_NAME FireWire-PT-05-LTLFireability-02
FORMULA_NAME FireWire-PT-05-LTLFireability-03
FORMULA_NAME FireWire-PT-05-LTLFireability-04
FORMULA_NAME FireWire-PT-05-LTLFireability-05
FORMULA_NAME FireWire-PT-05-LTLFireability-06
FORMULA_NAME FireWire-PT-05-LTLFireability-07
FORMULA_NAME FireWire-PT-05-LTLFireability-08
FORMULA_NAME FireWire-PT-05-LTLFireability-09
FORMULA_NAME FireWire-PT-05-LTLFireability-10
FORMULA_NAME FireWire-PT-05-LTLFireability-11
FORMULA_NAME FireWire-PT-05-LTLFireability-12
FORMULA_NAME FireWire-PT-05-LTLFireability-13
FORMULA_NAME FireWire-PT-05-LTLFireability-14
FORMULA_NAME FireWire-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717360183193

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 20:29:44] [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 20:29:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:29:44] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 20:29:44] [INFO ] Transformed 114 places.
[2024-06-02 20:29:44] [INFO ] Transformed 373 transitions.
[2024-06-02 20:29:44] [INFO ] Found NUPN structural information;
[2024-06-02 20:29:44] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 174 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 5 formulas.
Ensure Unique test removed 57 transitions
Reduce redundant transitions removed 57 transitions.
FORMULA FireWire-PT-05-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-05-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-05-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 316/316 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 310
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 111 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 111 transition count 301
Applied a total of 15 rules in 34 ms. Remains 111 /114 variables (removed 3) and now considering 301/316 (removed 15) transitions.
[2024-06-02 20:29:44] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 111 cols
[2024-06-02 20:29:44] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 20:29:44] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-02 20:29:44] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:29:44] [INFO ] Invariant cache hit.
[2024-06-02 20:29:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:29:45] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [13, 64, 69]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 414 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/114 places, 301/316 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 108/114 places, 301/316 transitions.
Support contains 34 out of 108 places after structural reductions.
[2024-06-02 20:29:45] [INFO ] Flatten gal took : 46 ms
[2024-06-02 20:29:45] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:29:45] [INFO ] Input system was already deterministic with 301 transitions.
RANDOM walk for 40000 steps (2158 resets) in 1813 ms. (22 steps per ms) remains 14/25 properties
BEST_FIRST walk for 40004 steps (16 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (13 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (559 resets) in 143 ms. (277 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40002 steps (552 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (534 resets) in 246 ms. (161 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (21 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (66 resets) in 58 ms. (678 steps per ms) remains 7/10 properties
[2024-06-02 20:29:46] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 108 cols
[2024-06-02 20:29:46] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 20:29:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 42/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 48/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:29:46] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 271/373 variables, 102/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 6/379 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/382 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/383 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/383 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 154 constraints, problems are : Problem set: 0 solved, 7 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 42/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 48/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:29:47] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 271/373 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 6/379 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:29:47] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/382 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 1/383 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/383 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/383 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 163 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1828ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 2 properties in 1590 ms.
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 297
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 107 transition count 296
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 106 transition count 296
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 103 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 103 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 103 transition count 293
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 103 transition count 293
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 30 place count 100 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 100 transition count 289
Applied a total of 32 rules in 64 ms. Remains 100 /108 variables (removed 8) and now considering 289/301 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 100/108 places, 289/301 transitions.
RANDOM walk for 40000 steps (2417 resets) in 674 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (690 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (656 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (61 resets) in 172 ms. (231 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (619 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
[2024-06-02 20:29:50] [INFO ] Flow matrix only has 260 transitions (discarded 29 similar events)
// Phase 1: matrix 260 rows 100 cols
[2024-06-02 20:29:50] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 20:29:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 45/96 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 259/355 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 5/360 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 146 constraints, problems are : Problem set: 0 solved, 4 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 45/96 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:29:50] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:29:50] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 259/355 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/360 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:29:51] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/360 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 153 constraints, problems are : Problem set: 0 solved, 4 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 811ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 476 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 289/289 transitions.
Applied a total of 0 rules in 21 ms. Remains 100 /100 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 100/100 places, 289/289 transitions.
RANDOM walk for 40000 steps (2349 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (641 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (73 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (643 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 594936 steps, run visited all 4 properties in 1706 ms. (steps per millisecond=348 )
Probabilistic random walk after 594936 steps, saw 133464 distinct states, run finished after 1711 ms. (steps per millisecond=347 ) properties seen :4
FORMULA FireWire-PT-05-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 11 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(p0)||(G(p1)&&(F(p2) U p3))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 103 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 103 transition count 299
Applied a total of 16 rules in 26 ms. Remains 103 /108 variables (removed 5) and now considering 299/301 (removed 2) transitions.
[2024-06-02 20:29:54] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
// Phase 1: matrix 266 rows 103 cols
[2024-06-02 20:29:54] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 20:29:54] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:29:54] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
[2024-06-02 20:29:54] [INFO ] Invariant cache hit.
[2024-06-02 20:29:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:29:54] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-02 20:29:54] [INFO ] Redundant transitions in 16 ms returned []
Running 298 sub problems to find dead transitions.
[2024-06-02 20:29:54] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
[2024-06-02 20:29:54] [INFO ] Invariant cache hit.
[2024-06-02 20:29:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:29:56] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:29:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 265/368 variables, 103/113 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 41/154 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 155 constraints, problems are : Problem set: 0 solved, 298 unsolved in 11885 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 265/368 variables, 103/113 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 41/154 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 298/452 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 20:30:09] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 1/369 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 11 (OVERLAPS) 0/369 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 454 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20862 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 6/6 constraints]
After SMT, in 32972ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 32977ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/108 places, 299/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33271 ms. Remains : 103/108 places, 299/301 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0)]
Running random walk in product with property : FireWire-PT-05-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-05-LTLFireability-00 finished in 33672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||X(G(p1)))))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-02 20:30:27] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 108 cols
[2024-06-02 20:30:27] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:30:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:30:27] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:30:27] [INFO ] Invariant cache hit.
[2024-06-02 20:30:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:30:27] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 301/301 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 107/108 places, 301/301 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-05-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-05-LTLFireability-03 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-02 20:30:28] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:30:28] [INFO ] Invariant cache hit.
[2024-06-02 20:30:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:30:28] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:30:28] [INFO ] Invariant cache hit.
[2024-06-02 20:30:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:30:28] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 301/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 107/108 places, 301/301 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-05-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-05-LTLFireability-05 finished in 383 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))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 106 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 298
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 102 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 102 transition count 298
Applied a total of 16 rules in 33 ms. Remains 102 /108 variables (removed 6) and now considering 298/301 (removed 3) transitions.
[2024-06-02 20:30:28] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 20:30:28] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:30:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:30:28] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:30:28] [INFO ] Invariant cache hit.
[2024-06-02 20:30:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:30:28] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 209 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/108 places, 298/301 transitions.
Applied a total of 0 rules in 8 ms. Remains 101 /101 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 101/108 places, 298/301 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-05-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-05-LTLFireability-08 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||!p1)) U p2))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-02 20:30:28] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 108 cols
[2024-06-02 20:30:28] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:30:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:30:28] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:30:28] [INFO ] Invariant cache hit.
[2024-06-02 20:30:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:30:29] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 301/301 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 107/108 places, 301/301 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : FireWire-PT-05-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-05-LTLFireability-09 finished in 348 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((F(p1)||p0))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 103 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 103 transition count 299
Applied a total of 16 rules in 18 ms. Remains 103 /108 variables (removed 5) and now considering 299/301 (removed 2) transitions.
[2024-06-02 20:30:29] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
// Phase 1: matrix 266 rows 103 cols
[2024-06-02 20:30:29] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:30:29] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:30:29] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
[2024-06-02 20:30:29] [INFO ] Invariant cache hit.
[2024-06-02 20:30:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:30:29] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 240 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/108 places, 299/301 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 264 ms. Remains : 102/108 places, 299/301 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-05-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 142 ms.
Product exploration explored 100000 steps with 1 reset in 81 ms.
Computed a total of 3 stabilizing places and 9 stable transitions
Computed a total of 3 stabilizing places and 9 stable transitions
Detected a total of 3/102 stabilizing places and 9/299 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36400 steps (2216 resets) in 212 ms. (170 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 299/299 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-02 20:30:30] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
// Phase 1: matrix 266 rows 102 cols
[2024-06-02 20:30:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:30:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 20:30:30] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
[2024-06-02 20:30:30] [INFO ] Invariant cache hit.
[2024-06-02 20:30:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:30:30] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 20:30:30] [INFO ] Redundant transitions in 9 ms returned []
Running 298 sub problems to find dead transitions.
[2024-06-02 20:30:30] [INFO ] Flow matrix only has 266 transitions (discarded 33 similar events)
[2024-06-02 20:30:30] [INFO ] Invariant cache hit.
[2024-06-02 20:30:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 20:30:32] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:30:32] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
[2024-06-02 20:30:32] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:30:32] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 265/367 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 298 unsolved in 11528 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 265/367 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 298/449 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 20:30:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 20:30:49] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 1/368 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 12 (OVERLAPS) 0/368 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 452 constraints, problems are : Problem set: 0 solved, 298 unsolved in 25696 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 6/6 constraints]
After SMT, in 37417ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 37421ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37657 ms. Remains : 102/102 places, 299/299 transitions.
Computed a total of 3 stabilizing places and 9 stable transitions
Computed a total of 3 stabilizing places and 9 stable transitions
Detected a total of 3/102 stabilizing places and 9/299 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36611 steps (2143 resets) in 130 ms. (279 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 294 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Built C files in :
/tmp/ltsmin11427997001001985278
[2024-06-02 20:31:09] [INFO ] Computing symmetric may disable matrix : 299 transitions.
[2024-06-02 20:31:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:31:09] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2024-06-02 20:31:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:31:09] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2024-06-02 20:31:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:31:09] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11427997001001985278
Running compilation step : cd /tmp/ltsmin11427997001001985278;'/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 756 ms.
Running link step : cd /tmp/ltsmin11427997001001985278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11427997001001985278;'/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/stateBased8682035941498549735.hoa' '--buchi-type=spotba'
LTSmin run took 883 ms.
FORMULA FireWire-PT-05-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-05-LTLFireability-11 finished in 41932 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((F(p1)&&X(G(p2))&&p0)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 106 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 103 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 103 transition count 298
Applied a total of 12 rules in 26 ms. Remains 103 /108 variables (removed 5) and now considering 298/301 (removed 3) transitions.
[2024-06-02 20:31:11] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
// Phase 1: matrix 268 rows 103 cols
[2024-06-02 20:31:11] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:31:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:31:11] [INFO ] Flow matrix only has 268 transitions (discarded 30 similar events)
[2024-06-02 20:31:11] [INFO ] Invariant cache hit.
[2024-06-02 20:31:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:31:11] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/108 places, 298/301 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 102/108 places, 298/301 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-05-LTLFireability-12 finished in 413 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)||X(F(p1)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 106 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 298
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 102 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 102 transition count 298
Applied a total of 16 rules in 13 ms. Remains 102 /108 variables (removed 6) and now considering 298/301 (removed 3) transitions.
[2024-06-02 20:31:11] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2024-06-02 20:31:11] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 20:31:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:31:11] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:31:11] [INFO ] Invariant cache hit.
[2024-06-02 20:31:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:31:11] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/108 places, 298/301 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 101/108 places, 298/301 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 1 reset in 131 ms.
Product exploration explored 100000 steps with 2 reset in 83 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2578 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (22 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (14 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 10789 steps, run visited all 3 properties in 25 ms. (steps per millisecond=431 )
Probabilistic random walk after 10789 steps, saw 3429 distinct states, run finished after 25 ms. (steps per millisecond=431 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 298/298 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 20:31:12] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 101 cols
[2024-06-02 20:31:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:31:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:31:12] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:31:12] [INFO ] Invariant cache hit.
[2024-06-02 20:31:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:31:12] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 20:31:12] [INFO ] Redundant transitions in 6 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 20:31:12] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:31:12] [INFO ] Invariant cache hit.
[2024-06-02 20:31:12] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:31:13] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:31:13] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:31:14] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:31:14] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/364 variables, 100/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:31:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:31:18] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 151 constraints, problems are : Problem set: 0 solved, 295 unsolved in 14911 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/364 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 295/445 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:31:30] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:31:32] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:31:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 449 constraints, problems are : Problem set: 0 solved, 295 unsolved in 22683 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37772ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37776ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38006 ms. Remains : 101/101 places, 298/298 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2588 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (13 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 10789 steps, run visited all 3 properties in 30 ms. (steps per millisecond=359 )
Probabilistic random walk after 10789 steps, saw 3429 distinct states, run finished after 30 ms. (steps per millisecond=359 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Built C files in :
/tmp/ltsmin279606424894240430
[2024-06-02 20:31:51] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-06-02 20:31:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:31:51] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-06-02 20:31:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:31:51] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-06-02 20:31:51] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:31:51] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin279606424894240430
Running compilation step : cd /tmp/ltsmin279606424894240430;'/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 649 ms.
Running link step : cd /tmp/ltsmin279606424894240430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin279606424894240430;'/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/stateBased15533231099100082428.hoa' '--buchi-type=spotba'
LTSmin run took 638 ms.
FORMULA FireWire-PT-05-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-05-LTLFireability-13 finished in 41419 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((X(p1)||p0))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-02 20:31:52] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 108 cols
[2024-06-02 20:31:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:31:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:31:52] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:31:52] [INFO ] Invariant cache hit.
[2024-06-02 20:31:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:31:53] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 301/301 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 107/108 places, 301/301 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-05-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 2 reset in 45 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 116 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2203 resets) in 160 ms. (248 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (84 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (79 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (78 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
[2024-06-02 20:31:53] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 107 cols
[2024-06-02 20:31:53] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:31:53] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 73/77 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 23/100 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 271/371 variables, 100/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 38/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/378 variables, 5/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/381 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/382 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/382 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 151 constraints, problems are : Problem set: 1 solved, 2 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/100 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 271/371 variables, 100/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 38/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/378 variables, 5/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 20:31:54] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/381 variables, 2/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/382 variables, 1/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/382 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 154 constraints, problems are : Problem set: 1 solved, 2 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 520ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 301/301 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 297
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 296
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 105 transition count 296
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 102 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 102 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 102 transition count 293
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 102 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 98 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 98 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 97 transition count 287
Applied a total of 35 rules in 44 ms. Remains 97 /107 variables (removed 10) and now considering 287/301 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 97/107 places, 287/301 transitions.
RANDOM walk for 40000 steps (2505 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (60 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (64 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 594929 steps, run visited all 2 properties in 1377 ms. (steps per millisecond=432 )
Probabilistic random walk after 594929 steps, saw 133376 distinct states, run finished after 1377 ms. (steps per millisecond=432 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 343 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 105 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 104 transition count 298
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 101 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 101 transition count 298
Applied a total of 16 rules in 13 ms. Remains 101 /107 variables (removed 6) and now considering 298/301 (removed 3) transitions.
[2024-06-02 20:31:56] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 101 cols
[2024-06-02 20:31:56] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:31:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:31:56] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:31:56] [INFO ] Invariant cache hit.
[2024-06-02 20:31:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:31:56] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 20:31:56] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 20:31:56] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:31:56] [INFO ] Invariant cache hit.
[2024-06-02 20:31:56] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:31:57] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:31:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:31:57] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-02 20:31:57] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/364 variables, 100/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:32:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:32:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 151 constraints, problems are : Problem set: 0 solved, 295 unsolved in 14555 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/364 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 295/445 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:32:14] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 4 ms to minimize.
[2024-06-02 20:32:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:32:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 449 constraints, problems are : Problem set: 0 solved, 295 unsolved in 22530 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 37263ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 37265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/107 places, 298/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37479 ms. Remains : 101/107 places, 298/301 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2574 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (68 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (632 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (60 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (569 resets) in 53 ms. (740 steps per ms) remains 3/6 properties
[2024-06-02 20:32:34] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:32:34] [INFO ] Invariant cache hit.
[2024-06-02 20:32:34] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 240/314 variables, 74/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 28/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/363 variables, 25/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 12/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/365 variables, 2/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/365 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 145 constraints, problems are : Problem set: 1 solved, 2 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/314 variables, 74/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 28/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/363 variables, 25/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 12/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 2/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 20:32:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 1/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/365 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/365 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 148 constraints, problems are : Problem set: 1 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 415ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 298/298 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 292
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 101 transition count 291
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 97 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 97 transition count 287
Applied a total of 18 rules in 14 ms. Remains 97 /101 variables (removed 4) and now considering 287/298 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 97/101 places, 287/298 transitions.
RANDOM walk for 40000 steps (2584 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (70 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (71 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 594929 steps, run visited all 2 properties in 1902 ms. (steps per millisecond=312 )
Probabilistic random walk after 594929 steps, saw 133376 distinct states, run finished after 1902 ms. (steps per millisecond=312 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 343 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 53 ms.
Built C files in :
/tmp/ltsmin7054041144990532410
[2024-06-02 20:32:37] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-06-02 20:32:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:32:37] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-06-02 20:32:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:32:37] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-06-02 20:32:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:32:37] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7054041144990532410
Running compilation step : cd /tmp/ltsmin7054041144990532410;'/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 655 ms.
Running link step : cd /tmp/ltsmin7054041144990532410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7054041144990532410;'/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/stateBased16323700358783245257.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 298/298 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 20:32:52] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:32:52] [INFO ] Invariant cache hit.
[2024-06-02 20:32:52] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:32:52] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:32:52] [INFO ] Invariant cache hit.
[2024-06-02 20:32:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:32:52] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 20:32:52] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 20:32:52] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2024-06-02 20:32:52] [INFO ] Invariant cache hit.
[2024-06-02 20:32:52] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/364 variables, 100/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:32:56] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:32:58] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 151 constraints, problems are : Problem set: 0 solved, 295 unsolved in 14245 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/364 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 40/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 295/445 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 20:33:09] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:33:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:33:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 449 constraints, problems are : Problem set: 0 solved, 295 unsolved in 21998 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints]
After SMT, in 36411ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 36414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36610 ms. Remains : 101/101 places, 298/298 transitions.
Built C files in :
/tmp/ltsmin4525953811892942407
[2024-06-02 20:33:29] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-06-02 20:33:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:33:29] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-06-02 20:33:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:33:29] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-06-02 20:33:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:33:29] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4525953811892942407
Running compilation step : cd /tmp/ltsmin4525953811892942407;'/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 663 ms.
Running link step : cd /tmp/ltsmin4525953811892942407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4525953811892942407;'/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/stateBased12102872055668453923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 20:33:44] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:33:44] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:33:44] [INFO ] Time to serialize gal into /tmp/LTL6814367732275902007.gal : 4 ms
[2024-06-02 20:33:44] [INFO ] Time to serialize properties into /tmp/LTL7490942780860805987.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6814367732275902007.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16238109031945780938.hoa' '-atoms' '/tmp/LTL7490942780860805987.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7490942780860805987.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16238109031945780938.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t7, t11, t12, t14, t17, t19, t23, t24, t26, t29, t31, t35, t36, t38, t39, t41, t4...608
Computing Next relation with stutter on 16000 deadlock states
Detected timeout of ITS tools.
[2024-06-02 20:33:59] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:33:59] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:33:59] [INFO ] Time to serialize gal into /tmp/LTL16506001272855516704.gal : 2 ms
[2024-06-02 20:33:59] [INFO ] Time to serialize properties into /tmp/LTL5144471600121000050.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16506001272855516704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5144471600121000050.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p4!=1)||(p51!=1))")||(X("((p9!=1)||(p73!=1))"))))))
Formula 0 simplified : GF(!"((p4!=1)||(p51!=1))" & X!"((p9!=1)||(p73!=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t7, t11, t12, t14, t17, t19, t23, t24, t26, t29, t31, t35, t36, t38, t39, t41, t4...608
Computing Next relation with stutter on 16000 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
364 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.67056,101556,1,0,503,296215,622,268,6034,314464,615
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FireWire-PT-05-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FireWire-PT-05-LTLFireability-14 finished in 130350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((X(F(!p1))||G(p0)))) U (G(!p2) U !p0)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-02 20:34:03] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 108 cols
[2024-06-02 20:34:03] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:34:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:34:03] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:34:03] [INFO ] Invariant cache hit.
[2024-06-02 20:34:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:34:03] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 237 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 301/301 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 107/108 places, 301/301 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND p1 p2), p0, (OR p1 p0), (OR p0 (AND p1 p2)), p1, (OR p1 p0)]
Running random walk in product with property : FireWire-PT-05-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-05-LTLFireability-15 finished in 518 ms.
All properties solved by simple procedures.
Total runtime 259505 ms.

BK_STOP 1717360443829

--------------------
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-05"
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-05, 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-171734898800204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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