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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K 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 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K 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-15-LTLFireability-00
FORMULA_NAME MedleyA-PT-15-LTLFireability-01
FORMULA_NAME MedleyA-PT-15-LTLFireability-02
FORMULA_NAME MedleyA-PT-15-LTLFireability-03
FORMULA_NAME MedleyA-PT-15-LTLFireability-04
FORMULA_NAME MedleyA-PT-15-LTLFireability-05
FORMULA_NAME MedleyA-PT-15-LTLFireability-06
FORMULA_NAME MedleyA-PT-15-LTLFireability-07
FORMULA_NAME MedleyA-PT-15-LTLFireability-08
FORMULA_NAME MedleyA-PT-15-LTLFireability-09
FORMULA_NAME MedleyA-PT-15-LTLFireability-10
FORMULA_NAME MedleyA-PT-15-LTLFireability-11
FORMULA_NAME MedleyA-PT-15-LTLFireability-12
FORMULA_NAME MedleyA-PT-15-LTLFireability-13
FORMULA_NAME MedleyA-PT-15-LTLFireability-14
FORMULA_NAME MedleyA-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717370076041

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 23:14:38] [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 23:14:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:14:39] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-06-02 23:14:39] [INFO ] Transformed 192 places.
[2024-06-02 23:14:39] [INFO ] Transformed 475 transitions.
[2024-06-02 23:14:39] [INFO ] Found NUPN structural information;
[2024-06-02 23:14:39] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 151 transition count 406
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 151 transition count 406
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 105 place count 151 transition count 383
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 149 transition count 379
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 149 transition count 379
Applied a total of 109 rules in 77 ms. Remains 149 /192 variables (removed 43) and now considering 379/473 (removed 94) transitions.
// Phase 1: matrix 379 rows 149 cols
[2024-06-02 23:14:39] [INFO ] Computed 7 invariants in 26 ms
[2024-06-02 23:14:39] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-06-02 23:14:39] [INFO ] Invariant cache hit.
[2024-06-02 23:14:40] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-06-02 23:14:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:45] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 25 ms to minimize.
[2024-06-02 23:14:45] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-06-02 23:14:45] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:14:46] [INFO ] Deduced a trap composed of 83 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:14:46] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 4 ms to minimize.
[2024-06-02 23:14:46] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:14:46] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:14:46] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-06-02 23:14:47] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:14:47] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:14:47] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2024-06-02 23:14:47] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:14:48] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:14:48] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:14:48] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:14:49] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:50] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:55] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:14:55] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:58] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:14:59] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:15:02] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (OVERLAPS) 379/528 variables, 149/178 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 178 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:15:13] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 379/528 variables, 149/179 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 378/557 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:15:23] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:15:25] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 559 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 25/25 constraints]
After SMT, in 60565ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60614ms
Starting structural reductions in LTL mode, iteration 1 : 149/192 places, 379/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61517 ms. Remains : 149/192 places, 379/473 transitions.
Support contains 38 out of 149 places after structural reductions.
[2024-06-02 23:15:41] [INFO ] Flatten gal took : 166 ms
[2024-06-02 23:15:41] [INFO ] Flatten gal took : 56 ms
[2024-06-02 23:15:41] [INFO ] Input system was already deterministic with 379 transitions.
Support contains 37 out of 149 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2708 ms. (14 steps per ms) remains 23/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 122 ms. (32 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 98 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
[2024-06-02 23:15:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 119/149 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-02 23:15:43] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:15:43] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:15:43] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 379/528 variables, 149/159 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-02 23:15:43] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 1/160 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 160 constraints, problems are : Problem set: 3 solved, 20 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 121/149 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 4/11 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-02 23:15:44] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 3 ms to minimize.
[2024-06-02 23:15:44] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:15:45] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:15:45] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 4/15 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 379/528 variables, 149/164 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/184 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 184 constraints, problems are : Problem set: 3 solved, 20 unsolved in 2496 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 20/23 constraints, Known Traps: 8/8 constraints]
After SMT, in 4137ms problems are : Problem set: 3 solved, 20 unsolved
Parikh walk visited 0 properties in 3603 ms.
Support contains 28 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 101 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 143 transition count 354
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 127 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 126 transition count 353
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 35 place count 126 transition count 346
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 49 place count 119 transition count 346
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 114 transition count 338
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 114 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 114 transition count 335
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 114 transition count 334
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 113 transition count 334
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 90 place count 100 transition count 321
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 99 transition count 317
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 99 transition count 317
Performed 12 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 116 place count 87 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 147 place count 87 transition count 367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 151 place count 85 transition count 380
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 164 place count 85 transition count 367
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 179 place count 72 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 182 place count 72 transition count 362
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 72 transition count 374
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 185 place count 71 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 71 transition count 372
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 70 transition count 371
Applied a total of 187 rules in 173 ms. Remains 70 /149 variables (removed 79) and now considering 371/379 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 70/149 places, 371/379 transitions.
RANDOM walk for 40000 steps (8 resets) in 707 ms. (56 steps per ms) remains 13/20 properties
BEST_FIRST walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 341 ms. (116 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
[2024-06-02 23:15:51] [INFO ] Flow matrix only has 352 transitions (discarded 19 similar events)
// Phase 1: matrix 352 rows 70 cols
[2024-06-02 23:15:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:15:51] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 48/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 347/413 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 56/130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 9/422 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/422 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 138 constraints, problems are : Problem set: 0 solved, 10 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 58/58 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 48/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 347/413 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 56/131 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 9/422 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/422 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 149 constraints, problems are : Problem set: 0 solved, 10 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 1494ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 9 properties in 891 ms.
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 371/371 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 70 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 69 transition count 370
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 69 transition count 368
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 65 transition count 368
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 75 edges and 65 vertex of which 24 / 65 are part of one of the 10 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 14 place count 51 transition count 363
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 3 with 95 rules applied. Total rules applied 109 place count 51 transition count 268
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 114 place count 46 transition count 230
Iterating global reduction 4 with 5 rules applied. Total rules applied 119 place count 46 transition count 230
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 44 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 132 place count 44 transition count 219
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 142 place count 39 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 39 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 6 with 69 rules applied. Total rules applied 212 place count 39 transition count 168
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 212 place count 39 transition count 166
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 37 transition count 166
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 36 transition count 161
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 36 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 34 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 33 transition count 162
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 227 place count 33 transition count 159
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 230 place count 30 transition count 159
Applied a total of 230 rules in 38 ms. Remains 30 /70 variables (removed 40) and now considering 159/371 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 30/70 places, 159/371 transitions.
RANDOM walk for 17052 steps (1950 resets) in 372 ms. (45 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 15 stable transitions
FORMULA MedleyA-PT-15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&(G(p0)||X(X(F(p1)))))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 10 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 23:15:54] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:15:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:15:54] [INFO ] Invariant cache hit.
[2024-06-02 23:15:55] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:15:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 3 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:16:02] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:16:02] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2024-06-02 23:16:03] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:16:17] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:16:22] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60650 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 557 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 561 ms.
Product exploration explored 100000 steps with 0 reset in 365 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 453 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 500 ms. (79 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 30684 steps, run visited all 4 properties in 236 ms. (steps per millisecond=130 )
Probabilistic random walk after 30684 steps, saw 6862 distinct states, run finished after 242 ms. (steps per millisecond=126 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 367 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 364/364 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2024-06-02 23:16:59] [INFO ] Invariant cache hit.
[2024-06-02 23:16:59] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-02 23:16:59] [INFO ] Invariant cache hit.
[2024-06-02 23:16:59] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:16:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 2 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 2 ms to minimize.
[2024-06-02 23:17:06] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 3 ms to minimize.
[2024-06-02 23:17:06] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:17:06] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:17:06] [INFO ] Deduced a trap composed of 94 places in 184 ms of which 2 ms to minimize.
[2024-06-02 23:17:07] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:17:07] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:17:07] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:17:08] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:17:08] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:17:08] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:17:09] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-06-02 23:17:09] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:17:14] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:17:17] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:17:25] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:17:29] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in LTL mode , in 1 iterations and 60880 ms. Remains : 141/141 places, 364/364 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 30684 steps, run visited all 4 properties in 202 ms. (steps per millisecond=151 )
Probabilistic random walk after 30684 steps, saw 6862 distinct states, run finished after 202 ms. (steps per millisecond=151 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 216 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 220 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 364/364 transitions.
Graph (trivial) has 135 edges and 141 vertex of which 9 / 141 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 135 transition count 358
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 20 place count 135 transition count 360
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 135 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 133 transition count 356
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 133 transition count 356
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 47 place count 133 transition count 358
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 123 transition count 343
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 123 transition count 343
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -155
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 123 transition count 498
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 117 transition count 486
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 117 transition count 486
Deduced a syphon composed of 45 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 134 place count 117 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 115 transition count 446
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 115 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 142 place count 115 transition count 504
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 142 rules in 70 ms. Remains 115 /141 variables (removed 26) and now considering 504/364 (removed -140) transitions.
[2024-06-02 23:18:03] [INFO ] Redundant transitions in 34 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-02 23:18:03] [INFO ] Flow matrix only has 459 transitions (discarded 45 similar events)
// Phase 1: matrix 459 rows 115 cols
[2024-06-02 23:18:03] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:18:03] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:18:08] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 23:18:08] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:18:08] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:18:08] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-02 23:18:08] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-02 23:18:08] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-02 23:18:09] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 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
[2024-06-02 23:18:09] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:18:09] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 13/20 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 458/573 variables, 115/135 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 76/211 constraints. Problems are: Problem set: 70 solved, 433 unsolved
[2024-06-02 23:18:19] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 1/212 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/212 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/213 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/213 constraints. Problems are: Problem set: 70 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 213 constraints, problems are : Problem set: 70 solved, 433 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 70 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 48/115 variables, 7/7 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 14/21 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/21 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 458/573 variables, 115/136 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 76/212 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 433/645 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/645 constraints. Problems are: Problem set: 70 solved, 433 unsolved
SMT process timed out in 60536ms, After SMT, problems are : Problem set: 70 solved, 433 unsolved
Search for dead transitions found 70 dead transitions in 60541ms
Found 70 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 70 transitions
Dead transitions reduction (with SMT) removed 70 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/141 places, 434/364 transitions.
Graph (complete) has 590 edges and 115 vertex of which 68 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.4 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 68 /115 variables (removed 47) and now considering 434/434 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/141 places, 434/364 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60686 ms. Remains : 68/141 places, 434/364 transitions.
Built C files in :
/tmp/ltsmin16523590396653051781
[2024-06-02 23:19:03] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16523590396653051781
Running compilation step : cd /tmp/ltsmin16523590396653051781;'/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 1659 ms.
Running link step : cd /tmp/ltsmin16523590396653051781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16523590396653051781;'/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/stateBased1552777325617466228.hoa' '--buchi-type=spotba'
LTSmin run took 1972 ms.
FORMULA MedleyA-PT-15-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-00 finished in 192748 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 148 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 142 transition count 351
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 121 transition count 351
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 43 place count 121 transition count 343
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 59 place count 113 transition count 343
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 105 transition count 329
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 105 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 105 transition count 326
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 105 transition count 324
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 103 transition count 324
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 112 place count 88 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 86 transition count 302
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 86 transition count 302
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -122
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 150 place count 69 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 199 place count 69 transition count 375
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 66 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 65 transition count 409
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 70 edges and 63 vertex of which 27 / 63 are part of one of the 11 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 209 place count 47 transition count 409
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 279 place count 47 transition count 339
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 283 place count 43 transition count 278
Iterating global reduction 5 with 4 rules applied. Total rules applied 287 place count 43 transition count 278
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 299 place count 43 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 6 with 85 rules applied. Total rules applied 384 place count 43 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 384 place count 43 transition count 178
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 390 place count 40 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 394 place count 38 transition count 176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 37 transition count 172
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 37 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 400 place count 37 transition count 168
Applied a total of 400 rules in 70 ms. Remains 37 /149 variables (removed 112) and now considering 168/379 (removed 211) transitions.
[2024-06-02 23:19:07] [INFO ] Flow matrix only has 152 transitions (discarded 16 similar events)
// Phase 1: matrix 152 rows 37 cols
[2024-06-02 23:19:07] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:19:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 23:19:07] [INFO ] Flow matrix only has 152 transitions (discarded 16 similar events)
[2024-06-02 23:19:07] [INFO ] Invariant cache hit.
[2024-06-02 23:19:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:19:07] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 23:19:07] [INFO ] Redundant transitions in 46 ms returned [156, 159, 160, 163, 164, 165]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 156 sub problems to find dead transitions.
[2024-06-02 23:19:07] [INFO ] Flow matrix only has 146 transitions (discarded 16 similar events)
// Phase 1: matrix 146 rows 37 cols
[2024-06-02 23:19:07] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:19:07] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 23:19:08] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-02 23:19:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
[2024-06-02 23:19:08] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:19:08] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 145/182 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 23:19:10] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/183 variables, and 83 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6478 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 145/182 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 156/239 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/183 variables, and 239 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6618 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
After SMT, in 13217ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 13219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/149 places, 162/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 37 /37 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13508 ms. Remains : 37/149 places, 162/379 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-02 finished in 13614 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 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 369
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 142 transition count 366
Applied a total of 17 rules in 10 ms. Remains 142 /149 variables (removed 7) and now considering 366/379 (removed 13) transitions.
// Phase 1: matrix 366 rows 142 cols
[2024-06-02 23:19:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:19:21] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 23:19:21] [INFO ] Invariant cache hit.
[2024-06-02 23:19:21] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 23:19:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:19:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:19:25] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:19:26] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-02 23:19:26] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:19:26] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:19:26] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:19:26] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:19:27] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:19:27] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:19:27] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 2 ms to minimize.
[2024-06-02 23:19:27] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:19:28] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 3 ms to minimize.
[2024-06-02 23:19:28] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 2 ms to minimize.
[2024-06-02 23:19:28] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:19:30] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:19:30] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:19:30] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 6 ms to minimize.
[2024-06-02 23:19:31] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:19:31] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:19:31] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:19:36] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 170 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:19:54] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/508 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 365/536 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 536 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 22/22 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 366/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60723 ms. Remains : 142/149 places, 366/379 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-03 finished in 60874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1&&F(p2)))))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 9 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 23:20:22] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:20:22] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-02 23:20:22] [INFO ] Invariant cache hit.
[2024-06-02 23:20:22] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:20:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 1 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 1 ms to minimize.
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 3 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 94 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 1 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 3 ms to minimize.
[2024-06-02 23:20:30] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:20:30] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:20:30] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:20:31] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:20:31] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:20:35] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:20:38] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:20:45] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:20:49] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 261 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 2 ms.
FORMULA MedleyA-PT-15-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-05 finished in 61347 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 148 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 352
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 41 place count 122 transition count 344
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 114 transition count 344
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 106 transition count 330
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 106 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 106 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 106 transition count 325
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 104 transition count 325
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 110 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 87 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 303
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 148 place count 70 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 197 place count 70 transition count 377
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 67 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 66 transition count 411
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 70 edges and 64 vertex of which 28 / 64 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 207 place count 47 transition count 411
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 294 place count 47 transition count 324
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 298 place count 43 transition count 272
Iterating global reduction 5 with 4 rules applied. Total rules applied 302 place count 43 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 5 with 85 rules applied. Total rules applied 387 place count 43 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 387 place count 43 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 391 place count 41 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 395 place count 39 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 401 place count 39 transition count 177
Applied a total of 401 rules in 88 ms. Remains 39 /149 variables (removed 110) and now considering 177/379 (removed 202) transitions.
[2024-06-02 23:21:23] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
// Phase 1: matrix 161 rows 39 cols
[2024-06-02 23:21:23] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:21:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:21:23] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
[2024-06-02 23:21:23] [INFO ] Invariant cache hit.
[2024-06-02 23:21:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:21:23] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 23:21:24] [INFO ] Redundant transitions in 245 ms returned [91, 134, 135, 138, 139, 163, 165, 168, 169, 171, 172, 175, 176]
Found 13 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 13 transitions
Redundant transitions reduction (with SMT) removed 13 transitions.
Running 158 sub problems to find dead transitions.
[2024-06-02 23:21:24] [INFO ] Flow matrix only has 148 transitions (discarded 16 similar events)
// Phase 1: matrix 148 rows 39 cols
[2024-06-02 23:21:24] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:21:24] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-02 23:21:24] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:21:24] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:21:25] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:21:25] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 147/186 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-02 23:21:27] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/187 variables, and 85 constraints, problems are : Problem set: 0 solved, 158 unsolved in 6645 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 147/186 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 158/243 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/187 variables, and 243 constraints, problems are : Problem set: 0 solved, 158 unsolved in 5945 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 5/5 constraints]
After SMT, in 12780ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 12783ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/149 places, 164/379 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 37 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 37 transition count 161
Applied a total of 4 rules in 8 ms. Remains 37 /39 variables (removed 2) and now considering 161/164 (removed 3) transitions.
[2024-06-02 23:21:36] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
// Phase 1: matrix 145 rows 37 cols
[2024-06-02 23:21:36] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:21:36] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:21:36] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 23:21:36] [INFO ] Invariant cache hit.
[2024-06-02 23:21:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:21:37] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/149 places, 161/379 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13683 ms. Remains : 37/149 places, 161/379 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9988 resets) in 548 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32951 steps (779 resets) in 111 ms. (294 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 161/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-06-02 23:21:38] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 23:21:38] [INFO ] Invariant cache hit.
[2024-06-02 23:21:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:21:38] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 23:21:38] [INFO ] Invariant cache hit.
[2024-06-02 23:21:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:21:38] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-06-02 23:21:38] [INFO ] Redundant transitions in 25 ms returned []
Running 155 sub problems to find dead transitions.
[2024-06-02 23:21:38] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 23:21:38] [INFO ] Invariant cache hit.
[2024-06-02 23:21:38] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 23:21:39] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:21:39] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:21:39] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:21:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:21:39] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 23:21:41] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 84 constraints, problems are : Problem set: 0 solved, 155 unsolved in 6257 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 155/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 239 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5794 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
After SMT, in 12250ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 12253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12545 ms. Remains : 37/37 places, 161/161 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37130 steps (9305 resets) in 62 ms. (589 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Built C files in :
/tmp/ltsmin12416679892866173642
[2024-06-02 23:21:51] [INFO ] Computing symmetric may disable matrix : 161 transitions.
[2024-06-02 23:21:51] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:51] [INFO ] Computing symmetric may enable matrix : 161 transitions.
[2024-06-02 23:21:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:51] [INFO ] Computing Do-Not-Accords matrix : 161 transitions.
[2024-06-02 23:21:51] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:51] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12416679892866173642
Running compilation step : cd /tmp/ltsmin12416679892866173642;'/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 782 ms.
Running link step : cd /tmp/ltsmin12416679892866173642;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12416679892866173642;'/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/stateBased15834668199302353712.hoa' '--buchi-type=spotba'
LTSmin run took 428 ms.
FORMULA MedleyA-PT-15-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-06 finished in 29428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 5 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 23:21:52] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:21:53] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-02 23:21:53] [INFO ] Invariant cache hit.
[2024-06-02 23:21:53] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:21:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 3 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:22:00] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 1 ms to minimize.
[2024-06-02 23:22:00] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:22:00] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:22:00] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:22:01] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-06-02 23:22:01] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:22:04] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:22:07] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:22:20] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60848 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 202 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 217434 steps, run visited all 1 properties in 676 ms. (steps per millisecond=321 )
Probabilistic random walk after 217434 steps, saw 43918 distinct states, run finished after 677 ms. (steps per millisecond=321 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Support contains 2 out of 141 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 : 141/141 places, 364/364 transitions.
Graph (trivial) has 129 edges and 141 vertex of which 9 / 141 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 134 transition count 338
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 115 transition count 338
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 115 transition count 330
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 107 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 105 transition count 326
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 105 transition count 326
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 85 place count 92 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 90 transition count 306
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 90 transition count 306
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 119 place count 75 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 130 place count 75 transition count 394
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 71 transition count 442
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 70 transition count 441
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 69 edges and 68 vertex of which 25 / 68 are part of one of the 10 SCC in 1 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 53 transition count 441
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 212 place count 53 transition count 371
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 216 place count 49 transition count 313
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 49 transition count 313
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 230 place count 49 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 5 with 99 rules applied. Total rules applied 329 place count 49 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 329 place count 49 transition count 203
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 48 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 47 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 47 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 337 place count 45 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 341 place count 43 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 361 place count 43 transition count 190
Applied a total of 361 rules in 67 ms. Remains 43 /141 variables (removed 98) and now considering 190/364 (removed 174) transitions.
[2024-06-02 23:22:55] [INFO ] Flow matrix only has 171 transitions (discarded 19 similar events)
// Phase 1: matrix 171 rows 43 cols
[2024-06-02 23:22:55] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:22:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:22:55] [INFO ] Flow matrix only has 171 transitions (discarded 19 similar events)
[2024-06-02 23:22:55] [INFO ] Invariant cache hit.
[2024-06-02 23:22:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 23:22:55] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-02 23:22:55] [INFO ] Redundant transitions in 57 ms returned [97, 98, 100, 127, 128, 129, 159, 163, 164, 165, 166, 167, 172, 173]
Found 14 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
Running 172 sub problems to find dead transitions.
[2024-06-02 23:22:55] [INFO ] Flow matrix only has 157 transitions (discarded 19 similar events)
// Phase 1: matrix 157 rows 43 cols
[2024-06-02 23:22:55] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:22:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 23:22:57] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-06-02 23:22:57] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:22:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:22:57] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:22:57] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:22:57] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 156/199 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/200 variables, and 91 constraints, problems are : Problem set: 0 solved, 172 unsolved in 5201 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 3/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 156/199 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 172/263 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 23:23:07] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/199 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/200 variables, and 264 constraints, problems are : Problem set: 0 solved, 172 unsolved in 13922 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 7/7 constraints]
After SMT, in 19296ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 19299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/141 places, 176/364 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 43 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 29 place count 39 transition count 150
Applied a total of 29 rules in 8 ms. Remains 39 /43 variables (removed 4) and now considering 150/176 (removed 26) transitions.
[2024-06-02 23:23:15] [INFO ] Flow matrix only has 137 transitions (discarded 13 similar events)
// Phase 1: matrix 137 rows 39 cols
[2024-06-02 23:23:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:23:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:23:15] [INFO ] Flow matrix only has 137 transitions (discarded 13 similar events)
[2024-06-02 23:23:15] [INFO ] Invariant cache hit.
[2024-06-02 23:23:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-02 23:23:15] [INFO ] Implicit Places using invariants and state equation in 116 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 : 39/141 places, 150/364 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19892 ms. Remains : 39/141 places, 150/364 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
RANDOM walk for 32495 steps (5211 resets) in 74 ms. (433 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Built C files in :
/tmp/ltsmin14060100878594721425
[2024-06-02 23:23:16] [INFO ] Computing symmetric may disable matrix : 150 transitions.
[2024-06-02 23:23:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:23:16] [INFO ] Computing symmetric may enable matrix : 150 transitions.
[2024-06-02 23:23:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:23:16] [INFO ] Computing Do-Not-Accords matrix : 150 transitions.
[2024-06-02 23:23:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:23:16] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14060100878594721425
Running compilation step : cd /tmp/ltsmin14060100878594721425;'/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 637 ms.
Running link step : cd /tmp/ltsmin14060100878594721425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14060100878594721425;'/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/stateBased18354600669113614222.hoa' '--buchi-type=spotba'
LTSmin run took 351 ms.
FORMULA MedleyA-PT-15-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-07 finished in 84319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((X(p2)&&p1))&&p0)))))'
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 5 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 23:23:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:23:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 23:23:17] [INFO ] Invariant cache hit.
[2024-06-02 23:23:17] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:23:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:23:21] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:23:21] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 3 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 86 places in 189 ms of which 3 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:23:25] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:23:25] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:23:25] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:23:26] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:23:26] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:23:27] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:23:31] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:23:34] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:23:43] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:23:47] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
SMT process timed out in 30238ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 30242ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30641 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 185 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-08 finished in 31248 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||X(X(p1))))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 142 transition count 365
Applied a total of 17 rules in 4 ms. Remains 142 /149 variables (removed 7) and now considering 365/379 (removed 14) transitions.
// Phase 1: matrix 365 rows 142 cols
[2024-06-02 23:23:48] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:23:48] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 23:23:48] [INFO ] Invariant cache hit.
[2024-06-02 23:23:48] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-02 23:23:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:23:55] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:23:55] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:23:55] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:23:55] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:23:56] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:23:56] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:23:56] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:23:56] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 23:23:58] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-06-02 23:23:58] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 23:24:02] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:24:03] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 23:24:05] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 365/507 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 23:24:16] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/507 variables, and 173 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 365/507 variables, 142/173 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 364/537 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/507 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 537 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 24/24 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 365/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 142/149 places, 365/379 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-09
Product exploration explored 100000 steps with 9172 reset in 265 ms.
Stack based approach found an accepted trace after 26419 steps with 2431 reset with depth 17 and stack size 17 in 92 ms.
FORMULA MedleyA-PT-15-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-09 finished in 61328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 148 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 352
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 41 place count 122 transition count 344
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 114 transition count 344
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 106 transition count 330
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 106 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 106 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 106 transition count 325
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 104 transition count 325
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 110 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 87 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 303
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -102
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 146 place count 71 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 180 place count 71 transition count 371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 188 place count 67 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 66 transition count 417
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 72 edges and 64 vertex of which 27 / 64 are part of one of the 11 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 192 place count 48 transition count 417
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 4 with 79 rules applied. Total rules applied 271 place count 48 transition count 338
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 276 place count 43 transition count 272
Iterating global reduction 5 with 5 rules applied. Total rules applied 281 place count 43 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 290 place count 43 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 6 with 79 rules applied. Total rules applied 369 place count 43 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 369 place count 43 transition count 183
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 42 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 41 transition count 177
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 41 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 377 place count 39 transition count 175
Applied a total of 377 rules in 66 ms. Remains 39 /149 variables (removed 110) and now considering 175/379 (removed 204) transitions.
[2024-06-02 23:24:49] [INFO ] Flow matrix only has 155 transitions (discarded 20 similar events)
// Phase 1: matrix 155 rows 39 cols
[2024-06-02 23:24:49] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:24:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:24:49] [INFO ] Flow matrix only has 155 transitions (discarded 20 similar events)
[2024-06-02 23:24:49] [INFO ] Invariant cache hit.
[2024-06-02 23:24:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:24:50] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 23:24:50] [INFO ] Redundant transitions in 44 ms returned [16, 99, 125, 127, 169, 171, 173, 174]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 161 sub problems to find dead transitions.
[2024-06-02 23:24:50] [INFO ] Flow matrix only has 147 transitions (discarded 20 similar events)
// Phase 1: matrix 147 rows 39 cols
[2024-06-02 23:24:50] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:24:50] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 23:24:50] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 7 ms to minimize.
[2024-06-02 23:24:50] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:24:50] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:24:51] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:24:51] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:24:51] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 146/185 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 23:24:53] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 87 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6411 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 146/185 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 161/248 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 248 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 7/7 constraints]
After SMT, in 12622ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 12624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/149 places, 167/379 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 165
Applied a total of 4 rules in 8 ms. Remains 37 /39 variables (removed 2) and now considering 165/167 (removed 2) transitions.
[2024-06-02 23:25:02] [INFO ] Flow matrix only has 145 transitions (discarded 20 similar events)
// Phase 1: matrix 145 rows 37 cols
[2024-06-02 23:25:02] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:25:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:25:02] [INFO ] Flow matrix only has 145 transitions (discarded 20 similar events)
[2024-06-02 23:25:02] [INFO ] Invariant cache hit.
[2024-06-02 23:25:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:25:02] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/149 places, 165/379 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13267 ms. Remains : 37/149 places, 165/379 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-10 finished in 13342 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((G(p1) U (p0&&G(p1)))))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 143 transition count 370
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 143 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 143 transition count 367
Applied a total of 15 rules in 3 ms. Remains 143 /149 variables (removed 6) and now considering 367/379 (removed 12) transitions.
// Phase 1: matrix 367 rows 143 cols
[2024-06-02 23:25:03] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:25:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:25:03] [INFO ] Invariant cache hit.
[2024-06-02 23:25:03] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-06-02 23:25:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:25:06] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:25:06] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:25:07] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2024-06-02 23:25:07] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:25:07] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:25:07] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2024-06-02 23:25:07] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:25:08] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 2 ms to minimize.
[2024-06-02 23:25:08] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:25:08] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:25:08] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:25:09] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:25:09] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:25:09] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:25:10] [INFO ] Deduced a trap composed of 103 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:25:10] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-06-02 23:25:10] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:25:13] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:25:13] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:25:13] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:25:13] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:25:17] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:25:18] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:25:20] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:25:20] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (OVERLAPS) 367/510 variables, 143/175 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:25:27] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 176 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:25:36] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/510 variables, 143/177 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 366/543 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 543 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 27/27 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 143/149 places, 367/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 143/149 places, 367/379 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 186 ms.
Product exploration explored 100000 steps with 0 reset in 210 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/143 stabilizing places and 14/367 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
[2024-06-02 23:26:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/143 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:26:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:26:05] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/143 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 367/367 transitions.
Graph (trivial) has 141 edges and 143 vertex of which 9 / 143 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 137 transition count 337
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 116 transition count 337
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 116 transition count 328
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 107 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 107 transition count 327
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 104 transition count 322
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 104 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 104 transition count 321
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 103 transition count 321
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 89 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 87 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 87 transition count 300
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -149
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 140 place count 68 transition count 449
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 145 place count 68 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 4 with 54 rules applied. Total rules applied 199 place count 68 transition count 390
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 66 transition count 412
Free-agglomeration rule applied 21 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 224 place count 66 transition count 383
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 279 place count 45 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 313 place count 45 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 314 place count 44 transition count 314
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 38 edges and 42 vertex of which 10 / 42 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 317 place count 37 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 6 with 79 rules applied. Total rules applied 396 place count 37 transition count 235
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 401 place count 32 transition count 207
Iterating global reduction 7 with 5 rules applied. Total rules applied 406 place count 32 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 415 place count 32 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 459 place count 32 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 463 place count 30 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 467 place count 28 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 483 place count 28 transition count 146
Applied a total of 483 rules in 81 ms. Remains 28 /143 variables (removed 115) and now considering 146/367 (removed 221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 28/143 places, 146/367 transitions.
RANDOM walk for 16748 steps (17 resets) in 50 ms. (328 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 343 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
[2024-06-02 23:26:06] [INFO ] Invariant cache hit.
[2024-06-02 23:26:06] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 373 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-15-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLFireability-13 finished in 63885 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((G(p1)||p0))&&F(G((p2||F((G(p1)||p3))))))))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 133 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 142 transition count 351
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 121 transition count 351
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 43 place count 121 transition count 344
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 114 transition count 344
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 106 transition count 330
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 106 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 106 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 106 transition count 325
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 104 transition count 325
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 110 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 87 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 303
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 142 place count 73 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 182 place count 73 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 70 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 69 transition count 388
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 51 edges and 68 vertex of which 15 / 68 are part of one of the 6 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 59 transition count 388
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 218 place count 59 transition count 361
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 220 place count 57 transition count 323
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 57 transition count 323
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 236 place count 57 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 6 with 33 rules applied. Total rules applied 269 place count 57 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 271 place count 56 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 292 place count 56 transition count 268
Applied a total of 292 rules in 66 ms. Remains 56 /149 variables (removed 93) and now considering 268/379 (removed 111) transitions.
[2024-06-02 23:26:07] [INFO ] Flow matrix only has 215 transitions (discarded 53 similar events)
// Phase 1: matrix 215 rows 56 cols
[2024-06-02 23:26:07] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 23:26:07] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:26:07] [INFO ] Flow matrix only has 215 transitions (discarded 53 similar events)
[2024-06-02 23:26:07] [INFO ] Invariant cache hit.
[2024-06-02 23:26:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:26:07] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 23:26:07] [INFO ] Redundant transitions in 24 ms returned [261, 265]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 260 sub problems to find dead transitions.
[2024-06-02 23:26:07] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
// Phase 1: matrix 213 rows 56 cols
[2024-06-02 23:26:07] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 23:26:07] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 23:26:08] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:26:08] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:26:08] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:26:09] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:26:09] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 112 constraints, problems are : Problem set: 0 solved, 260 unsolved in 15051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 260/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 23:26:29] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 23:26:33] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 1/269 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 374 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24398 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
After SMT, in 39630ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 39635ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/149 places, 266/379 transitions.
Applied a total of 0 rules in 8 ms. Remains 56 /56 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40059 ms. Remains : 56/149 places, 266/379 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 113 ms.
Product exploration explored 100000 steps with 0 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 186 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1032 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1051 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1639 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 868 ms. (46 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1056 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1585 ms. (25 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1302 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1066 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1964 ms. (20 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1293 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1974 ms. (20 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1634 ms. (24 steps per ms) remains 11/11 properties
Probably explored full state space saw : 22808 states, properties seen :9
Probabilistic random walk after 154542 steps, saw 22808 distinct states, run finished after 673 ms. (steps per millisecond=229 ) properties seen :9
Explored full state space saw : 22808 states, properties seen :0
Exhaustive walk after 154542 steps, saw 22808 distinct states, run finished after 567 ms. (steps per millisecond=272 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p3)), (G (OR p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (AND (OR p1 p3) (OR p2 p3)))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 23 factoid took 596 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 56 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 : 56/56 places, 266/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-02 23:26:55] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2024-06-02 23:26:55] [INFO ] Invariant cache hit.
[2024-06-02 23:26:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 23:26:55] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2024-06-02 23:26:55] [INFO ] Invariant cache hit.
[2024-06-02 23:26:55] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:26:56] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 23:26:56] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-02 23:26:56] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2024-06-02 23:26:56] [INFO ] Invariant cache hit.
[2024-06-02 23:26:56] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 23:26:57] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:26:57] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:26:57] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:26:57] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:26:58] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 23:27:03] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 112 constraints, problems are : Problem set: 0 solved, 260 unsolved in 17006 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 260/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 372 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24332 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints]
After SMT, in 41556ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 41562ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41848 ms. Remains : 56/56 places, 266/266 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p3), (X (NOT (AND p1 (NOT p0)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 146 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 442 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1202 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 960 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1489 ms. (26 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 913 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1171 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1371 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 989 ms. (40 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 7934 steps, run visited all 7 properties in 67 ms. (steps per millisecond=118 )
Probabilistic random walk after 7934 steps, saw 2403 distinct states, run finished after 67 ms. (steps per millisecond=118 ) properties seen :7
Knowledge obtained : [(AND (NOT p1) p0 p3), (X (NOT (AND p1 (NOT p0)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p1))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p3 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p3))]
Knowledge based reduction with 15 factoid took 387 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Built C files in :
/tmp/ltsmin5262748550962270868
[2024-06-02 23:27:41] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-06-02 23:27:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:27:41] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-06-02 23:27:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:27:41] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-06-02 23:27:41] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:27:41] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5262748550962270868
Running compilation step : cd /tmp/ltsmin5262748550962270868;'/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 1003 ms.
Running link step : cd /tmp/ltsmin5262748550962270868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5262748550962270868;'/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/stateBased11817583302383217324.hoa' '--buchi-type=spotba'
LTSmin run took 542 ms.
FORMULA MedleyA-PT-15-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-14 finished in 96516 ms.
All properties solved by simple procedures.
Total runtime 784836 ms.

BK_STOP 1717370863522

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

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