Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 160K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-11-LTLFireability-00
FORMULA_NAME MedleyA-PT-11-LTLFireability-01
FORMULA_NAME MedleyA-PT-11-LTLFireability-02
FORMULA_NAME MedleyA-PT-11-LTLFireability-03
FORMULA_NAME MedleyA-PT-11-LTLFireability-04
FORMULA_NAME MedleyA-PT-11-LTLFireability-05
FORMULA_NAME MedleyA-PT-11-LTLFireability-06
FORMULA_NAME MedleyA-PT-11-LTLFireability-07
FORMULA_NAME MedleyA-PT-11-LTLFireability-08
FORMULA_NAME MedleyA-PT-11-LTLFireability-09
FORMULA_NAME MedleyA-PT-11-LTLFireability-10
FORMULA_NAME MedleyA-PT-11-LTLFireability-11
FORMULA_NAME MedleyA-PT-11-LTLFireability-12
FORMULA_NAME MedleyA-PT-11-LTLFireability-13
FORMULA_NAME MedleyA-PT-11-LTLFireability-14
FORMULA_NAME MedleyA-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748861518746

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 10:52:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 10:52:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 10:52:02] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2025-06-02 10:52:02] [INFO ] Transformed 150 places.
[2025-06-02 10:52:02] [INFO ] Transformed 478 transitions.
[2025-06-02 10:52:02] [INFO ] Found NUPN structural information;
[2025-06-02 10:52:02] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 617 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 117 transition count 421
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 117 transition count 421
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 113 transition count 401
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 113 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 112 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 112 transition count 397
Applied a total of 76 rules in 80 ms. Remains 112 /150 variables (removed 38) and now considering 397/469 (removed 72) transitions.
[2025-06-02 10:52:02] [INFO ] Flow matrix only has 325 transitions (discarded 72 similar events)
// Phase 1: matrix 325 rows 112 cols
[2025-06-02 10:52:02] [INFO ] Computed 23 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:52:03] [INFO ] Implicit Places using invariants in 446 ms returned []
[2025-06-02 10:52:03] [INFO ] Flow matrix only has 325 transitions (discarded 72 similar events)
[2025-06-02 10:52:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:52:03] [INFO ] State equation strengthened by 162 read => feed constraints.
[2025-06-02 10:52:03] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2025-06-02 10:52:03] [INFO ] Flow matrix only has 325 transitions (discarded 72 similar events)
[2025-06-02 10:52:03] [INFO ] Invariant cache hit.
[2025-06-02 10:52:03] [INFO ] State equation strengthened by 162 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:10] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:11] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:11] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:11] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:11] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:11] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:11] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:12] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:12] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:12] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:12] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:12] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:12] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:13] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:13] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:13] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:13] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:13] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:14] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:14] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:15] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:16] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:16] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:16] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:16] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:16] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:17] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:17] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:18] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:18] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:18] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 11/54 constraints. Problems are: Problem set: 108 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:18] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/55 constraints. Problems are: Problem set: 108 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:20] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/56 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/56 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 325/437 variables, 112/168 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 162/330 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/330 constraints. Problems are: Problem set: 108 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:33] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:33] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 332 constraints, problems are : Problem set: 108 solved, 288 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 35/58 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/58 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 325/437 variables, 112/170 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 162/332 constraints. Problems are: Problem set: 108 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 288/620 constraints. Problems are: Problem set: 108 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:53] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:52:55] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:02] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 3/623 constraints. Problems are: Problem set: 108 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 623 constraints, problems are : Problem set: 108 solved, 288 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/112 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 288/396 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60973ms problems are : Problem set: 108 solved, 288 unsolved
Search for dead transitions found 108 dead transitions in 61018ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/150 places, 289/469 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 289
Applied a total of 1 rules in 9 ms. Remains 111 /112 variables (removed 1) and now considering 289/289 (removed 0) transitions.
// Phase 1: matrix 289 rows 111 cols
[2025-06-02 10:53:04] [INFO ] Computed 22 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:53:04] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 10:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:53:04] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-02 10:53:05] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/150 places, 289/469 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62606 ms. Remains : 111/150 places, 289/469 transitions.
Support contains 47 out of 111 places after structural reductions.
[2025-06-02 10:53:05] [INFO ] Flatten gal took : 113 ms
[2025-06-02 10:53:05] [INFO ] Flatten gal took : 63 ms
[2025-06-02 10:53:05] [INFO ] Input system was already deterministic with 289 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (3114 resets) in 2986 ms. (13 steps per ms) remains 20/34 properties
BEST_FIRST walk for 4003 steps (53 resets) in 67 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (50 resets) in 68 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (49 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (47 resets) in 61 ms. (64 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (45 resets) in 43 ms. (91 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (53 resets) in 87 ms. (45 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (54 resets) in 49 ms. (80 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (48 resets) in 60 ms. (65 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (53 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (52 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (51 resets) in 27 ms. (142 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4003 steps (50 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (44 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (52 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (48 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (49 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (47 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (48 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
[2025-06-02 10:53:06] [INFO ] Invariant cache hit.
[2025-06-02 10:53:06] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/78 variables, 11/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 3 (OVERLAPS) 32/110 variables, 11/22 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 288/398 variables, 110/132 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 126/258 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/258 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/400 variables, 1/259 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/259 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/259 constraints. Problems are: Problem set: 8 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 259 constraints, problems are : Problem set: 8 solved, 9 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 111/111 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 51/69 variables, 9/9 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/73 variables, 2/11 constraints. Problems are: Problem set: 8 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 9 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 5 (OVERLAPS) 34/107 variables, 10/21 constraints. Problems are: Problem set: 9 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:07] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:07] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:08] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 3/24 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 3/110 variables, 1/25 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 288/398 variables, 110/135 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 126/261 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 3/264 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/264 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/400 variables, 1/265 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 5/270 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/270 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/400 variables, 0/270 constraints. Problems are: Problem set: 9 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 270 constraints, problems are : Problem set: 9 solved, 8 unsolved in 4023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 111/111 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 8/17 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4776ms problems are : Problem set: 9 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 5 properties in 858 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 289/289 transitions.
Graph (complete) has 541 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 108 transition count 288
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 95 transition count 239
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 95 transition count 239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 93 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 93 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 92 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 92 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 91 transition count 225
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 86 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 71 place count 86 transition count 234
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 87 place count 86 transition count 352
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 122 place count 70 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 70 transition count 332
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 128 place count 70 transition count 332
Applied a total of 128 rules in 131 ms. Remains 70 /111 variables (removed 41) and now considering 332/289 (removed -43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 70/111 places, 332/289 transitions.
RANDOM walk for 40000 steps (5672 resets) in 425 ms. (93 steps per ms) remains 2/3 properties
BEST_FIRST walk for 35309 steps (1050 resets) in 221 ms. (159 steps per ms) remains 0/2 properties
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 119 stable transitions
Graph (complete) has 702 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
FORMULA MedleyA-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(F(p2))))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 289/289 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 289
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 95 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 95 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 93 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 93 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 92 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 92 transition count 217
Applied a total of 36 rules in 18 ms. Remains 92 /111 variables (removed 19) and now considering 217/289 (removed 72) transitions.
// Phase 1: matrix 217 rows 92 cols
[2025-06-02 10:53:13] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:53:13] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 10:53:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:53:13] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-02 10:53:13] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-02 10:53:13] [INFO ] Invariant cache hit.
[2025-06-02 10:53:13] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:16] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:16] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:17] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:17] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/309 variables, 92/116 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 105/221 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 221 constraints, problems are : Problem set: 0 solved, 216 unsolved in 12384 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/309 variables, 92/116 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 105/221 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 216/437 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:36] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:40] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:53:43] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 440 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42576ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 42580ms
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 217/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43076 ms. Remains : 92/111 places, 217/289 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-00
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-00 finished in 43564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(!p0)) U p1)) U X(p1)))'
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 289/289 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 289
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 95 transition count 228
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 95 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 93 transition count 219
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 93 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 92 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 92 transition count 215
Applied a total of 37 rules in 20 ms. Remains 92 /111 variables (removed 19) and now considering 215/289 (removed 74) transitions.
// Phase 1: matrix 215 rows 92 cols
[2025-06-02 10:53:56] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:53:56] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 10:53:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:53:57] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-02 10:53:57] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 10:53:57] [INFO ] Invariant cache hit.
[2025-06-02 10:53:57] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:54:00] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:54:00] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/307 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 220 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12437 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/307 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 214/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 434 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21543 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34104ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 34107ms
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 215/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34513 ms. Remains : 92/111 places, 215/289 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-03
Stuttering criterion allowed to conclude after 136 steps with 10 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-03 finished in 34768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(!p1 U (p2||G(!p1)))&&F((G(F(p3))||(!p4&&F(p3)))))))'
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 289/289 transitions.
Graph (complete) has 702 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 95 transition count 239
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 95 transition count 239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 93 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 93 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 92 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 92 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 91 transition count 225
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 87 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 63 place count 87 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 65 place count 86 transition count 238
Applied a total of 65 rules in 45 ms. Remains 86 /111 variables (removed 25) and now considering 238/289 (removed 51) transitions.
// Phase 1: matrix 238 rows 86 cols
[2025-06-02 10:54:31] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:54:31] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 10:54:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:54:31] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-02 10:54:32] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:54:32] [INFO ] Redundant transitions in 21 ms returned []
Running 234 sub problems to find dead transitions.
[2025-06-02 10:54:32] [INFO ] Invariant cache hit.
[2025-06-02 10:54:32] [INFO ] State equation strengthened by 119 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:54:35] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:54:35] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:54:35] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 238/324 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 119/228 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 228 constraints, problems are : Problem set: 0 solved, 234 unsolved in 15477 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 238/324 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 119/228 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 234/462 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 462 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45606ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 45607ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/111 places, 238/289 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46126 ms. Remains : 86/111 places, 238/289 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p3) (AND p1 (NOT p2))), true, (NOT p0), (NOT p3)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-04 finished in 46298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)&&p0))&&F(p2))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 289/289 transitions.
Graph (complete) has 702 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 95 transition count 239
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 95 transition count 239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 93 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 93 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 92 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 92 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 91 transition count 225
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 87 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 87 transition count 240
Applied a total of 57 rules in 34 ms. Remains 87 /111 variables (removed 24) and now considering 240/289 (removed 49) transitions.
// Phase 1: matrix 240 rows 87 cols
[2025-06-02 10:55:17] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:55:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 10:55:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:55:18] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-02 10:55:18] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:55:18] [INFO ] Redundant transitions in 21 ms returned []
Running 236 sub problems to find dead transitions.
[2025-06-02 10:55:18] [INFO ] Invariant cache hit.
[2025-06-02 10:55:18] [INFO ] State equation strengthened by 119 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:55:22] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:55:22] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 240/327 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 119/228 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 228 constraints, problems are : Problem set: 0 solved, 236 unsolved in 15096 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 240/327 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 119/228 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 236/464 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 464 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45305ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 45307ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/111 places, 240/289 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45847 ms. Remains : 87/111 places, 240/289 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-06
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-06 finished in 46084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(p1))||F(p2))))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 289/289 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 289
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 97 transition count 239
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 97 transition count 239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 95 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 95 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 94 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 94 transition count 226
Applied a total of 32 rules in 6 ms. Remains 94 /111 variables (removed 17) and now considering 226/289 (removed 63) transitions.
// Phase 1: matrix 226 rows 94 cols
[2025-06-02 10:56:04] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:56:04] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-02 10:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:56:04] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 10:56:04] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 10:56:04] [INFO ] Invariant cache hit.
[2025-06-02 10:56:04] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:07] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:07] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:07] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:08] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:08] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/320 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 108/227 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 227 constraints, problems are : Problem set: 0 solved, 225 unsolved in 14967 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:21] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:22] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 226/320 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 225/454 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:36] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 455 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45110ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 45114ms
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 226/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45691 ms. Remains : 94/111 places, 226/289 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-13
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-13 finished in 46022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 289/289 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 289
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 94 transition count 228
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 94 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 92 transition count 219
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 92 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 91 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 91 transition count 215
Applied a total of 38 rules in 6 ms. Remains 91 /111 variables (removed 20) and now considering 215/289 (removed 74) transitions.
// Phase 1: matrix 215 rows 91 cols
[2025-06-02 10:56:50] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:56:50] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 10:56:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:56:50] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-02 10:56:50] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 10:56:50] [INFO ] Invariant cache hit.
[2025-06-02 10:56:50] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:54] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:56:54] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15153 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:57:13] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 433 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45289ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45291ms
Starting structural reductions in LTL mode, iteration 1 : 91/111 places, 215/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45759 ms. Remains : 91/111 places, 215/289 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-14
Product exploration explored 100000 steps with 7836 reset in 663 ms.
Product exploration explored 100000 steps with 7827 reset in 389 ms.
Computed a total of 12 stabilizing places and 92 stable transitions
Graph (complete) has 523 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 140 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3128 resets) in 490 ms. (81 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (109 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (605 resets) in 293 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (532 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
[2025-06-02 10:57:38] [INFO ] Invariant cache hit.
[2025-06-02 10:57:38] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/306 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 216 constraints, problems are : Problem set: 0 solved, 3 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/306 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 219 constraints, problems are : Problem set: 0 solved, 3 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 935ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 215/215 transitions.
Graph (complete) has 405 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 223
Free-agglomeration rule (complex) applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 48 place count 85 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 87 place count 68 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 68 transition count 348
Applied a total of 88 rules in 34 ms. Remains 68 /91 variables (removed 23) and now considering 348/215 (removed -133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 68/91 places, 348/215 transitions.
RANDOM walk for 37576 steps (4681 resets) in 350 ms. (107 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 8 factoid took 421 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-11-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-11-LTLFireability-14 finished in 49744 ms.
All properties solved by simple procedures.
Total runtime 338382 ms.

BK_STOP 1748861859827

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-11, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524100180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-11.tgz
mv MedleyA-PT-11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;