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.r576-smll-171734919900036.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 MedleyA-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 75K 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 MedleyA-PT-05-LTLFireability-00
FORMULA_NAME MedleyA-PT-05-LTLFireability-01
FORMULA_NAME MedleyA-PT-05-LTLFireability-02
FORMULA_NAME MedleyA-PT-05-LTLFireability-03
FORMULA_NAME MedleyA-PT-05-LTLFireability-04
FORMULA_NAME MedleyA-PT-05-LTLFireability-05
FORMULA_NAME MedleyA-PT-05-LTLFireability-06
FORMULA_NAME MedleyA-PT-05-LTLFireability-07
FORMULA_NAME MedleyA-PT-05-LTLFireability-08
FORMULA_NAME MedleyA-PT-05-LTLFireability-09
FORMULA_NAME MedleyA-PT-05-LTLFireability-10
FORMULA_NAME MedleyA-PT-05-LTLFireability-11
FORMULA_NAME MedleyA-PT-05-LTLFireability-12
FORMULA_NAME MedleyA-PT-05-LTLFireability-13
FORMULA_NAME MedleyA-PT-05-LTLFireability-14
FORMULA_NAME MedleyA-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717354754356

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:59:16] [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 18:59:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:59:16] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-06-02 18:59:16] [INFO ] Transformed 115 places.
[2024-06-02 18:59:16] [INFO ] Transformed 257 transitions.
[2024-06-02 18:59:16] [INFO ] Found NUPN structural information;
[2024-06-02 18:59:16] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 94 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA MedleyA-PT-05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 226
Applied a total of 28 rules in 51 ms. Remains 101 /115 variables (removed 14) and now considering 226/254 (removed 28) transitions.
[2024-06-02 18:59:17] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
// Phase 1: matrix 225 rows 101 cols
[2024-06-02 18:59:17] [INFO ] Computed 20 invariants in 16 ms
[2024-06-02 18:59:17] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-06-02 18:59:17] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:59:17] [INFO ] Invariant cache hit.
[2024-06-02 18:59:17] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:59:17] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 18:59:17] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:59:17] [INFO ] Invariant cache hit.
[2024-06-02 18:59:17] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 18:59:20] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 18 ms to minimize.
[2024-06-02 18:59:20] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:59:20] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 218 constraints, problems are : Problem set: 0 solved, 225 unsolved in 11089 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 225/442 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 18:59:41] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/326 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/326 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 444 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20969 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 4/4 constraints]
After SMT, in 32441ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 32470ms
Starting structural reductions in LTL mode, iteration 1 : 101/115 places, 226/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33227 ms. Remains : 101/115 places, 226/254 transitions.
Support contains 42 out of 101 places after structural reductions.
[2024-06-02 18:59:50] [INFO ] Flatten gal took : 87 ms
[2024-06-02 18:59:50] [INFO ] Flatten gal took : 44 ms
[2024-06-02 18:59:50] [INFO ] Input system was already deterministic with 226 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (2983 resets) in 2333 ms. (17 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40004 steps (469 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (482 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (436 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (482 resets) in 173 ms. (229 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (357 resets) in 170 ms. (233 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (378 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (478 resets) in 87 ms. (454 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (470 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
[2024-06-02 18:59:51] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:59:51] [INFO ] Invariant cache hit.
[2024-06-02 18:59:51] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/86 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/99 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 223/322 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/325 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/326 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 215 constraints, problems are : Problem set: 0 solved, 5 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/86 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/99 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 223/322 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/325 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/326 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/326 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 220 constraints, problems are : Problem set: 0 solved, 5 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1180ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 121 ms.
Computed a total of 13 stabilizing places and 86 stable transitions
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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(((X(p0)&&F(!p1))||G(p0))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 6 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:59:53] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:59:53] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 18:59:53] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:59:53] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:59:53] [INFO ] Invariant cache hit.
[2024-06-02 18:59:53] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:59:54] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:59:54] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:59:54] [INFO ] Invariant cache hit.
[2024-06-02 18:59:54] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:59:55] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9186 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14604 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 24011ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 24016ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24385 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-01 finished in 24814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 99 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 95 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 95 transition count 217
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 27 place count 86 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 86 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 86 transition count 255
Applied a total of 43 rules in 73 ms. Remains 86 /101 variables (removed 15) and now considering 255/226 (removed -29) transitions.
[2024-06-02 19:00:18] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
// Phase 1: matrix 254 rows 86 cols
[2024-06-02 19:00:18] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 19:00:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:00:18] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 19:00:18] [INFO ] Invariant cache hit.
[2024-06-02 19:00:18] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 19:00:18] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 19:00:18] [INFO ] Redundant transitions in 63 ms returned []
Running 246 sub problems to find dead transitions.
[2024-06-02 19:00:18] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 19:00:18] [INFO ] Invariant cache hit.
[2024-06-02 19:00:18] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-06-02 19:00:21] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 136 constraints, problems are : Problem set: 0 solved, 246 unsolved in 10884 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 246/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 382 constraints, problems are : Problem set: 0 solved, 246 unsolved in 16441 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
After SMT, in 27833ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 27839ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/101 places, 255/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28263 ms. Remains : 86/101 places, 255/226 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-02 finished in 28369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 7 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 19:00:46] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 19:00:46] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:00:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 19:00:46] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:00:46] [INFO ] Invariant cache hit.
[2024-06-02 19:00:47] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:00:47] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 19:00:47] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:00:47] [INFO ] Invariant cache hit.
[2024-06-02 19:00:47] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 19:00:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 22176ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 22179ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22483 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-03 finished in 22633 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||(p1&&X(p1))))&&F(G(p2)))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 19:01:09] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:01:09] [INFO ] Invariant cache hit.
[2024-06-02 19:01:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:01:09] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:01:09] [INFO ] Invariant cache hit.
[2024-06-02 19:01:09] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:01:09] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 19:01:09] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:01:09] [INFO ] Invariant cache hit.
[2024-06-02 19:01:09] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 19:01:11] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10976 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12961 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 24054ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 24057ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24330 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-04
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-04 finished in 24553 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((X(p1)&&p0))||X(G(p2)))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 220
Applied a total of 6 rules in 8 ms. Remains 98 /101 variables (removed 3) and now considering 220/226 (removed 6) transitions.
[2024-06-02 19:01:34] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 19:01:34] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:01:34] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:01:34] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 19:01:34] [INFO ] Invariant cache hit.
[2024-06-02 19:01:34] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:01:34] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-02 19:01:34] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 19:01:34] [INFO ] Invariant cache hit.
[2024-06-02 19:01:34] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 19:01:36] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 19:01:40] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 214 constraints, problems are : Problem set: 0 solved, 219 unsolved in 12052 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 433 constraints, problems are : Problem set: 0 solved, 219 unsolved in 12976 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
After SMT, in 25219ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 25223ms
Starting structural reductions in LTL mode, iteration 1 : 98/101 places, 220/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25542 ms. Remains : 98/101 places, 220/226 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-05
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-05 finished in 25805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 6 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 19:01:59] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 19:01:59] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 19:01:59] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 19:01:59] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:01:59] [INFO ] Invariant cache hit.
[2024-06-02 19:02:00] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:02:00] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 19:02:00] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:02:00] [INFO ] Invariant cache hit.
[2024-06-02 19:02:00] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 19:02:01] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10387 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14493 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 25090ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 25093ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25504 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-06 finished in 25649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1))||F((F(p3)&&p2)))))'
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 19:02:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:02:25] [INFO ] Invariant cache hit.
[2024-06-02 19:02:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 19:02:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:02:25] [INFO ] Invariant cache hit.
[2024-06-02 19:02:25] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:02:25] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 19:02:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:02:25] [INFO ] Invariant cache hit.
[2024-06-02 19:02:25] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 19:02:27] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9980 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14346 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 24457ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 24459ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24714 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-07
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-07 finished in 24962 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||X(F(p1)))))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 19:02:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:02:50] [INFO ] Invariant cache hit.
[2024-06-02 19:02:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 19:02:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:02:50] [INFO ] Invariant cache hit.
[2024-06-02 19:02:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:02:50] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 19:02:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:02:50] [INFO ] Invariant cache hit.
[2024-06-02 19:02:50] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 19:02:52] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10206 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12967 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 23299ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 23302ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23651 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 156 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 : MedleyA-PT-05-LTLFireability-08
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-08 finished in 23828 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((G(p0) U G(p1))))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 99 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 222
Applied a total of 4 rules in 4 ms. Remains 99 /101 variables (removed 2) and now considering 222/226 (removed 4) transitions.
[2024-06-02 19:03:14] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 19:03:14] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 19:03:14] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:03:14] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 19:03:14] [INFO ] Invariant cache hit.
[2024-06-02 19:03:14] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:03:14] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 19:03:14] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 19:03:14] [INFO ] Invariant cache hit.
[2024-06-02 19:03:14] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 19:03:15] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:03:16] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-02 19:03:16] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 216 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8981 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 437 constraints, problems are : Problem set: 0 solved, 221 unsolved in 13567 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
After SMT, in 22660ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 22662ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 222/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22924 ms. Remains : 99/101 places, 222/226 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-09 finished in 23183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 2 place count 100 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 33 place count 84 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 84 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 3 with 37 rules applied. Total rules applied 74 place count 84 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 83 transition count 263
Applied a total of 76 rules in 56 ms. Remains 83 /101 variables (removed 18) and now considering 263/226 (removed -37) transitions.
[2024-06-02 19:03:37] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
// Phase 1: matrix 262 rows 83 cols
[2024-06-02 19:03:37] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 19:03:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 19:03:37] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 19:03:37] [INFO ] Invariant cache hit.
[2024-06-02 19:03:37] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 19:03:37] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 19:03:37] [INFO ] Redundant transitions in 67 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 19:03:37] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 19:03:37] [INFO ] Invariant cache hit.
[2024-06-02 19:03:37] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 19:03:40] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 11324 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 17598 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 29229ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 29234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/101 places, 263/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29715 ms. Remains : 83/101 places, 263/226 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 766 steps (68 resets) in 13 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 263/263 transitions.
Applied a total of 0 rules in 15 ms. Remains 83 /83 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 19:04:08] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 19:04:08] [INFO ] Invariant cache hit.
[2024-06-02 19:04:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:04:08] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 19:04:08] [INFO ] Invariant cache hit.
[2024-06-02 19:04:08] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 19:04:08] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-02 19:04:08] [INFO ] Redundant transitions in 59 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 19:04:08] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 19:04:08] [INFO ] Invariant cache hit.
[2024-06-02 19:04:08] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 19:04:10] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 10836 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 17957 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 29315ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 29320ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29784 ms. Remains : 83/83 places, 263/263 transitions.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1654 steps (149 resets) in 17 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 116 ms.
Built C files in :
/tmp/ltsmin699247306581803169
[2024-06-02 19:04:38] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-06-02 19:04:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:04:38] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-06-02 19:04:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:04:38] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-06-02 19:04:38] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:04:38] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin699247306581803169
Running compilation step : cd /tmp/ltsmin699247306581803169;'/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 1321 ms.
Running link step : cd /tmp/ltsmin699247306581803169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin699247306581803169;'/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/stateBased5373550502914709126.hoa' '--buchi-type=spotba'
LTSmin run took 976 ms.
FORMULA MedleyA-PT-05-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-05-LTLFireability-10 finished in 63737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U !p2)&&p0))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 3 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 19:04:41] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 19:04:41] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 19:04:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 19:04:41] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:04:41] [INFO ] Invariant cache hit.
[2024-06-02 19:04:41] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:04:41] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 19:04:41] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:04:41] [INFO ] Invariant cache hit.
[2024-06-02 19:04:41] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 19:04:43] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10483 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14750 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 25421ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 25425ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25734 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p2), p2, (OR (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-12 finished in 25897 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(((F((G(F(!p1))||(!p2&&F(!p1))))&&p0)||(p3&&G(p4)&&F((G(F(!p1))||(!p2&&F(!p1)))))))))'
Support contains 12 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 100 transition count 224
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 85 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 85 transition count 256
Applied a total of 60 rules in 29 ms. Remains 85 /101 variables (removed 16) and now considering 256/226 (removed -30) transitions.
[2024-06-02 19:05:07] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
// Phase 1: matrix 255 rows 85 cols
[2024-06-02 19:05:07] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:05:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:05:07] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 19:05:07] [INFO ] Invariant cache hit.
[2024-06-02 19:05:07] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 19:05:07] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 19:05:07] [INFO ] Redundant transitions in 42 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-02 19:05:07] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 19:05:07] [INFO ] Invariant cache hit.
[2024-06-02 19:05:07] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 19:05:09] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 244 constraints, problems are : Problem set: 0 solved, 255 unsolved in 10923 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 255/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 499 constraints, problems are : Problem set: 0 solved, 255 unsolved in 16777 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
After SMT, in 27961ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 27964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/101 places, 256/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28285 ms. Remains : 85/101 places, 256/226 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 519 ms.
Product exploration explored 100000 steps with 1 reset in 500 ms.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X p0), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X p0)), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 201 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 7 states, 22 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
RANDOM walk for 40000 steps (3407 resets) in 1524 ms. (26 steps per ms) remains 11/20 properties
BEST_FIRST walk for 40004 steps (239 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (236 resets) in 552 ms. (72 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (245 resets) in 331 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (238 resets) in 359 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (250 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (243 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (193 resets) in 432 ms. (92 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (380 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (243 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (252 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (251 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
[2024-06-02 19:05:38] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 19:05:38] [INFO ] Invariant cache hit.
[2024-06-02 19:05:38] [INFO ] State equation strengthened by 138 read => feed constraints.
Problem apf2 is UNSAT
Problem apf18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 243 constraints, problems are : Problem set: 2 solved, 9 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 9/251 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/340 variables, 1/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 252 constraints, problems are : Problem set: 2 solved, 9 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1621ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 3247 steps, including 44 resets, run visited all 1 properties in 14 ms. (steps per millisecond=231 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 94 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X p0), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X p0)), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p4))), (G (OR (NOT p2) (NOT p4)))]
False Knowledge obtained : [(F (NOT (OR p0 p4))), (F (NOT (OR p4 (NOT p1)))), (F (NOT (OR p0 (NOT p4)))), (F (NOT (OR (NOT p0) p2 (NOT p4) (NOT p1)))), (F (NOT p4)), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p3) (NOT p4) (NOT p1))))), (F (NOT (OR (NOT p4) (NOT p1)))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p2) (NOT p3) (NOT p4))))), (F (NOT (OR (NOT p0) p4 (NOT p1)))), (F (NOT (OR (NOT p2) p4))), (F (NOT (OR (NOT p0) (NOT p2) p4))), (F p1), (F p2), (F (NOT p0)), (F (NOT (OR p2 (NOT p4) (NOT p1)))), (F (NOT p3)), (F (NOT (AND (OR p0 p3) (OR p0 p4)))), (F (NOT (OR p0 (NOT p3) (NOT p4))))]
Knowledge based reduction with 27 factoid took 950 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 312 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-02 19:05:41] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 19:05:41] [INFO ] Invariant cache hit.
[2024-06-02 19:05:42] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:05:42] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 19:05:42] [INFO ] Invariant cache hit.
[2024-06-02 19:05:42] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 19:05:42] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-02 19:05:42] [INFO ] Redundant transitions in 44 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-02 19:05:42] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 19:05:42] [INFO ] Invariant cache hit.
[2024-06-02 19:05:42] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 19:05:44] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 244 constraints, problems are : Problem set: 0 solved, 255 unsolved in 11109 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 255/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 499 constraints, problems are : Problem set: 0 solved, 255 unsolved in 18556 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
After SMT, in 29973ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 29977ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30269 ms. Remains : 85/85 places, 256/256 transitions.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 221 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
RANDOM walk for 40000 steps (3415 resets) in 364 ms. (109 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40003 steps (239 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (256 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (249 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (187 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (389 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (251 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (244 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
[2024-06-02 19:06:13] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 19:06:13] [INFO ] Invariant cache hit.
[2024-06-02 19:06:13] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
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) 46/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 243 constraints, problems are : Problem set: 0 solved, 7 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 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) 46/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 7/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/340 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 250 constraints, problems are : Problem set: 0 solved, 7 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1489ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 277 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 254
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 85 transition count 308
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 43 place count 72 transition count 293
Applied a total of 43 rules in 38 ms. Remains 72 /85 variables (removed 13) and now considering 293/256 (removed -37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 72/85 places, 293/256 transitions.
RANDOM walk for 40000 steps (4699 resets) in 479 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (295 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (234 resets) in 83 ms. (476 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (575 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (307 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
// Phase 1: matrix 293 rows 72 cols
[2024-06-02 19:06:15] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:06:15] [INFO ] State equation strengthened by 163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/365 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 163/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 255 constraints, problems are : Problem set: 0 solved, 3 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 72/72 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/365 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 163/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 258 constraints, problems are : Problem set: 0 solved, 3 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 72/72 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 991ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 2548 steps, including 255 resets, run visited all 1 properties in 14 ms. (steps per millisecond=182 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 33 ms.
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p3) (OR p0 p4)))), (F (NOT (OR p0 (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p4) (NOT p1) p2))), (F (NOT (OR p4 (NOT p1)))), (F p1), (F (NOT p4)), (F (NOT (OR p0 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p4))), (F p2), (F (NOT (OR (NOT p4) (NOT p1)))), (F (NOT p3)), (F (NOT (AND (OR (NOT p0) p4 (NOT p1)) (OR (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p3) (NOT p4) (NOT p1)))))]
Knowledge based reduction with 23 factoid took 883 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 303 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 304 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Product exploration explored 100000 steps with 1 reset in 192 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Built C files in :
/tmp/ltsmin8492648221631122120
[2024-06-02 19:06:18] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-06-02 19:06:18] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:06:18] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-06-02 19:06:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:06:18] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-06-02 19:06:18] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:06:18] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8492648221631122120
Running compilation step : cd /tmp/ltsmin8492648221631122120;'/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 1054 ms.
Running link step : cd /tmp/ltsmin8492648221631122120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8492648221631122120;'/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/stateBased13889565794670952458.hoa' '--buchi-type=spotba'
LTSmin run took 651 ms.
FORMULA MedleyA-PT-05-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-05-LTLFireability-13 finished in 73307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 3 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 19:06:20] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 19:06:20] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:06:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 19:06:20] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:06:20] [INFO ] Invariant cache hit.
[2024-06-02 19:06:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:06:20] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 19:06:20] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 19:06:20] [INFO ] Invariant cache hit.
[2024-06-02 19:06:20] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 19:06:22] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9090 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14271 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 23474ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 23477ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23772 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-15 finished in 24014 ms.
All properties solved by simple procedures.
Total runtime 448075 ms.

BK_STOP 1717355204439

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="MedleyA-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 MedleyA-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 r576-smll-171734919900036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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