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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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 28K 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-04-LTLFireability-00
FORMULA_NAME MedleyA-PT-04-LTLFireability-01
FORMULA_NAME MedleyA-PT-04-LTLFireability-02
FORMULA_NAME MedleyA-PT-04-LTLFireability-03
FORMULA_NAME MedleyA-PT-04-LTLFireability-04
FORMULA_NAME MedleyA-PT-04-LTLFireability-05
FORMULA_NAME MedleyA-PT-04-LTLFireability-06
FORMULA_NAME MedleyA-PT-04-LTLFireability-07
FORMULA_NAME MedleyA-PT-04-LTLFireability-08
FORMULA_NAME MedleyA-PT-04-LTLFireability-09
FORMULA_NAME MedleyA-PT-04-LTLFireability-10
FORMULA_NAME MedleyA-PT-04-LTLFireability-11
FORMULA_NAME MedleyA-PT-04-LTLFireability-12
FORMULA_NAME MedleyA-PT-04-LTLFireability-13
FORMULA_NAME MedleyA-PT-04-LTLFireability-14
FORMULA_NAME MedleyA-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717352865804

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:27:48] [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:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:27:48] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-06-02 18:27:48] [INFO ] Transformed 115 places.
[2024-06-02 18:27:48] [INFO ] Transformed 107 transitions.
[2024-06-02 18:27:48] [INFO ] Found NUPN structural information;
[2024-06-02 18:27:48] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 107 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 107 transition count 100
Applied a total of 15 rules in 69 ms. Remains 107 /115 variables (removed 8) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 107 cols
[2024-06-02 18:27:49] [INFO ] Computed 8 invariants in 30 ms
[2024-06-02 18:27:49] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-02 18:27:49] [INFO ] Invariant cache hit.
[2024-06-02 18:27:49] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-06-02 18:27:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:27:51] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 23 ms to minimize.
[2024-06-02 18:27:51] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 3 ms to minimize.
[2024-06-02 18:27:51] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 3 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:27:52] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:27:53] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:27:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:27:53] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:27:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:27:54] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:27:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/207 variables, 107/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 5 ms to minimize.
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 139 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8118 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/207 variables, 107/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:28:00] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:28:00] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:28:01] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:28:02] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:28:02] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 243 constraints, problems are : Problem set: 0 solved, 99 unsolved in 10461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 29/29 constraints]
After SMT, in 18754ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 18792ms
Starting structural reductions in LTL mode, iteration 1 : 107/115 places, 100/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19754 ms. Remains : 107/115 places, 100/107 transitions.
Support contains 35 out of 107 places after structural reductions.
[2024-06-02 18:28:09] [INFO ] Flatten gal took : 58 ms
[2024-06-02 18:28:09] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:28:09] [INFO ] Input system was already deterministic with 100 transitions.
RANDOM walk for 40000 steps (1112 resets) in 3274 ms. (12 steps per ms) remains 10/32 properties
BEST_FIRST walk for 40003 steps (336 resets) in 358 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (336 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (291 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (294 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (335 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (339 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (296 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (346 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (303 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (300 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
[2024-06-02 18:28:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 59/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/86 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 100/186 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 21/207 variables, 21/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 118 constraints, problems are : Problem set: 0 solved, 10 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/74 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 12/86 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 100/186 variables, 86/100 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 3/103 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 2/105 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 21/207 variables, 21/127 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 6/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 9/9 constraints]
After SMT, in 1907ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 4930 ms.
Support contains 14 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 100/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 107 transition count 88
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 95 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 94 transition count 87
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 26 place count 94 transition count 77
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 84 transition count 77
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 80 transition count 73
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 80 transition count 73
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 84 place count 65 transition count 58
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 65 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 63 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 61 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 60 transition count 54
Applied a total of 93 rules in 55 ms. Remains 60 /107 variables (removed 47) and now considering 54/100 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 60/107 places, 54/100 transitions.
RANDOM walk for 40000 steps (3012 resets) in 416 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1424 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1375 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1313 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1333 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1368 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1382 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1324 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1223 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1361 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 169146 steps, run visited all 9 properties in 836 ms. (steps per millisecond=202 )
Probabilistic random walk after 169146 steps, saw 48804 distinct states, run finished after 845 ms. (steps per millisecond=200 ) properties seen :9
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 107 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 107 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 19 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:28:19] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:28:19] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 18:28:19] [INFO ] Invariant cache hit.
[2024-06-02 18:28:20] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:28:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:20] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 3 ms to minimize.
[2024-06-02 18:28:21] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:28:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:28:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:28:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:28:21] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:21] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:22] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:28:22] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:28:22] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:28:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:28:22] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:28:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6054 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:27] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:30] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 12399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 18503ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 18505ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18843 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 2818 reset in 298 ms.
Product exploration explored 100000 steps with 2814 reset in 235 ms.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 18:28:40] [INFO ] Invariant cache hit.
[2024-06-02 18:28:40] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:28:40] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-02 18:28:40] [INFO ] Computed and/alt/rep : 88/142/88 causal constraints (skipped 2 transitions) in 11 ms.
[2024-06-02 18:28:40] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-02 18:28:40] [INFO ] Invariant cache hit.
[2024-06-02 18:28:40] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 18:28:40] [INFO ] Invariant cache hit.
[2024-06-02 18:28:40] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:41] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:28:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:28:42] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 14 ms to minimize.
[2024-06-02 18:28:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:28:42] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:28:42] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:42] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:43] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:28:43] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:28:44] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:28:44] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:28:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:28:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:45] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6772 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:28:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11966 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 18782ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 18785ms
Finished structural reductions in LTL mode , in 1 iterations and 19097 ms. Remains : 98/98 places, 91/91 transitions.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 18:29:00] [INFO ] Invariant cache hit.
[2024-06-02 18:29:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:29:00] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 18:29:00] [INFO ] Computed and/alt/rep : 88/142/88 causal constraints (skipped 2 transitions) in 9 ms.
[2024-06-02 18:29:00] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2816 reset in 97 ms.
Product exploration explored 100000 steps with 2808 reset in 122 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 98 transition count 91
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 9 place count 98 transition count 98
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 21 place count 98 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 97 transition count 96
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 97 transition count 96
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 97 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 94 transition count 93
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 94 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 94 transition count 117
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 51 rules in 36 ms. Remains 94 /98 variables (removed 4) and now considering 117/91 (removed -26) transitions.
[2024-06-02 18:29:01] [INFO ] Redundant transitions in 5 ms returned []
Running 116 sub problems to find dead transitions.
// Phase 1: matrix 117 rows 94 cols
[2024-06-02 18:29:01] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 18:29:01] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:29:03] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-02 18:29:03] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:29:03] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:29:03] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
[2024-06-02 18:29:03] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 117/211 variables, 94/115 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 3/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 118 constraints, problems are : Problem set: 69 solved, 47 unsolved in 3288 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 69 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 40/94 variables, 8/8 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 117/211 variables, 94/115 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 3/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 47/165 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/165 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/165 constraints. Problems are: Problem set: 69 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 165 constraints, problems are : Problem set: 69 solved, 47 unsolved in 3326 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/116 constraints, Known Traps: 13/13 constraints]
After SMT, in 6700ms problems are : Problem set: 69 solved, 47 unsolved
Search for dead transitions found 69 dead transitions in 6703ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 94/98 places, 48/91 transitions.
Graph (complete) has 152 edges and 94 vertex of which 55 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 55 /94 variables (removed 39) and now considering 48/48 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/98 places, 48/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6764 ms. Remains : 55/98 places, 48/91 transitions.
Built C files in :
/tmp/ltsmin16766059929149646939
[2024-06-02 18:29:08] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16766059929149646939
Running compilation step : cd /tmp/ltsmin16766059929149646939;'/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 639 ms.
Running link step : cd /tmp/ltsmin16766059929149646939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16766059929149646939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17562030978289458868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:29:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:29:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:29:23] [INFO ] Invariant cache hit.
[2024-06-02 18:29:23] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:29:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:29:24] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:29:24] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:29:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:29:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:29:24] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:29:24] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:29:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:29:26] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:29:26] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:29:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:29:26] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:29:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:29:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:29:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6106 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:29:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:29:33] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 12681 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 18821ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 18824ms
Finished structural reductions in LTL mode , in 1 iterations and 19061 ms. Remains : 98/98 places, 91/91 transitions.
Built C files in :
/tmp/ltsmin8642086405296558105
[2024-06-02 18:29:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8642086405296558105
Running compilation step : cd /tmp/ltsmin8642086405296558105;'/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 314 ms.
Running link step : cd /tmp/ltsmin8642086405296558105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8642086405296558105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12217032343113784828.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 18:29:57] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:29:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:29:57] [INFO ] Time to serialize gal into /tmp/LTL2662284136691284649.gal : 6 ms
[2024-06-02 18:29:57] [INFO ] Time to serialize properties into /tmp/LTL783859954929837059.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2662284136691284649.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13072344578397544844.hoa' '-atoms' '/tmp/LTL783859954929837059.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL783859954929837059.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13072344578397544844.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t15, t20, t22, t28, t31, t36, t39, t44, t46, t53, t58, t85, t94, Intersecti...242
Computing Next relation with stutter on 8407 deadlock states
1000 unique states visited
0 strongly connected components in search stack
1000 transitions explored
1000 items max in DFS search stack
912 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.1615,237176,1,0,4976,1.11711e+06,205,5934,2867,1.86624e+06,12978
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-04-LTLFireability-00 finished in 108956 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(X(X(F(p1))))&&p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 6 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
[2024-06-02 18:30:08] [INFO ] Invariant cache hit.
[2024-06-02 18:30:08] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:30:08] [INFO ] Invariant cache hit.
[2024-06-02 18:30:08] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:30:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:30:09] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:30:09] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:30:10] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:30:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:30:10] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:30:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:30:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:30:11] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:30:11] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:30:11] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:30:11] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:30:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:30:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:30:13] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6507 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:30:17] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:30:19] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 13218 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 19763ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 19766ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20006 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-01
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-01 finished in 20249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p2)&&p1)))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 94 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 58 transition count 51
Reduce places removed 1 places and 0 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 3 with 2 rules applied. Total rules applied 97 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 56 transition count 50
Applied a total of 98 rules in 23 ms. Remains 56 /107 variables (removed 51) and now considering 50/100 (removed 50) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:30:28] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:30:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 18:30:29] [INFO ] Invariant cache hit.
[2024-06-02 18:30:29] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-02 18:30:29] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:30:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:30:29] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:30:29] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:30:29] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
[2024-06-02 18:30:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:30:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 68 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 49/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 117 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 3962ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3963ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/107 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4227 ms. Remains : 56/107 places, 50/100 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-03 finished in 4392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||(X(F(p2))&&G(p3))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 77 transition count 70
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 90 place count 61 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 60 transition count 53
Reduce places removed 1 places and 0 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 3 with 2 rules applied. Total rules applied 93 place count 59 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 58 transition count 52
Applied a total of 94 rules in 28 ms. Remains 58 /107 variables (removed 49) and now considering 52/100 (removed 48) transitions.
// Phase 1: matrix 52 rows 58 cols
[2024-06-02 18:30:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:30:33] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 18:30:33] [INFO ] Invariant cache hit.
[2024-06-02 18:30:33] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-02 18:30:33] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 18:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:30:34] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:30:34] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:30:34] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:30:34] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:30:34] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 52/110 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:30:35] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 71 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2077 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 51/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 122 constraints, problems are : Problem set: 0 solved, 51 unsolved in 3133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
After SMT, in 5242ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 5244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/107 places, 52/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5577 ms. Remains : 58/107 places, 52/100 transitions.
Stuttering acceptance computed with spot in 412 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-04
Product exploration explored 100000 steps with 12758 reset in 365 ms.
Product exploration explored 100000 steps with 12771 reset in 404 ms.
Computed a total of 58 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND p1 (NOT p3) (NOT p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0) (AND p3 p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND p3 p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0))), (F (G p3)), (F (G p2))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0)))))]
Knowledge based reduction with 46 factoid took 597 ms. Reduced automaton from 9 states, 34 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (5118 resets) in 433 ms. (92 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (2265 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
[2024-06-02 18:30:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 28/110 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND p1 (NOT p3) (NOT p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0) (AND p3 p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND p3 p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0))), (F (G p3)), (F (G p2)), (G (OR p1 p3))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (F (NOT p1)), (F (NOT (OR p1 (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 47 factoid took 712 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Support contains 2 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-06-02 18:30:42] [INFO ] Invariant cache hit.
[2024-06-02 18:30:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 18:30:42] [INFO ] Invariant cache hit.
[2024-06-02 18:30:42] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 18:30:42] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 18:30:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
[2024-06-02 18:30:43] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 52/110 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:30:43] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 71 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 51/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 122 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2387 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
After SMT, in 4394ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 4395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4646 ms. Remains : 58/58 places, 52/52 transitions.
Computed a total of 58 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p1), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X p1), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (F (G p3)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 10 factoid took 328 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (5080 resets) in 91 ms. (434 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (2258 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-06-02 18:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 28/110 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p1), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X p1), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (F (G p3)), (F (G p1)), (G (OR p3 p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p1)), (F (NOT (OR (NOT p3) p1))), (F (NOT p3))]
Knowledge based reduction with 11 factoid took 628 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Product exploration explored 100000 steps with 12830 reset in 117 ms.
Product exploration explored 100000 steps with 12808 reset in 135 ms.
Built C files in :
/tmp/ltsmin10652539627341175198
[2024-06-02 18:30:48] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-06-02 18:30:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:30:48] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-06-02 18:30:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:30:48] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-06-02 18:30:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:30:48] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10652539627341175198
Running compilation step : cd /tmp/ltsmin10652539627341175198;'/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 233 ms.
Running link step : cd /tmp/ltsmin10652539627341175198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10652539627341175198;'/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/stateBased11029910631362623092.hoa' '--buchi-type=spotba'
LTSmin run took 1055 ms.
FORMULA MedleyA-PT-04-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-04 finished in 16580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||F(p2))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 3 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:30:49] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:30:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:30:49] [INFO ] Invariant cache hit.
[2024-06-02 18:30:50] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:30:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:30:50] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:30:50] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:30:50] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:30:50] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:30:52] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 3 ms to minimize.
[2024-06-02 18:30:52] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:30:53] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 120 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:30:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:30:55] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:30:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:30:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 91/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:30:56] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:30:57] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:30:58] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:31:04] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:31:04] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:31:04] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 221 constraints, problems are : Problem set: 0 solved, 91 unsolved in 21359 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 23/23 constraints]
After SMT, in 26075ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 26076ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26268 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-05 finished in 26517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 100 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 100 transition count 93
Applied a total of 14 rules in 4 ms. Remains 100 /107 variables (removed 7) and now considering 93/100 (removed 7) transitions.
// Phase 1: matrix 93 rows 100 cols
[2024-06-02 18:31:16] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 18:31:16] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 18:31:16] [INFO ] Invariant cache hit.
[2024-06-02 18:31:16] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-02 18:31:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:17] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:31:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 93/193 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:19] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:31:19] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:31:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 120 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:23] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:31:26] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/193 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:31:36] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:31:36] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/193 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:39] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:31:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:31:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/193 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 222 constraints, problems are : Problem set: 0 solved, 92 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 22/22 constraints]
After SMT, in 35304ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 35306ms
Starting structural reductions in LTL mode, iteration 1 : 100/107 places, 93/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35613 ms. Remains : 100/107 places, 93/100 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-06 finished in 35740 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&&G(!p2))) U p3)))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 3 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:31:52] [INFO ] Computed 8 invariants in 13 ms
[2024-06-02 18:31:52] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:31:52] [INFO ] Invariant cache hit.
[2024-06-02 18:31:52] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:31:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:31:53] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-06-02 18:31:53] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-06-02 18:31:53] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2024-06-02 18:31:53] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:31:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:31:53] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:31:54] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:31:55] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:31:55] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:31:55] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:31:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:31:55] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:31:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:31:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6253 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:02] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11432 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 17731ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17733ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17995 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p1) p2), p2]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-07
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-07 finished in 18320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 3 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
[2024-06-02 18:32:10] [INFO ] Invariant cache hit.
[2024-06-02 18:32:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:32:10] [INFO ] Invariant cache hit.
[2024-06-02 18:32:10] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:32:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:11] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:32:11] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:32:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:32:11] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:32:11] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:32:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:12] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:13] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 3 ms to minimize.
[2024-06-02 18:32:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:32:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:32:13] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:32:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:32:13] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5807 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:32:19] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11685 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 17515ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17517ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17714 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-08
Product exploration explored 100000 steps with 2802 reset in 174 ms.
Product exploration explored 100000 steps with 2791 reset in 201 ms.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (1121 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (339 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2857428 steps, run timeout after 3001 ms. (steps per millisecond=952 ) properties seen :0 out of 1
Probabilistic random walk after 2857428 steps, saw 481882 distinct states, run finished after 3012 ms. (steps per millisecond=948 ) properties seen :0
[2024-06-02 18:32:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/164 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:32:32] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/189 variables, 25/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/164 variables, 73/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/189 variables, 25/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 232 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=232 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-08 finished in 22119 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 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 91 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 89 transition count 82
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 34 place count 89 transition count 71
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 56 place count 78 transition count 71
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 60 place count 74 transition count 67
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 74 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 53 transition count 47
Applied a total of 104 rules in 23 ms. Remains 53 /107 variables (removed 54) and now considering 47/100 (removed 53) transitions.
// Phase 1: matrix 47 rows 53 cols
[2024-06-02 18:32:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:32:32] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 18:32:32] [INFO ] Invariant cache hit.
[2024-06-02 18:32:32] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-06-02 18:32:32] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:32:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:32:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:32:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:32:33] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:32:33] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:32:33] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 65 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/100 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 111 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
After SMT, in 3434ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3436ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/107 places, 47/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3750 ms. Remains : 53/107 places, 47/100 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 16873 reset in 97 ms.
Product exploration explored 100000 steps with 16770 reset in 195 ms.
Computed a total of 53 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-09 finished in 4223 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 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 5 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:32:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:32:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 18:32:36] [INFO ] Invariant cache hit.
[2024-06-02 18:32:37] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:32:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:37] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 3 ms to minimize.
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:32:40] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:32:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:32:40] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5669 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:45] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:32:45] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:47] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:32:53] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 19348 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 25052ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 25055ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25404 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 4813 reset in 153 ms.
Product exploration explored 100000 steps with 4794 reset in 185 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 372 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 88 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 286 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-02 18:33:03] [INFO ] Invariant cache hit.
[2024-06-02 18:33:03] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 18:33:04] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-02 18:33:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:33:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:33:04] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-06-02 18:33:04] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 18:33:04] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 2 transitions) in 12 ms.
[2024-06-02 18:33:04] [INFO ] Added : 76 causal constraints over 16 iterations in 295 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-02 18:33:04] [INFO ] Invariant cache hit.
[2024-06-02 18:33:04] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 18:33:04] [INFO ] Invariant cache hit.
[2024-06-02 18:33:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:33:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:05] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
[2024-06-02 18:33:06] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:07] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:33:07] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:33:07] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:33:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:33:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:33:08] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:33:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:33:08] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:33:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:11] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:12] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:33:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:14] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:19] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 16902 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 22093ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 22096ms
Finished structural reductions in LTL mode , in 1 iterations and 22464 ms. Remains : 99/99 places, 92/92 transitions.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 62 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-02 18:33:27] [INFO ] Invariant cache hit.
[2024-06-02 18:33:27] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:33:28] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-06-02 18:33:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:33:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:33:28] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-02 18:33:28] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-06-02 18:33:28] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 2 transitions) in 10 ms.
[2024-06-02 18:33:28] [INFO ] Added : 76 causal constraints over 16 iterations in 249 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4819 reset in 151 ms.
Product exploration explored 100000 steps with 4812 reset in 158 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 99 transition count 92
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 9 place count 99 transition count 98
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 20 place count 99 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 98 transition count 96
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 98 transition count 96
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 38 place count 98 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 95 transition count 93
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 95 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 95 transition count 115
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 50 rules in 26 ms. Remains 95 /99 variables (removed 4) and now considering 115/92 (removed -23) transitions.
[2024-06-02 18:33:29] [INFO ] Redundant transitions in 5 ms returned []
Running 114 sub problems to find dead transitions.
// Phase 1: matrix 115 rows 95 cols
[2024-06-02 18:33:29] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:33:29] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:33:30] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 18:33:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:33:30] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
[2024-06-02 18:33:31] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/21 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 115/210 variables, 95/116 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 3/119 constraints. Problems are: Problem set: 65 solved, 49 unsolved
[2024-06-02 18:33:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 120 constraints, problems are : Problem set: 65 solved, 49 unsolved in 4137 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 65 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 39/95 variables, 8/8 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 14/22 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 115/210 variables, 95/117 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 3/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 49/169 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/169 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/169 constraints. Problems are: Problem set: 65 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 169 constraints, problems are : Problem set: 65 solved, 49 unsolved in 3779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 49/114 constraints, Known Traps: 14/14 constraints]
After SMT, in 7986ms problems are : Problem set: 65 solved, 49 unsolved
Search for dead transitions found 65 dead transitions in 7996ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 95/99 places, 50/92 transitions.
Graph (complete) has 154 edges and 95 vertex of which 57 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 57 /95 variables (removed 38) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/99 places, 50/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8041 ms. Remains : 57/99 places, 50/92 transitions.
Built C files in :
/tmp/ltsmin4698831130035726251
[2024-06-02 18:33:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4698831130035726251
Running compilation step : cd /tmp/ltsmin4698831130035726251;'/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 369 ms.
Running link step : cd /tmp/ltsmin4698831130035726251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4698831130035726251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18274191641565652399.hoa' '--buchi-type=spotba'
LTSmin run took 10750 ms.
FORMULA MedleyA-PT-04-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-10 finished in 72073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0) U p1)&&p2) U !F((X(p1)||p1))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 3 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:33:48] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:33:48] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:33:48] [INFO ] Invariant cache hit.
[2024-06-02 18:33:49] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:33:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:49] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:51] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:33:51] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:33:51] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:53] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 120 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:33:56] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:33:58] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:00] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:34:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:06] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 22195 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 28588ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 28589ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28813 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 203 ms :[p1, true, p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-12 finished in 29052 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)&&X(p1)) U p1))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 2 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:34:17] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:34:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:34:17] [INFO ] Invariant cache hit.
[2024-06-02 18:34:18] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:34:18] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:34:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:34:19] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:34:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:34:19] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:34:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:34:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:34:20] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:34:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:34:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:34:20] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:34:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:34:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:34:22] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5590 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:34:25] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:34:27] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 10882 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 16511ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 16514ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16707 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-13 finished in 16929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 107 transition count 85
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 92 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 34 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 54 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 77 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 98 place count 58 transition count 51
Applied a total of 98 rules in 13 ms. Remains 58 /107 variables (removed 49) and now considering 51/100 (removed 49) transitions.
// Phase 1: matrix 51 rows 58 cols
[2024-06-02 18:34:34] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:34:34] [INFO ] Implicit Places using invariants in 85 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/107 places, 51/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 50
Applied a total of 2 rules in 4 ms. Remains 56 /57 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:34:34] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:34:35] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:34:35] [INFO ] Invariant cache hit.
[2024-06-02 18:34:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:34:35] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/107 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 56/107 places, 50/100 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-14
Product exploration explored 100000 steps with 13546 reset in 100 ms.
Product exploration explored 100000 steps with 13666 reset in 109 ms.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-14 finished in 667 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))||G((F(p2)&&p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 2 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:34:35] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:34:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:34:35] [INFO ] Invariant cache hit.
[2024-06-02 18:34:35] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:34:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:38] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:34:38] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:34:38] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:40] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 120 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6855 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:45] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:47] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:34:48] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:34:52] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 20944 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 27830ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 27831ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28063 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 7100 reset in 102 ms.
Product exploration explored 100000 steps with 7103 reset in 187 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 193 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 364 steps (9 resets) in 7 ms. (45 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 18 factoid took 447 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 83
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 89 transition count 82
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 89 transition count 70
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 78 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 56 transition count 50
Applied a total of 83 rules in 13 ms. Remains 56 /99 variables (removed 43) and now considering 50/92 (removed 42) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:35:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:35:05] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:35:05] [INFO ] Invariant cache hit.
[2024-06-02 18:35:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:35:05] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 18:35:05] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 18:35:05] [INFO ] Invariant cache hit.
[2024-06-02 18:35:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:35:05] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:35:05] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:35:05] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:35:05] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:35:06] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 48/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:35:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 118 constraints, problems are : Problem set: 0 solved, 48 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
After SMT, in 5825ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 5826ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/99 places, 50/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6015 ms. Remains : 56/99 places, 50/92 transitions.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1024 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 1034 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2024-06-02 18:35:13] [INFO ] Invariant cache hit.
[2024-06-02 18:35:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 18:35:13] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 18:35:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:35:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 18:35:14] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 18:35:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:35:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-02 18:35:14] [INFO ] Computed and/alt/rep : 46/98/46 causal constraints (skipped 2 transitions) in 9 ms.
[2024-06-02 18:35:14] [INFO ] Added : 29 causal constraints over 6 iterations in 89 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34743 reset in 128 ms.
Product exploration explored 100000 steps with 34836 reset in 141 ms.
Built C files in :
/tmp/ltsmin8794854653086680478
[2024-06-02 18:35:14] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-06-02 18:35:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:35:14] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-06-02 18:35:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:35:14] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-06-02 18:35:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:35:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8794854653086680478
Running compilation step : cd /tmp/ltsmin8794854653086680478;'/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 386 ms.
Running link step : cd /tmp/ltsmin8794854653086680478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8794854653086680478;'/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/stateBased13258954485849037248.hoa' '--buchi-type=spotba'
LTSmin run took 310 ms.
FORMULA MedleyA-PT-04-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-15 finished in 39911 ms.
All properties solved by simple procedures.
Total runtime 447128 ms.

BK_STOP 1717353315814

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

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