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.r579-smll-171734921300131.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 ltsminxred
Input is MedleyA-PT-17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-LTLCardinality-00
FORMULA_NAME MedleyA-PT-17-LTLCardinality-01
FORMULA_NAME MedleyA-PT-17-LTLCardinality-02
FORMULA_NAME MedleyA-PT-17-LTLCardinality-03
FORMULA_NAME MedleyA-PT-17-LTLCardinality-04
FORMULA_NAME MedleyA-PT-17-LTLCardinality-05
FORMULA_NAME MedleyA-PT-17-LTLCardinality-06
FORMULA_NAME MedleyA-PT-17-LTLCardinality-07
FORMULA_NAME MedleyA-PT-17-LTLCardinality-08
FORMULA_NAME MedleyA-PT-17-LTLCardinality-09
FORMULA_NAME MedleyA-PT-17-LTLCardinality-10
FORMULA_NAME MedleyA-PT-17-LTLCardinality-11
FORMULA_NAME MedleyA-PT-17-LTLCardinality-12
FORMULA_NAME MedleyA-PT-17-LTLCardinality-13
FORMULA_NAME MedleyA-PT-17-LTLCardinality-14
FORMULA_NAME MedleyA-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717359278242

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:14:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:14:41] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2024-06-02 20:14:41] [INFO ] Transformed 248 places.
[2024-06-02 20:14:41] [INFO ] Transformed 591 transitions.
[2024-06-02 20:14:41] [INFO ] Found NUPN structural information;
[2024-06-02 20:14:41] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 640 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 203 transition count 512
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 203 transition count 512
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 124 place count 203 transition count 478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 128 place count 199 transition count 470
Iterating global reduction 1 with 4 rules applied. Total rules applied 132 place count 199 transition count 470
Applied a total of 132 rules in 137 ms. Remains 199 /248 variables (removed 49) and now considering 470/589 (removed 119) transitions.
// Phase 1: matrix 470 rows 199 cols
[2024-06-02 20:14:42] [INFO ] Computed 7 invariants in 46 ms
[2024-06-02 20:14:42] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-06-02 20:14:42] [INFO ] Invariant cache hit.
[2024-06-02 20:14:43] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-06-02 20:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:14:51] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 41 ms to minimize.
[2024-06-02 20:14:52] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 5 ms to minimize.
[2024-06-02 20:14:52] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 4 ms to minimize.
[2024-06-02 20:14:52] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:14:52] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
[2024-06-02 20:14:53] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 4 ms to minimize.
[2024-06-02 20:14:53] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 12 ms to minimize.
[2024-06-02 20:14:53] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 4 ms to minimize.
[2024-06-02 20:14:53] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-02 20:14:54] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:14:54] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 2 ms to minimize.
[2024-06-02 20:14:54] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:14:54] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:14:54] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 4 ms to minimize.
[2024-06-02 20:14:55] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 3 ms to minimize.
[2024-06-02 20:14:55] [INFO ] Deduced a trap composed of 118 places in 304 ms of which 3 ms to minimize.
[2024-06-02 20:14:55] [INFO ] Deduced a trap composed of 115 places in 284 ms of which 4 ms to minimize.
[2024-06-02 20:14:56] [INFO ] Deduced a trap composed of 115 places in 294 ms of which 4 ms to minimize.
[2024-06-02 20:14:56] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-06-02 20:14:56] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:14:57] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 4 ms to minimize.
[2024-06-02 20:14:57] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 2 ms to minimize.
[2024-06-02 20:14:57] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-06-02 20:14:57] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 2 ms to minimize.
[2024-06-02 20:14:58] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 2 ms to minimize.
[2024-06-02 20:14:59] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 4 ms to minimize.
[2024-06-02 20:14:59] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:14:59] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-06-02 20:15:00] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 3 ms to minimize.
[2024-06-02 20:15:00] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:15:00] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
[2024-06-02 20:15:01] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:15:01] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 2 ms to minimize.
[2024-06-02 20:15:01] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:15:01] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 14 ms to minimize.
[2024-06-02 20:15:02] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 4 ms to minimize.
[2024-06-02 20:15:02] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-06-02 20:15:02] [INFO ] Deduced a trap composed of 95 places in 269 ms of which 3 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 3 ms to minimize.
[2024-06-02 20:15:03] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:15:07] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 4 ms to minimize.
[2024-06-02 20:15:08] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:15:09] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 4 ms to minimize.
[2024-06-02 20:15:09] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:15:09] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 4 ms to minimize.
[2024-06-02 20:15:10] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 3 ms to minimize.
[2024-06-02 20:15:10] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:15:10] [INFO ] Deduced a trap composed of 94 places in 272 ms of which 4 ms to minimize.
[2024-06-02 20:15:10] [INFO ] Deduced a trap composed of 94 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:15:11] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2024-06-02 20:15:11] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 4 ms to minimize.
[2024-06-02 20:15:11] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 2 ms to minimize.
[2024-06-02 20:15:11] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:15:13] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 3 ms to minimize.
[2024-06-02 20:15:13] [INFO ] Deduced a trap composed of 119 places in 254 ms of which 3 ms to minimize.
[2024-06-02 20:15:13] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 199/669 variables, and 63 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/199 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:15:19] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 3 ms to minimize.
[2024-06-02 20:15:20] [INFO ] Deduced a trap composed of 128 places in 272 ms of which 4 ms to minimize.
[2024-06-02 20:15:20] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 4 ms to minimize.
[2024-06-02 20:15:20] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:15:21] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 3 ms to minimize.
[2024-06-02 20:15:21] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 3 ms to minimize.
[2024-06-02 20:15:23] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:15:25] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:15:35] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 4 ms to minimize.
[2024-06-02 20:15:35] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 3 ms to minimize.
[2024-06-02 20:15:35] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 3 ms to minimize.
[2024-06-02 20:15:36] [INFO ] Deduced a trap composed of 118 places in 275 ms of which 3 ms to minimize.
[2024-06-02 20:15:37] [INFO ] Deduced a trap composed of 49 places in 300 ms of which 4 ms to minimize.
[2024-06-02 20:15:37] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-02 20:15:42] [INFO ] Deduced a trap composed of 120 places in 305 ms of which 4 ms to minimize.
[2024-06-02 20:15:43] [INFO ] Deduced a trap composed of 117 places in 299 ms of which 3 ms to minimize.
[2024-06-02 20:15:43] [INFO ] Deduced a trap composed of 46 places in 317 ms of which 3 ms to minimize.
[2024-06-02 20:15:44] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 3 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 Int declared 199/669 variables, and 83 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/199 constraints, PredecessorRefiner: 0/469 constraints, Known Traps: 76/76 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 61145ms
Starting structural reductions in LTL mode, iteration 1 : 199/248 places, 470/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62633 ms. Remains : 199/248 places, 470/589 transitions.
Support contains 23 out of 199 places after structural reductions.
[2024-06-02 20:15:44] [INFO ] Flatten gal took : 168 ms
[2024-06-02 20:15:45] [INFO ] Flatten gal took : 91 ms
[2024-06-02 20:15:45] [INFO ] Input system was already deterministic with 470 transitions.
RANDOM walk for 40000 steps (1376 resets) in 1816 ms. (22 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40004 steps (298 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (298 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (297 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (297 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (297 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (300 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (297 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (299 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (305 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (322 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (301 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
[2024-06-02 20:15:46] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 165/182 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 17/199 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 470/669 variables, 199/206 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/669 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 206 constraints, problems are : Problem set: 1 solved, 10 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 147/162 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 20:15:47] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:15:47] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-02 20:15:47] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:15:47] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:15:48] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 2 ms to minimize.
[2024-06-02 20:15:48] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 37/199 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 20:15:48] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 470/669 variables, 199/213 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 10/223 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 20:15:49] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:15:50] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 3 ms to minimize.
[2024-06-02 20:15:50] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2024-06-02 20:15:50] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:15:50] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 5/228 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/669 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 228 constraints, problems are : Problem set: 1 solved, 10 unsolved in 4747 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 12/12 constraints]
After SMT, in 5537ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 3 properties in 19260 ms.
Support contains 12 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 167 edges and 199 vertex of which 9 / 199 are part of one of the 3 SCC in 5 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 193 transition count 435
Reduce places removed 26 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 167 transition count 431
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 163 transition count 431
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 61 place count 163 transition count 420
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 83 place count 152 transition count 420
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 88 place count 147 transition count 413
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 147 transition count 413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 147 transition count 412
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 95 place count 146 transition count 412
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 137 place count 125 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 124 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 124 transition count 375
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 165 place count 111 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 169 place count 111 transition count 413
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 110 transition count 405
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 110 transition count 405
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 175 place count 110 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 183 place count 110 transition count 393
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 191 place count 106 transition count 389
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 199 place count 102 transition count 418
Free-agglomeration rule applied 35 times.
Iterating global reduction 5 with 35 rules applied. Total rules applied 234 place count 102 transition count 383
Reduce places removed 35 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 5 with 67 rules applied. Total rules applied 301 place count 67 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 317 place count 67 transition count 335
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 321 place count 67 transition count 367
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 333 place count 63 transition count 359
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 334 place count 62 transition count 358
Applied a total of 334 rules in 254 ms. Remains 62 /199 variables (removed 137) and now considering 358/470 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 62/199 places, 358/470 transitions.
RANDOM walk for 21516 steps (1675 resets) in 471 ms. (45 steps per ms) remains 0/7 properties
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA MedleyA-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 196 edges and 199 vertex of which 9 / 199 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 192 transition count 433
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 162 transition count 433
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 61 place count 162 transition count 422
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 83 place count 151 transition count 422
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 91 place count 143 transition count 410
Iterating global reduction 2 with 8 rules applied. Total rules applied 99 place count 143 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 99 place count 143 transition count 408
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 141 transition count 408
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 147 place count 119 transition count 386
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 117 transition count 358
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 117 transition count 358
Performed 23 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 197 place count 94 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 94 transition count 449
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 92 transition count 433
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 92 transition count 433
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 211 place count 92 transition count 425
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 213 place count 91 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 230 place count 91 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 238 place count 87 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 86 transition count 418
Applied a total of 239 rules in 104 ms. Remains 86 /199 variables (removed 113) and now considering 418/470 (removed 52) transitions.
[2024-06-02 20:16:12] [INFO ] Flow matrix only has 390 transitions (discarded 28 similar events)
// Phase 1: matrix 390 rows 86 cols
[2024-06-02 20:16:12] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 20:16:12] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 20:16:12] [INFO ] Flow matrix only has 390 transitions (discarded 28 similar events)
[2024-06-02 20:16:12] [INFO ] Invariant cache hit.
[2024-06-02 20:16:12] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:16:12] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-06-02 20:16:12] [INFO ] Redundant transitions in 27 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-02 20:16:12] [INFO ] Flow matrix only has 390 transitions (discarded 28 similar events)
[2024-06-02 20:16:12] [INFO ] Invariant cache hit.
[2024-06-02 20:16:12] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 20:16:15] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-06-02 20:16:15] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:16:15] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:16:15] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 2 ms to minimize.
[2024-06-02 20:16:15] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 2 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 2 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 2 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 389/475 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 78/186 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 1/476 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 187 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 3 (OVERLAPS) 389/475 variables, 86/108 constraints. Problems are: Problem set: 42 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 78/186 constraints. Problems are: Problem set: 42 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 367/553 constraints. Problems are: Problem set: 42 solved, 367 unsolved
[2024-06-02 20:17:07] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 1/554 constraints. Problems are: Problem set: 42 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/476 variables, and 554 constraints, problems are : Problem set: 42 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 367/409 constraints, Known Traps: 16/16 constraints]
After SMT, in 60600ms problems are : Problem set: 42 solved, 367 unsolved
Search for dead transitions found 42 dead transitions in 60608ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/199 places, 376/470 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 85 transition count 386
Applied a total of 2 rules in 14 ms. Remains 85 /86 variables (removed 1) and now considering 386/376 (removed -10) transitions.
[2024-06-02 20:17:13] [INFO ] Flow matrix only has 358 transitions (discarded 28 similar events)
// Phase 1: matrix 358 rows 85 cols
[2024-06-02 20:17:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:17:13] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 20:17:13] [INFO ] Flow matrix only has 358 transitions (discarded 28 similar events)
[2024-06-02 20:17:13] [INFO ] Invariant cache hit.
[2024-06-02 20:17:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:17:13] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/199 places, 386/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61759 ms. Remains : 85/199 places, 386/470 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-17-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-01 finished in 62186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1 U X((G(p3)||p2)))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 191 transition count 459
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 191 transition count 459
Applied a total of 16 rules in 8 ms. Remains 191 /199 variables (removed 8) and now considering 459/470 (removed 11) transitions.
// Phase 1: matrix 459 rows 191 cols
[2024-06-02 20:17:14] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:17:14] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-02 20:17:14] [INFO ] Invariant cache hit.
[2024-06-02 20:17:15] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2024-06-02 20:17:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:17:22] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 3 ms to minimize.
[2024-06-02 20:17:23] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 4 ms to minimize.
[2024-06-02 20:17:23] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 4 ms to minimize.
[2024-06-02 20:17:23] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 4 ms to minimize.
[2024-06-02 20:17:23] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:17:24] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:17:24] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 3 ms to minimize.
[2024-06-02 20:17:24] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 3 ms to minimize.
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 4 ms to minimize.
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 4 ms to minimize.
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 4 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 115 places in 301 ms of which 3 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 112 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 112 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 89 places in 232 ms of which 4 ms to minimize.
[2024-06-02 20:17:27] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 4 ms to minimize.
[2024-06-02 20:17:27] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 3 ms to minimize.
[2024-06-02 20:17:27] [INFO ] Deduced a trap composed of 122 places in 217 ms of which 3 ms to minimize.
[2024-06-02 20:17:28] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 112 places in 226 ms of which 3 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 2 ms to minimize.
[2024-06-02 20:17:30] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:17:30] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:17:30] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:17:30] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 2 ms to minimize.
[2024-06-02 20:17:30] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 117 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 3 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 3 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 3 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 2 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-06-02 20:17:34] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 4 ms to minimize.
[2024-06-02 20:17:34] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 3 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 2 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 3 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 3 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 3 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:17:40] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 4 ms to minimize.
[2024-06-02 20:17:40] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 4 ms to minimize.
[2024-06-02 20:17:41] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:17:42] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 3 ms to minimize.
[2024-06-02 20:17:44] [INFO ] Deduced a trap composed of 42 places in 320 ms of which 4 ms to minimize.
[2024-06-02 20:17:44] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 3 ms to minimize.
[2024-06-02 20:17:45] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:17:45] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:17:45] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/650 variables, and 62 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 55/62 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:17:49] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:17:49] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:17:49] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 2 ms to minimize.
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:17:52] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:17:56] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:17:57] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:17:57] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:17:58] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:17:58] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 3 ms to minimize.
[2024-06-02 20:17:58] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:17:58] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 2 ms to minimize.
[2024-06-02 20:17:59] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 3 ms to minimize.
[2024-06-02 20:17:59] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:18:01] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 4 ms to minimize.
[2024-06-02 20:18:01] [INFO ] Deduced a trap composed of 90 places in 255 ms of which 4 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 90 places in 243 ms of which 3 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 8 (OVERLAPS) 459/650 variables, 191/276 constraints. Problems are: Problem set: 50 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 408/684 constraints. Problems are: Problem set: 50 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 684 constraints, problems are : Problem set: 50 solved, 408 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 408/458 constraints, Known Traps: 78/78 constraints]
After SMT, in 60662ms problems are : Problem set: 50 solved, 408 unsolved
Search for dead transitions found 50 dead transitions in 60670ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/199 places, 409/470 transitions.
Applied a total of 0 rules in 5 ms. Remains 191 /191 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61411 ms. Remains : 191/199 places, 409/470 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 543 ms.
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) p3))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 115 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-17-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-17-LTLCardinality-05 finished in 62641 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 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 200 edges and 199 vertex of which 9 / 199 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 434
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 163 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 161 transition count 432
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 63 place count 161 transition count 421
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 85 place count 150 transition count 421
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 94 place count 141 transition count 408
Iterating global reduction 3 with 9 rules applied. Total rules applied 103 place count 141 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 103 place count 141 transition count 405
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 138 transition count 405
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 153 place count 116 transition count 383
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 114 transition count 355
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 114 transition count 355
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 203 place count 91 transition count 443
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 207 place count 91 transition count 439
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 89 transition count 423
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 89 transition count 423
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 219 place count 89 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 88 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 243 place count 88 transition count 408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 251 place count 84 transition count 404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 83 transition count 403
Applied a total of 252 rules in 95 ms. Remains 83 /199 variables (removed 116) and now considering 403/470 (removed 67) transitions.
[2024-06-02 20:18:17] [INFO ] Flow matrix only has 371 transitions (discarded 32 similar events)
// Phase 1: matrix 371 rows 83 cols
[2024-06-02 20:18:17] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:18:17] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-02 20:18:17] [INFO ] Flow matrix only has 371 transitions (discarded 32 similar events)
[2024-06-02 20:18:17] [INFO ] Invariant cache hit.
[2024-06-02 20:18:17] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 20:18:17] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-06-02 20:18:17] [INFO ] Redundant transitions in 9 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-02 20:18:17] [INFO ] Flow matrix only has 371 transitions (discarded 32 similar events)
[2024-06-02 20:18:17] [INFO ] Invariant cache hit.
[2024-06-02 20:18:17] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-02 20:18:19] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:18:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:18:19] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:18:20] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:18:20] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:18:20] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:18:20] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 2 ms to minimize.
[2024-06-02 20:18:20] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2024-06-02 20:18:21] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:18:21] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2024-06-02 20:18:21] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:18:21] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 370/453 variables, 83/102 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 75/177 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/454 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/454 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 178 constraints, problems are : Problem set: 0 solved, 394 unsolved in 27428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 3 (OVERLAPS) 370/453 variables, 83/102 constraints. Problems are: Problem set: 42 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 75/177 constraints. Problems are: Problem set: 42 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 352/529 constraints. Problems are: Problem set: 42 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 0/529 constraints. Problems are: Problem set: 42 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 1/454 variables, 1/530 constraints. Problems are: Problem set: 42 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 530 constraints, problems are : Problem set: 42 solved, 352 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 352/394 constraints, Known Traps: 12/12 constraints]
After SMT, in 57952ms problems are : Problem set: 42 solved, 352 unsolved
Search for dead transitions found 42 dead transitions in 57957ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 83/199 places, 361/470 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 395
Applied a total of 6 rules in 19 ms. Remains 80 /83 variables (removed 3) and now considering 395/361 (removed -34) transitions.
[2024-06-02 20:19:15] [INFO ] Flow matrix only has 353 transitions (discarded 42 similar events)
// Phase 1: matrix 353 rows 80 cols
[2024-06-02 20:19:15] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:19:15] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-02 20:19:15] [INFO ] Flow matrix only has 353 transitions (discarded 42 similar events)
[2024-06-02 20:19:15] [INFO ] Invariant cache hit.
[2024-06-02 20:19:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 20:19:16] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/199 places, 395/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59166 ms. Remains : 80/199 places, 395/470 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-07
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-07 finished in 59241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(p1 U X(p2))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 190 transition count 457
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 190 transition count 457
Applied a total of 18 rules in 6 ms. Remains 190 /199 variables (removed 9) and now considering 457/470 (removed 13) transitions.
// Phase 1: matrix 457 rows 190 cols
[2024-06-02 20:19:16] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:19:16] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-02 20:19:16] [INFO ] Invariant cache hit.
[2024-06-02 20:19:16] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2024-06-02 20:19:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:19:24] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:19:24] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:19:24] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-06-02 20:19:24] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:19:25] [INFO ] Deduced a trap composed of 112 places in 274 ms of which 3 ms to minimize.
[2024-06-02 20:19:25] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 4 ms to minimize.
[2024-06-02 20:19:25] [INFO ] Deduced a trap composed of 112 places in 300 ms of which 3 ms to minimize.
[2024-06-02 20:19:25] [INFO ] Deduced a trap composed of 124 places in 287 ms of which 3 ms to minimize.
[2024-06-02 20:19:26] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:19:26] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:19:26] [INFO ] Deduced a trap composed of 95 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:19:26] [INFO ] Deduced a trap composed of 111 places in 212 ms of which 3 ms to minimize.
[2024-06-02 20:19:27] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 3 ms to minimize.
[2024-06-02 20:19:27] [INFO ] Deduced a trap composed of 112 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:19:28] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 4 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 4 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 4 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 111 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:19:30] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:19:31] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 3 ms to minimize.
[2024-06-02 20:19:32] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 3 ms to minimize.
[2024-06-02 20:19:32] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-02 20:19:32] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 3 ms to minimize.
[2024-06-02 20:19:33] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 3 ms to minimize.
[2024-06-02 20:19:33] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 2 ms to minimize.
[2024-06-02 20:19:33] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 4 ms to minimize.
[2024-06-02 20:19:33] [INFO ] Deduced a trap composed of 39 places in 283 ms of which 3 ms to minimize.
[2024-06-02 20:19:34] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:19:34] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 3 ms to minimize.
[2024-06-02 20:19:34] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 3 ms to minimize.
[2024-06-02 20:19:35] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:19:35] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:19:35] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:19:36] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 4 ms to minimize.
[2024-06-02 20:19:36] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 3 ms to minimize.
[2024-06-02 20:19:37] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:19:37] [INFO ] Deduced a trap composed of 115 places in 241 ms of which 5 ms to minimize.
[2024-06-02 20:19:38] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-06-02 20:19:39] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:19:44] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 4 ms to minimize.
[2024-06-02 20:19:44] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:19:46] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 2 ms to minimize.
[2024-06-02 20:19:47] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:19:47] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 4 ms to minimize.
[2024-06-02 20:19:47] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/647 variables, and 53 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:19:51] [INFO ] Deduced a trap composed of 112 places in 264 ms of which 3 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 3 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:19:58] [INFO ] Deduced a trap composed of 112 places in 271 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:20:02] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 3 ms to minimize.
[2024-06-02 20:20:03] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:20:05] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:20:06] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 6 ms to minimize.
[2024-06-02 20:20:07] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 4 ms to minimize.
[2024-06-02 20:20:07] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 3 ms to minimize.
[2024-06-02 20:20:08] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 3 ms to minimize.
[2024-06-02 20:20:08] [INFO ] Deduced a trap composed of 90 places in 282 ms of which 3 ms to minimize.
[2024-06-02 20:20:09] [INFO ] Deduced a trap composed of 112 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:20:09] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:20:09] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-02 20:20:13] [INFO ] Deduced a trap composed of 128 places in 234 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 456 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 190/647 variables, and 70 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/456 constraints, Known Traps: 63/63 constraints]
After SMT, in 60595ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Starting structural reductions in LTL mode, iteration 1 : 190/199 places, 457/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61423 ms. Remains : 190/199 places, 457/470 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/190 stabilizing places and 16/457 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 27 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-17-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-17-LTLCardinality-12 finished in 62255 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(!p0)||(!p0&&F(G(p1)))))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 195 edges and 199 vertex of which 9 / 199 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 434
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 163 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 162 transition count 433
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 61 place count 162 transition count 422
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 83 place count 151 transition count 422
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 91 place count 143 transition count 411
Iterating global reduction 3 with 8 rules applied. Total rules applied 99 place count 143 transition count 411
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 99 place count 143 transition count 408
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 105 place count 140 transition count 408
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 145 place count 120 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 118 transition count 360
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 118 transition count 360
Performed 22 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 193 place count 96 transition count 435
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 96 transition count 431
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 94 transition count 415
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 94 transition count 415
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 209 place count 94 transition count 407
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 92 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 239 place count 92 transition count 411
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 247 place count 88 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 87 transition count 406
Applied a total of 248 rules in 117 ms. Remains 87 /199 variables (removed 112) and now considering 406/470 (removed 64) transitions.
[2024-06-02 20:20:18] [INFO ] Flow matrix only has 378 transitions (discarded 28 similar events)
// Phase 1: matrix 378 rows 87 cols
[2024-06-02 20:20:18] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:20:18] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-02 20:20:18] [INFO ] Flow matrix only has 378 transitions (discarded 28 similar events)
[2024-06-02 20:20:18] [INFO ] Invariant cache hit.
[2024-06-02 20:20:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:20:19] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-06-02 20:20:19] [INFO ] Redundant transitions in 53 ms returned []
Running 396 sub problems to find dead transitions.
[2024-06-02 20:20:19] [INFO ] Flow matrix only has 378 transitions (discarded 28 similar events)
[2024-06-02 20:20:19] [INFO ] Invariant cache hit.
[2024-06-02 20:20:19] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-02 20:20:21] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:20:22] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 2 ms to minimize.
[2024-06-02 20:20:22] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2024-06-02 20:20:22] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:20:22] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-06-02 20:20:22] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:20:22] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:20:22] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-06-02 20:20:23] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 2 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 2 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-06-02 20:20:32] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 377/464 variables, 87/108 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 78/186 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 10 (OVERLAPS) 1/465 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 187 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 5 (OVERLAPS) 377/464 variables, 87/108 constraints. Problems are: Problem set: 42 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 78/186 constraints. Problems are: Problem set: 42 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 354/540 constraints. Problems are: Problem set: 42 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/465 variables, and 540 constraints, problems are : Problem set: 42 solved, 354 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 354/396 constraints, Known Traps: 14/14 constraints]
After SMT, in 60685ms problems are : Problem set: 42 solved, 354 unsolved
Search for dead transitions found 42 dead transitions in 60693ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/199 places, 364/470 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 374
Applied a total of 2 rules in 12 ms. Remains 86 /87 variables (removed 1) and now considering 374/364 (removed -10) transitions.
[2024-06-02 20:21:19] [INFO ] Flow matrix only has 346 transitions (discarded 28 similar events)
// Phase 1: matrix 346 rows 86 cols
[2024-06-02 20:21:19] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:21:20] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 20:21:20] [INFO ] Flow matrix only has 346 transitions (discarded 28 similar events)
[2024-06-02 20:21:20] [INFO ] Invariant cache hit.
[2024-06-02 20:21:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:21:20] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/199 places, 374/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62123 ms. Remains : 86/199 places, 374/470 transitions.
Stuttering acceptance computed with spot in 178 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-13 finished in 62330 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(p0)||X(X(F(p1)))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 191 transition count 459
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 191 transition count 459
Applied a total of 16 rules in 6 ms. Remains 191 /199 variables (removed 8) and now considering 459/470 (removed 11) transitions.
// Phase 1: matrix 459 rows 191 cols
[2024-06-02 20:21:20] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:21:20] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-02 20:21:20] [INFO ] Invariant cache hit.
[2024-06-02 20:21:21] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2024-06-02 20:21:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:21:29] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 4 ms to minimize.
[2024-06-02 20:21:29] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:21:29] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 4 ms to minimize.
[2024-06-02 20:21:29] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 3 ms to minimize.
[2024-06-02 20:21:30] [INFO ] Deduced a trap composed of 111 places in 198 ms of which 3 ms to minimize.
[2024-06-02 20:21:30] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:21:30] [INFO ] Deduced a trap composed of 111 places in 221 ms of which 4 ms to minimize.
[2024-06-02 20:21:31] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:21:32] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
[2024-06-02 20:21:32] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 2 ms to minimize.
[2024-06-02 20:21:32] [INFO ] Deduced a trap composed of 111 places in 202 ms of which 3 ms to minimize.
[2024-06-02 20:21:32] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 3 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 4 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 4 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 3 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 4 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 4 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 4 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 117 places in 296 ms of which 4 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 25 places in 318 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:21:36] [INFO ] Deduced a trap composed of 111 places in 219 ms of which 3 ms to minimize.
[2024-06-02 20:21:36] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 4 ms to minimize.
[2024-06-02 20:21:37] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 3 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 3 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 3 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2024-06-02 20:21:39] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 3 ms to minimize.
[2024-06-02 20:21:39] [INFO ] Deduced a trap composed of 119 places in 291 ms of which 4 ms to minimize.
[2024-06-02 20:21:39] [INFO ] Deduced a trap composed of 123 places in 293 ms of which 4 ms to minimize.
[2024-06-02 20:21:40] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 2 ms to minimize.
[2024-06-02 20:21:40] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 2 ms to minimize.
[2024-06-02 20:21:40] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2024-06-02 20:21:40] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:21:41] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 3 ms to minimize.
[2024-06-02 20:21:41] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 3 ms to minimize.
[2024-06-02 20:21:41] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2024-06-02 20:21:41] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 2 ms to minimize.
[2024-06-02 20:21:42] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 2 ms to minimize.
[2024-06-02 20:21:42] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:21:42] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:21:47] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-02 20:21:47] [INFO ] Deduced a trap composed of 115 places in 267 ms of which 3 ms to minimize.
[2024-06-02 20:21:48] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:21:48] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 3 ms to minimize.
[2024-06-02 20:21:49] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:21:50] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/650 variables, and 53 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:21:56] [INFO ] Deduced a trap composed of 98 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:21:57] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2024-06-02 20:21:57] [INFO ] Deduced a trap composed of 112 places in 249 ms of which 4 ms to minimize.
[2024-06-02 20:21:58] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:02] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 3 ms to minimize.
[2024-06-02 20:22:03] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:07] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 6 ms to minimize.
[2024-06-02 20:22:07] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 2 ms to minimize.
[2024-06-02 20:22:08] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:22:08] [INFO ] Deduced a trap composed of 85 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:22:08] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 3 ms to minimize.
[2024-06-02 20:22:09] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 3 ms to minimize.
[2024-06-02 20:22:09] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 3 ms to minimize.
[2024-06-02 20:22:10] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:13] [INFO ] Deduced a trap composed of 115 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:22:13] [INFO ] Deduced a trap composed of 112 places in 257 ms of which 3 ms to minimize.
[2024-06-02 20:22:14] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 3 ms to minimize.
[2024-06-02 20:22:14] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 3 ms to minimize.
[2024-06-02 20:22:15] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/650 variables, and 72 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 0/458 constraints, Known Traps: 65/65 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 60632ms
Starting structural reductions in LTL mode, iteration 1 : 191/199 places, 459/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61372 ms. Remains : 191/199 places, 459/470 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-17-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-17-LTLCardinality-15 finished in 61976 ms.
All properties solved by simple procedures.
Total runtime 461947 ms.
ITS solved all properties within timeout

BK_STOP 1717359742790

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MedleyA-PT-17, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921300131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;