Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600475.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
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 r048-tajo-171620399600475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716333736070

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 202405141337
[2024-05-21 23:22:17] [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]
[2024-05-21 23:22:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:22:17] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-21 23:22:17] [INFO ] Transformed 288 places.
[2024-05-21 23:22:17] [INFO ] Transformed 283 transitions.
[2024-05-21 23:22:17] [INFO ] Found NUPN structural information;
[2024-05-21 23:22:17] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-04 FALSE 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-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 247 transition count 245
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 247 transition count 245
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 91 place count 231 transition count 229
Iterating global reduction 1 with 16 rules applied. Total rules applied 107 place count 231 transition count 229
Applied a total of 107 rules in 58 ms. Remains 231 /286 variables (removed 55) and now considering 229/281 (removed 52) transitions.
// Phase 1: matrix 229 rows 231 cols
[2024-05-21 23:22:17] [INFO ] Computed 41 invariants in 20 ms
[2024-05-21 23:22:18] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-21 23:22:18] [INFO ] Invariant cache hit.
[2024-05-21 23:22:18] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 23:22:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/231 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 15 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 20/61 constraints. Problems are: Problem set: 14 solved, 214 unsolved
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 6 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 3 ms to minimize.
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 20/81 constraints. Problems are: Problem set: 26 solved, 202 unsolved
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 3 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 4 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
Problem TDEAD175 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 20/101 constraints. Problems are: Problem set: 29 solved, 199 unsolved
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 20/121 constraints. Problems are: Problem set: 32 solved, 196 unsolved
[2024-05-21 23:22:29] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:22:29] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:22:29] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:29] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:29] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 20/141 constraints. Problems are: Problem set: 35 solved, 193 unsolved
[2024-05-21 23:22:32] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:32] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:22:32] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:22:32] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:32] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 20/161 constraints. Problems are: Problem set: 37 solved, 191 unsolved
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 20/181 constraints. Problems are: Problem set: 39 solved, 189 unsolved
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 7/188 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:22:41] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:22:41] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 4/192 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 3 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 17/209 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 231/460 variables, and 214 constraints, problems are : Problem set: 40 solved, 188 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/231 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 173/173 constraints]
Escalating to Integer solving :Problem set: 40 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 22/22 constraints. Problems are: Problem set: 40 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/22 constraints. Problems are: Problem set: 40 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/231 variables, 19/41 constraints. Problems are: Problem set: 40 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 173/214 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 19/233 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 5/238 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 2/240 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 2/242 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 6/248 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 3/251 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 1/252 constraints. Problems are: Problem set: 40 solved, 188 unsolved
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
SMT process timed out in 60198ms, After SMT, problems are : Problem set: 40 solved, 188 unsolved
Search for dead transitions found 40 dead transitions in 60216ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 231/286 places, 189/281 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 226 transition count 189
Applied a total of 5 rules in 9 ms. Remains 226 /231 variables (removed 5) and now considering 189/189 (removed 0) transitions.
// Phase 1: matrix 189 rows 226 cols
[2024-05-21 23:23:18] [INFO ] Computed 47 invariants in 3 ms
[2024-05-21 23:23:18] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 23:23:18] [INFO ] Invariant cache hit.
[2024-05-21 23:23:18] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 226/286 places, 189/281 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61163 ms. Remains : 226/286 places, 189/281 transitions.
Support contains 27 out of 226 places after structural reductions.
[2024-05-21 23:23:19] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:23:19] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:23:19] [INFO ] Input system was already deterministic with 189 transitions.
RANDOM walk for 40000 steps (439 resets) in 761 ms. (52 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (83 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
[2024-05-21 23:23:19] [INFO ] Invariant cache hit.
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) 68/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/143 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/216 variables, 29/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 182/398 variables, 216/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/409 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/415 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/415 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/143 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 8 places in 744 ms of which 1 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:20] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 216/415 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/226 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1193ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 201 stabilizing places and 164 stable transitions
Graph (complete) has 464 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(X(X(p1))||(!p2 U (p3||G(!p2)))))))'
Support contains 8 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 189/189 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 219 transition count 182
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 219 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 219 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 217 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 217 transition count 179
Applied a total of 19 rules in 11 ms. Remains 217 /226 variables (removed 9) and now considering 179/189 (removed 10) transitions.
// Phase 1: matrix 179 rows 217 cols
[2024-05-21 23:23:21] [INFO ] Computed 47 invariants in 5 ms
[2024-05-21 23:23:21] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 23:23:21] [INFO ] Invariant cache hit.
[2024-05-21 23:23:21] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-21 23:23:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 4 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:34] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:23:34] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:23:34] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:23:34] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:34] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:43] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:23:43] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 20 (OVERLAPS) 179/396 variables, 217/373 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:45] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:45] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:45] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 6/379 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 23 (OVERLAPS) 0/396 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 379 constraints, problems are : Problem set: 0 solved, 178 unsolved in 27957 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 115/162 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 179/396 variables, 217/392 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 178/570 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 577 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 135/135 constraints]
After SMT, in 58028ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 58031ms
Starting structural reductions in LTL mode, iteration 1 : 217/226 places, 179/189 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58524 ms. Remains : 217/226 places, 179/189 transitions.
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 254 ms.
Product exploration explored 100000 steps with 33333 reset in 219 ms.
Computed a total of 193 stabilizing places and 156 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.16 ms
Computed a total of 193 stabilizing places and 156 stable transitions
Detected a total of 193/217 stabilizing places and 156/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p2 p1), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (AND (NOT p3) p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 22 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-03 finished in 59704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 189/189 transitions.
Graph (trivial) has 104 edges and 226 vertex of which 7 / 226 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 456 edges and 220 vertex of which 219 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 218 transition count 159
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 198 transition count 159
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 42 place count 198 transition count 110
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 146 place count 143 transition count 110
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 153 place count 136 transition count 103
Iterating global reduction 2 with 7 rules applied. Total rules applied 160 place count 136 transition count 103
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 257 place count 83 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 261 place count 81 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 80 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 263 place count 79 transition count 60
Applied a total of 263 rules in 73 ms. Remains 79 /226 variables (removed 147) and now considering 60/189 (removed 129) transitions.
// Phase 1: matrix 60 rows 79 cols
[2024-05-21 23:24:20] [INFO ] Computed 31 invariants in 6 ms
[2024-05-21 23:24:20] [INFO ] Implicit Places using invariants in 124 ms returned [23, 67, 69]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 126 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/226 places, 60/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 76/226 places, 60/189 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-05 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 189/189 transitions.
Graph (trivial) has 103 edges and 226 vertex of which 7 / 226 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 456 edges and 220 vertex of which 219 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 218 transition count 159
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 198 transition count 159
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 42 place count 198 transition count 112
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 142 place count 145 transition count 112
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 149 place count 138 transition count 105
Iterating global reduction 2 with 7 rules applied. Total rules applied 156 place count 138 transition count 105
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 107 rules applied. Total rules applied 263 place count 79 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 267 place count 77 transition count 59
Applied a total of 267 rules in 42 ms. Remains 77 /226 variables (removed 149) and now considering 59/189 (removed 130) transitions.
// Phase 1: matrix 59 rows 77 cols
[2024-05-21 23:24:21] [INFO ] Computed 30 invariants in 1 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 103 ms returned [1, 7, 19, 20, 21]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 118 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/226 places, 59/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 72/226 places, 59/189 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-07
Stuttering criterion allowed to conclude after 1203 steps with 137 reset in 12 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-07 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 189/189 transitions.
Graph (trivial) has 99 edges and 226 vertex of which 7 / 226 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 456 edges and 220 vertex of which 219 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 218 transition count 161
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 200 transition count 161
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 38 place count 200 transition count 114
Deduced a syphon composed of 47 places in 0 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 137 place count 148 transition count 114
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 142 transition count 108
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 142 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 11 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 103 rules applied. Total rules applied 252 place count 85 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 83 transition count 64
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 258 place count 83 transition count 64
Applied a total of 258 rules in 31 ms. Remains 83 /226 variables (removed 143) and now considering 64/189 (removed 125) transitions.
// Phase 1: matrix 64 rows 83 cols
[2024-05-21 23:24:21] [INFO ] Computed 31 invariants in 0 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 85 ms returned [1, 7, 18, 19, 20, 21]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 89 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/226 places, 64/189 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 77 transition count 63
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 76 transition count 63
Applied a total of 2 rules in 5 ms. Remains 76 /77 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 76 cols
[2024-05-21 23:24:21] [INFO ] Computed 25 invariants in 0 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 23:24:21] [INFO ] Invariant cache hit.
[2024-05-21 23:24:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [1, 6, 19, 20, 22, 24, 28, 30, 32, 34, 36]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 168 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/226 places, 63/189 transitions.
Graph (complete) has 146 edges and 65 vertex of which 54 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 54 transition count 53
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 49 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 48 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 48 transition count 51
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 38 place count 33 transition count 41
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 30 transition count 38
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 30 transition count 38
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 2 with 2 rules applied. Total rules applied 46 place count 29 transition count 37
Applied a total of 46 rules in 10 ms. Remains 29 /65 variables (removed 36) and now considering 37/63 (removed 26) transitions.
// Phase 1: matrix 37 rows 29 cols
[2024-05-21 23:24:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 36 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 28/226 places, 37/189 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 27 transition count 36
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 27 cols
[2024-05-21 23:24:21] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 23:24:21] [INFO ] Invariant cache hit.
[2024-05-21 23:24:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 27/226 places, 36/189 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 451 ms. Remains : 27/226 places, 36/189 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-08 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 189/189 transitions.
Graph (trivial) has 103 edges and 226 vertex of which 7 / 226 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 456 edges and 220 vertex of which 219 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 219 transition count 160
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 199 transition count 160
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 42 place count 199 transition count 111
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 146 place count 144 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 138 transition count 105
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 138 transition count 105
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 105 rules applied. Total rules applied 263 place count 81 transition count 57
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 265 place count 80 transition count 60
Applied a total of 265 rules in 13 ms. Remains 80 /226 variables (removed 146) and now considering 60/189 (removed 129) transitions.
// Phase 1: matrix 60 rows 80 cols
[2024-05-21 23:24:21] [INFO ] Computed 32 invariants in 1 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 56 ms returned [1, 7, 21, 22, 23, 72, 74]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/226 places, 60/189 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 73/226 places, 60/189 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-11
Product exploration explored 100000 steps with 9685 reset in 184 ms.
Product exploration explored 100000 steps with 9703 reset in 197 ms.
Computed a total of 66 stabilizing places and 53 stable transitions
Computed a total of 66 stabilizing places and 53 stable transitions
Detected a total of 66/73 stabilizing places and 53/60 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 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 202 steps (19 resets) in 8 ms. (22 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 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 73 cols
[2024-05-21 23:24:22] [INFO ] Computed 25 invariants in 0 ms
[2024-05-21 23:24:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 23:24:22] [INFO ] Invariant cache hit.
[2024-05-21 23:24:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 23:24:22] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [1, 6, 20, 21, 22, 24, 26, 30, 32, 34, 36, 38]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 147 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/73 places, 60/60 transitions.
Graph (complete) has 141 edges and 61 vertex of which 50 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 50 transition count 46
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 41 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 39 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 39 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 39 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 38 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 38 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 38 transition count 40
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 52 place count 23 transition count 30
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 55 place count 20 transition count 27
Iterating global reduction 4 with 3 rules applied. Total rules applied 58 place count 20 transition count 27
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 60 place count 19 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 19 transition count 25
Applied a total of 61 rules in 8 ms. Remains 19 /61 variables (removed 42) and now considering 25/60 (removed 35) transitions.
// Phase 1: matrix 25 rows 19 cols
[2024-05-21 23:24:22] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 23:24:22] [INFO ] Implicit Places using invariants in 17 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/73 places, 25/60 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 17 transition count 24
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 17 cols
[2024-05-21 23:24:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 23:24:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 23:24:22] [INFO ] Invariant cache hit.
[2024-05-21 23:24:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-21 23:24:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 17/73 places, 24/60 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 229 ms. Remains : 17/73 places, 24/60 transitions.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Detected a total of 10/17 stabilizing places and 17/24 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 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 422 steps (54 resets) in 4 ms. (84 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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12039 reset in 113 ms.
Product exploration explored 100000 steps with 12177 reset in 73 ms.
Built C files in :
/tmp/ltsmin11746179302528316615
[2024-05-21 23:24:23] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2024-05-21 23:24:23] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:23] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2024-05-21 23:24:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:23] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2024-05-21 23:24:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11746179302528316615
Running compilation step : cd /tmp/ltsmin11746179302528316615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 330 ms.
Running link step : cd /tmp/ltsmin11746179302528316615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11746179302528316615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13011481829867088155.hoa' '--buchi-type=spotba'
LTSmin run took 115 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLCardinality-11 finished in 2288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 189/189 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 220 transition count 183
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 220 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 220 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 217 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 217 transition count 179
Applied a total of 19 rules in 9 ms. Remains 217 /226 variables (removed 9) and now considering 179/189 (removed 10) transitions.
// Phase 1: matrix 179 rows 217 cols
[2024-05-21 23:24:24] [INFO ] Computed 47 invariants in 1 ms
[2024-05-21 23:24:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 23:24:24] [INFO ] Invariant cache hit.
[2024-05-21 23:24:24] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-21 23:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 17/84 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (OVERLAPS) 179/396 variables, 217/353 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 9/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/396 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 19 (OVERLAPS) 0/396 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 362 constraints, problems are : Problem set: 0 solved, 178 unsolved in 24138 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 98/145 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 179/396 variables, 217/368 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 178/546 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/396 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (OVERLAPS) 0/396 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 547 constraints, problems are : Problem set: 0 solved, 178 unsolved in 28886 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 105/105 constraints]
After SMT, in 53069ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 53074ms
Starting structural reductions in LTL mode, iteration 1 : 217/226 places, 179/189 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53403 ms. Remains : 217/226 places, 179/189 transitions.
Stuttering acceptance computed with spot in 111 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 1103 reset in 285 ms.
Product exploration explored 100000 steps with 1101 reset in 171 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.1 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (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 259 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 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (425 resets) in 457 ms. (87 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (97 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
[2024-05-21 23:25:18] [INFO ] Invariant cache hit.
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 212 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]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 73/208 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 174/382 variables, 208/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/395 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/396 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/396 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 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: 3/3 constraints]
After SMT, in 578ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 396 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=198 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 485 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 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 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 22 ms. Remains 83 /217 variables (removed 134) and now considering 65/179 (removed 114) transitions.
// Phase 1: matrix 65 rows 83 cols
[2024-05-21 23:25:19] [INFO ] Computed 30 invariants in 0 ms
[2024-05-21 23:25:20] [INFO ] Implicit Places using invariants in 96 ms returned [1, 7, 18, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 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 16 ms. Remains 78 /79 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 78 cols
[2024-05-21 23:25:20] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 23:25:20] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-21 23:25:20] [INFO ] Invariant cache hit.
[2024-05-21 23:25:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:25:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [1, 6, 24, 26, 28, 32, 34, 36, 38, 42]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 542 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 6 ms. Remains 26 /68 variables (removed 42) and now considering 31/64 (removed 33) transitions.
// Phase 1: matrix 31 rows 26 cols
[2024-05-21 23:25:20] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 23:25:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 23:25:20] [INFO ] Invariant cache hit.
[2024-05-21 23:25:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:25:20] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 105 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 800 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 157 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 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9157 steps (1108 resets) in 40 ms. (223 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 420 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 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10292 reset in 119 ms.
Product exploration explored 100000 steps with 10364 reset in 158 ms.
Built C files in :
/tmp/ltsmin649371069694507239
[2024-05-21 23:25:21] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2024-05-21 23:25:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:21] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2024-05-21 23:25:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:21] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2024-05-21 23:25:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin649371069694507239
Running compilation step : cd /tmp/ltsmin649371069694507239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin649371069694507239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin649371069694507239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13473420920315225567.hoa' '--buchi-type=spotba'
LTSmin run took 449 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 58459 ms.
All properties solved by simple procedures.
Total runtime 185130 ms.

BK_STOP 1716333922597

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-5568"
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 r048-tajo-171620399600475"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;