About the Execution of ITS-Tools for BusinessProcesses-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 295803.00 | 0.00 | 0.00 | TFTFFTTTTFFFTFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200027.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 BusinessProcesses-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 79K 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 BusinessProcesses-PT-04-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748546771186
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 19:26:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:26:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:26:14] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2025-05-29 19:26:14] [INFO ] Transformed 288 places.
[2025-05-29 19:26:14] [INFO ] Transformed 283 transitions.
[2025-05-29 19:26:14] [INFO ] Found NUPN structural information;
[2025-05-29 19:26:14] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 533 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 284 transition count 281
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 249 transition count 246
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 249 transition count 246
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 87 place count 234 transition count 231
Iterating global reduction 1 with 15 rules applied. Total rules applied 102 place count 234 transition count 231
Applied a total of 102 rules in 97 ms. Remains 234 /286 variables (removed 52) and now considering 231/281 (removed 50) transitions.
// Phase 1: matrix 231 rows 234 cols
[2025-05-29 19:26:14] [INFO ] Computed 42 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:15] [INFO ] Implicit Places using invariants in 642 ms returned []
[2025-05-29 19:26:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:15] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-05-29 19:26:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:24] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:24] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:24] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:25] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:25] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:25] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:25] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:26] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:26] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:26] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:27] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:27] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:27] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:27] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:27] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:28] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:28] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:28] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:28] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:28] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 27 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/62 constraints. Problems are: Problem set: 4 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:29] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:29] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:29] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:29] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:30] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:30] [INFO ] Deduced a trap composed of 52 places in 610 ms of which 433 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:31] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:31] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:31] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:31] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:32] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:32] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:32] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:32] [INFO ] Deduced a trap composed of 52 places in 200 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:32] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:33] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:33] [INFO ] Deduced a trap composed of 51 places in 392 ms of which 221 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:33] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:33] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:34] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 9 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 20/82 constraints. Problems are: Problem set: 29 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:34] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:35] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:35] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:35] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:36] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:36] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:36] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:36] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:37] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:37] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:37] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:37] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:37] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:38] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:38] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:38] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:38] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:38] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:38] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 23 ms to minimize.
Problem TDEAD216 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 20/102 constraints. Problems are: Problem set: 30 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:41] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:41] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:41] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:41] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:42] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:42] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:42] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:43] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:43] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:43] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:43] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:43] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:44] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:44] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:44] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:44] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:44] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:44] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:45] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:45] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 20/122 constraints. Problems are: Problem set: 34 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:46] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 33 ms to minimize.
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 34 solved, 196 unsolved
Search for dead transitions found 34 dead transitions in 30222ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 234/286 places, 197/281 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 197
Applied a total of 1 rules in 16 ms. Remains 233 /234 variables (removed 1) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 233 cols
[2025-05-29 19:26:46] [INFO ] Computed 46 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:46] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-05-29 19:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:47] [INFO ] Implicit Places using invariants and state equation in 561 ms returned [54, 56, 57, 180]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 853 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 229/286 places, 197/281 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32623 ms. Remains : 229/286 places, 197/281 transitions.
Support contains 25 out of 229 places after structural reductions.
[2025-05-29 19:26:47] [INFO ] Flatten gal took : 57 ms
[2025-05-29 19:26:47] [INFO ] Flatten gal took : 26 ms
[2025-05-29 19:26:47] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 22 out of 229 places (down from 25) after GAL structural reductions.
RANDOM walk for 40000 steps (446 resets) in 1340 ms. (29 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40003 steps (89 resets) in 365 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (90 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
// Phase 1: matrix 197 rows 229 cols
[2025-05-29 19:26:48] [INFO ] Computed 42 invariants in 7 ms
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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/156 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/222 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 192/414 variables, 222/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/420 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/426 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 271 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/156 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:48] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:48] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 6 (OVERLAPS) 66/222 variables, 22/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 414/426 variables, and 266 constraints, problems are : Problem set: 2 solved, 0 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 222/229 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 646ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 202 stabilizing places and 170 stable transitions
Graph (complete) has 480 edges and 229 vertex of which 227 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
FORMULA BusinessProcesses-PT-04-LTLCardinality-13 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Graph (trivial) has 101 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 223 vertex of which 221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 220 transition count 168
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 201 transition count 168
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 40 place count 201 transition count 120
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 142 place count 147 transition count 120
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 141 transition count 114
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 141 transition count 114
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 253 place count 89 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 255 place count 88 transition count 70
Applied a total of 255 rules in 113 ms. Remains 88 /229 variables (removed 141) and now considering 70/197 (removed 127) transitions.
// Phase 1: matrix 70 rows 88 cols
[2025-05-29 19:26:49] [INFO ] Computed 30 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:49] [INFO ] Implicit Places using invariants in 138 ms returned [1, 29, 30, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 141 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/229 places, 70/197 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 84/229 places, 70/197 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 8 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-01 finished in 758 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(G(!p0)))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 219 transition count 188
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 219 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 219 transition count 187
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 214 transition count 182
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 214 transition count 182
Applied a total of 30 rules in 33 ms. Remains 214 /229 variables (removed 15) and now considering 182/197 (removed 15) transitions.
// Phase 1: matrix 182 rows 214 cols
[2025-05-29 19:26:49] [INFO ] Computed 41 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:50] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-29 19:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:50] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-29 19:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:55] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:55] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:55] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:55] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:55] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:55] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:55] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:56] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:56] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:56] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:56] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:56] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:56] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:57] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:57] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:57] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:57] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:57] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:57] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:57] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:59] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:59] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:26:59] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:00] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:00] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:00] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:01] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:01] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:01] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:02] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:02] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD175 is UNSAT
At refinement iteration 7 (OVERLAPS) 182/396 variables, 214/286 constraints. Problems are: Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:09] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:10] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:10] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:10] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:10] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:10] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:11] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:11] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:12] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 9/295 constraints. Problems are: Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:12] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:13] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:15] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 3/298 constraints. Problems are: Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:20] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/396 variables, and 299 constraints, problems are : Problem set: 6 solved, 175 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 22/22 constraints. Problems are: Problem set: 6 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 19/41 constraints. Problems are: Problem set: 6 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 43/84 constraints. Problems are: Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:22] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/85 constraints. Problems are: Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:23] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:23] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:23] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:24] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:24] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 5/90 constraints. Problems are: Problem set: 6 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/90 constraints. Problems are: Problem set: 6 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 182/396 variables, 214/304 constraints. Problems are: Problem set: 6 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 175/479 constraints. Problems are: Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:28] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:29] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:29] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:30] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:30] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:32] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 6/485 constraints. Problems are: Problem set: 6 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:46] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 1/486 constraints. Problems are: Problem set: 6 solved, 175 unsolved
SMT process timed out in 60082ms, After SMT, problems are : Problem set: 6 solved, 175 unsolved
Search for dead transitions found 6 dead transitions in 60085ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 214/229 places, 176/197 transitions.
Applied a total of 0 rules in 11 ms. Remains 214 /214 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60783 ms. Remains : 214/229 places, 176/197 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-03 finished in 60934 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(X(F(p0))))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 220 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 220 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 220 transition count 188
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 215 transition count 183
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 215 transition count 183
Applied a total of 28 rules in 29 ms. Remains 215 /229 variables (removed 14) and now considering 183/197 (removed 14) transitions.
// Phase 1: matrix 183 rows 215 cols
[2025-05-29 19:27:50] [INFO ] Computed 41 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:51] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-29 19:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:51] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-05-29 19:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:54] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:55] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:56] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:56] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:56] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:56] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:56] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:56] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:56] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:57] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:57] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:57] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:57] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:59] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:59] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:59] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:59] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:01] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:01] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:01] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:03] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:03] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:03] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:03] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:04] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:05] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:07] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:09] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:09] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:09] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 31 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD176 is UNSAT
At refinement iteration 10 (OVERLAPS) 183/398 variables, 215/298 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:14] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:14] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:15] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:15] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:15] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 19 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 5/303 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:17] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:17] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:17] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:18] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 4/307 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:21] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:21] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/398 variables, and 309 constraints, problems are : Problem set: 6 solved, 176 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 6 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 19/41 constraints. Problems are: Problem set: 6 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 53/94 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:24] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:25] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 2/96 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:25] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:26] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 2/98 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:27] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/99 constraints. Problems are: Problem set: 6 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 6 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 183/398 variables, 215/314 constraints. Problems are: Problem set: 6 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 176/490 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:34] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:37] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:38] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 4/494 constraints. Problems are: Problem set: 6 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 494 constraints, problems are : Problem set: 6 solved, 176 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/182 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 6 solved, 176 unsolved
Search for dead transitions found 6 dead transitions in 60068ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 215/229 places, 177/197 transitions.
Applied a total of 0 rules in 11 ms. Remains 215 /215 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60834 ms. Remains : 215/229 places, 177/197 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 439 ms.
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Computed a total of 192 stabilizing places and 155 stable transitions
Graph (complete) has 452 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 192 stabilizing places and 155 stable transitions
Detected a total of 192/215 stabilizing places and 155/177 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-05 finished in 61757 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' '!(F(G(p0)))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Graph (trivial) has 106 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 223 vertex of which 221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 220 transition count 166
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 199 transition count 166
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 44 place count 199 transition count 118
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 101 rules applied. Total rules applied 145 place count 146 transition count 118
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 153 place count 138 transition count 110
Iterating global reduction 2 with 8 rules applied. Total rules applied 161 place count 138 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 138 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 137 transition count 109
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 260 place count 86 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 85 transition count 66
Applied a total of 262 rules in 57 ms. Remains 85 /229 variables (removed 144) and now considering 66/197 (removed 131) transitions.
// Phase 1: matrix 66 rows 85 cols
[2025-05-29 19:28:52] [INFO ] Computed 31 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:52] [INFO ] Implicit Places using invariants in 130 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/229 places, 66/197 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 84/229 places, 66/197 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-06
Product exploration explored 100000 steps with 11418 reset in 547 ms.
Product exploration explored 100000 steps with 11405 reset in 338 ms.
Computed a total of 77 stabilizing places and 59 stable transitions
Computed a total of 77 stabilizing places and 59 stable transitions
Detected a total of 77/84 stabilizing places and 59/66 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 259 steps (29 resets) in 8 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 84 cols
[2025-05-29 19:28:54] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-05-29 19:28:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-29 19:28:54] [INFO ] Implicit Places using invariants and state equation in 356 ms returned [2, 3, 6, 10, 11, 26, 27, 32, 33, 34, 42, 44, 50, 68, 70, 74, 76, 82]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 472 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/84 places, 66/66 transitions.
Graph (complete) has 198 edges and 66 vertex of which 55 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 54 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 53 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 53 transition count 58
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 49 transition count 54
Applied a total of 13 rules in 14 ms. Remains 49 /66 variables (removed 17) and now considering 54/66 (removed 12) transitions.
// Phase 1: matrix 54 rows 49 cols
[2025-05-29 19:28:54] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:54] [INFO ] Implicit Places using invariants in 89 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/84 places, 54/66 transitions.
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 2 place count 47 transition count 53
Applied a total of 2 rules in 8 ms. Remains 47 /48 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 47 cols
[2025-05-29 19:28:54] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-29 19:28:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-29 19:28:54] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 47/84 places, 53/66 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 834 ms. Remains : 47/84 places, 53/66 transitions.
Computed a total of 40 stabilizing places and 46 stable transitions
Computed a total of 40 stabilizing places and 46 stable transitions
Detected a total of 40/47 stabilizing places and 46/53 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 341 steps (45 resets) in 6 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12078 reset in 240 ms.
Product exploration explored 100000 steps with 12181 reset in 247 ms.
Built C files in :
/tmp/ltsmin1545998699655303194
[2025-05-29 19:28:55] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2025-05-29 19:28:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 19:28:55] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2025-05-29 19:28:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 19:28:55] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2025-05-29 19:28:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 19:28:55] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1545998699655303194
Running compilation step : cd /tmp/ltsmin1545998699655303194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin1545998699655303194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin1545998699655303194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10661478876793544888.hoa' '--buchi-type=spotba'
LTSmin run took 271 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLCardinality-06 finished in 4375 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(p0))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 220 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 220 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 220 transition count 188
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 216 transition count 184
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 216 transition count 184
Applied a total of 26 rules in 21 ms. Remains 216 /229 variables (removed 13) and now considering 184/197 (removed 13) transitions.
// Phase 1: matrix 184 rows 216 cols
[2025-05-29 19:28:56] [INFO ] Computed 41 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:57] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-05-29 19:28:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:57] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2025-05-29 19:28:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:01] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:01] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:02] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:03] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:03] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:03] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:03] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:03] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:04] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:04] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:04] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:04] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:04] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:07] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:07] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:07] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:07] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:07] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:07] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:08] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:08] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:08] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:08] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:08] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:08] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:09] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:09] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:09] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:09] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:10] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:10] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:11] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:11] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:12] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:12] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:12] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:13] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:16] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:18] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:19] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 32 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:23] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 29 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:24] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 29 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:26] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 30 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 11.0)
(s56 11.0)
(s57 1.0)
(s58 1.0)
(s59 11.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 2.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 2.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 216/400 variables, and 92 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/216 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 51/92 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:31] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:32] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 7 (OVERLAPS) 184/400 variables, 216/310 constraints. Problems are: Problem set: 6 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 177/487 constraints. Problems are: Problem set: 6 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:42] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:42] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:42] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:42] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:43] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:43] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:44] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:45] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 8/495 constraints. Problems are: Problem set: 6 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:50] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:50] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:51] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:52] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:52] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:55] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:55] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:57] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 503 constraints, problems are : Problem set: 6 solved, 177 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/183 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 6 solved, 177 unsolved
Search for dead transitions found 6 dead transitions in 60083ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/229 places, 178/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60843 ms. Remains : 216/229 places, 178/197 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Computed a total of 193 stabilizing places and 156 stable transitions
Graph (complete) has 453 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 193 stabilizing places and 156 stable transitions
Detected a total of 193/216 stabilizing places and 156/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-07 finished in 61751 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' '!(F(p0))'
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Graph (trivial) has 107 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 223 vertex of which 221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 220 transition count 165
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 198 transition count 165
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 46 place count 198 transition count 117
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 148 place count 144 transition count 117
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 156 place count 136 transition count 109
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 136 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 164 place count 136 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 135 transition count 108
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 262 place count 85 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 84 transition count 65
Applied a total of 264 rules in 29 ms. Remains 84 /229 variables (removed 145) and now considering 65/197 (removed 132) transitions.
// Phase 1: matrix 65 rows 84 cols
[2025-05-29 19:29:58] [INFO ] Computed 31 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:58] [INFO ] Implicit Places using invariants in 100 ms returned [1, 9, 27, 28, 29, 66]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 101 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/229 places, 65/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 78/229 places, 65/197 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-10 finished in 184 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' '!(F(p0))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Graph (trivial) has 107 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 223 vertex of which 221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 220 transition count 165
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 198 transition count 165
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 46 place count 198 transition count 117
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 148 place count 144 transition count 117
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 156 place count 136 transition count 109
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 136 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 164 place count 136 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 135 transition count 108
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 93 rules applied. Total rules applied 259 place count 87 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 261 place count 86 transition count 66
Applied a total of 261 rules in 22 ms. Remains 86 /229 variables (removed 143) and now considering 66/197 (removed 131) transitions.
// Phase 1: matrix 66 rows 86 cols
[2025-05-29 19:29:58] [INFO ] Computed 32 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:59] [INFO ] Implicit Places using invariants in 118 ms returned [1, 9, 23, 28, 29, 30, 68]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 119 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/229 places, 66/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 79/229 places, 66/197 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-11 finished in 189 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' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 197/197 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 221 transition count 190
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 221 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 221 transition count 189
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 217 transition count 185
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 217 transition count 185
Applied a total of 24 rules in 17 ms. Remains 217 /229 variables (removed 12) and now considering 185/197 (removed 12) transitions.
// Phase 1: matrix 185 rows 217 cols
[2025-05-29 19:29:59] [INFO ] Computed 41 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:59] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-29 19:29:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:59] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-05-29 19:29:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:12] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 15/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:12] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:14] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:14] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:14] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:15] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:15] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:15] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 8 (OVERLAPS) 185/402 variables, 217/302 constraints. Problems are: Problem set: 6 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:22] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:22] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:23] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:23] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:24] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 35 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 5/307 constraints. Problems are: Problem set: 6 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:29] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/308 constraints. Problems are: Problem set: 6 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/402 variables, and 308 constraints, problems are : Problem set: 6 solved, 178 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 22/22 constraints. Problems are: Problem set: 6 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 19/41 constraints. Problems are: Problem set: 6 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 50/91 constraints. Problems are: Problem set: 6 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:32] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:32] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:32] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:32] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:33] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:33] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:34] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 7/98 constraints. Problems are: Problem set: 6 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:34] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:35] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:35] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:35] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 4/102 constraints. Problems are: Problem set: 6 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/102 constraints. Problems are: Problem set: 6 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 185/402 variables, 217/319 constraints. Problems are: Problem set: 6 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 178/497 constraints. Problems are: Problem set: 6 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:41] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:43] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:44] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:46] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 20 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 4/501 constraints. Problems are: Problem set: 6 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:52] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 502 constraints, problems are : Problem set: 6 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/184 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 6 solved, 178 unsolved
Search for dead transitions found 6 dead transitions in 60052ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 217/229 places, 179/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 217 /217 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60880 ms. Remains : 217/229 places, 179/197 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-12
Product exploration explored 100000 steps with 1093 reset in 543 ms.
Product exploration explored 100000 steps with 1092 reset in 288 ms.
Computed a total of 194 stabilizing places and 157 stable transitions
Graph (complete) has 454 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 194 stabilizing places and 157 stable transitions
Detected a total of 194/217 stabilizing places and 157/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 202 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (431 resets) in 215 ms. (185 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (103 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
// Phase 1: matrix 179 rows 217 cols
[2025-05-29 19:31:01] [INFO ] Computed 47 invariants in 5 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/135 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/208 variables, 29/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/382 variables, 208/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/395 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/135 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:01] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:01] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:01] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:01] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 73/208 variables, 29/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:02] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:02] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:02] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 174/382 variables, 208/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:02] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:02] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 29 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/395 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1551ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 106 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 595 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 179/179 transitions.
Graph (trivial) has 88 edges and 217 vertex of which 6 / 217 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 447 edges and 212 vertex of which 211 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 210 transition count 158
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 197 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 195 transition count 156
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 32 place count 195 transition count 109
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 132 place count 142 transition count 109
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 105 rules applied. Total rules applied 237 place count 84 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 83 transition count 65
Applied a total of 239 rules in 31 ms. Remains 83 /217 variables (removed 134) and now considering 65/179 (removed 114) transitions.
// Phase 1: matrix 65 rows 83 cols
[2025-05-29 19:31:03] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:03] [INFO ] Implicit Places using invariants in 159 ms returned [1, 8, 19, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 161 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/217 places, 65/179 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 79 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 64
Applied a total of 2 rules in 6 ms. Remains 78 /79 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 78 cols
[2025-05-29 19:31:03] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:04] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-29 19:31:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-29 19:31:04] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [1, 7, 25, 27, 29, 33, 35, 37, 39, 43]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 413 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/217 places, 64/179 transitions.
Graph (complete) has 156 edges and 68 vertex of which 57 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 57 transition count 55
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 53 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 52 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 52 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 51 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 51 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 50 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 50 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 50 transition count 50
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 48 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 27 transition count 33
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 27 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 27 transition count 32
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 4 with 2 rules applied. Total rules applied 59 place count 26 transition count 31
Applied a total of 59 rules in 15 ms. Remains 26 /68 variables (removed 42) and now considering 31/64 (removed 33) transitions.
// Phase 1: matrix 31 rows 26 cols
[2025-05-29 19:31:04] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-29 19:31:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-29 19:31:04] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 26/217 places, 31/179 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 755 ms. Remains : 26/217 places, 31/179 transitions.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 72 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Detected a total of 16/26 stabilizing places and 22/31 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 300 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4285 steps (481 resets) in 20 ms. (204 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 586 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10242 reset in 205 ms.
Product exploration explored 100000 steps with 10312 reset in 230 ms.
Built C files in :
/tmp/ltsmin12401979568896997822
[2025-05-29 19:31:06] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2025-05-29 19:31:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 19:31:06] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2025-05-29 19:31:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 19:31:06] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2025-05-29 19:31:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 19:31:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12401979568896997822
Running compilation step : cd /tmp/ltsmin12401979568896997822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 231 ms.
Running link step : cd /tmp/ltsmin12401979568896997822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12401979568896997822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12331929466899256932.hoa' '--buchi-type=spotba'
LTSmin run took 419 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLCardinality-12 finished in 67877 ms.
All properties solved by simple procedures.
Total runtime 293362 ms.
BK_STOP 1748547066989
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="BusinessProcesses-PT-04"
export BK_EXAMINATION="LTLCardinality"
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 BusinessProcesses-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813200027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;