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.r047-tajo-171620398300483.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 greatspnxred
Input is BusinessProcesses-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 85K 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-05-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716303452965

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:57:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:57:34] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-21 14:57:34] [INFO ] Transformed 368 places.
[2024-05-21 14:57:34] [INFO ] Transformed 319 transitions.
[2024-05-21 14:57:34] [INFO ] Found NUPN structural information;
[2024-05-21 14:57:34] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 217 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 4 formulas.
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 60 place count 307 transition count 260
Iterating global reduction 1 with 58 rules applied. Total rules applied 118 place count 307 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 119 place count 307 transition count 259
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 147 place count 279 transition count 231
Iterating global reduction 2 with 28 rules applied. Total rules applied 175 place count 279 transition count 231
Applied a total of 175 rules in 87 ms. Remains 279 /367 variables (removed 88) and now considering 231/318 (removed 87) transitions.
// Phase 1: matrix 231 rows 279 cols
[2024-05-21 14:57:34] [INFO ] Computed 55 invariants in 27 ms
[2024-05-21 14:57:35] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 14:57:35] [INFO ] Invariant cache hit.
[2024-05-21 14:57:35] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-21 14:57:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 9 places in 1161 ms of which 49 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 27 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-21 14:57:42] [INFO ] Deduced a trap composed of 15 places in 3224 ms of which 42 ms to minimize.
[2024-05-21 14:57:43] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2024-05-21 14:57:43] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 3 ms to minimize.
[2024-05-21 14:57:43] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-21 14:57:43] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 14 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 29 places in 1833 ms of which 16 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-21 14:57:46] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-05-21 14:57:46] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-21 14:57:46] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-21 14:57:46] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:57:47] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-21 14:57:47] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-21 14:57:47] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-21 14:57:47] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:57:48] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:57:53] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:57:53] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:57:56] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 231/510 variables, 279/388 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 3 ms to minimize.
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 10/398 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 398 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 64/119 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:58:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:58:07] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 231/510 variables, 279/400 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 230/630 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:58:10] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:58:11] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2024-05-21 14:58:14] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:58:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:58:14] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-05-21 14:58:15] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 6 ms to minimize.
[2024-05-21 14:58:15] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 10/640 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:58:18] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-21 14:58:20] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-21 14:58:20] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 14:58:20] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:58:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:58:20] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:58:20] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:58:22] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:58:22] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:58:23] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 3 ms to minimize.
[2024-05-21 14:58:23] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 3 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 2 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 20/660 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 3 ms to minimize.
[2024-05-21 14:58:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:58:32] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:58:32] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 664 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 100/100 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 279/367 places, 231/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60799 ms. Remains : 279/367 places, 231/318 transitions.
Support contains 15 out of 279 places after structural reductions.
[2024-05-21 14:58:35] [INFO ] Flatten gal took : 59 ms
[2024-05-21 14:58:35] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:58:35] [INFO ] Input system was already deterministic with 231 transitions.
RANDOM walk for 40000 steps (371 resets) in 1400 ms. (28 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (73 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
[2024-05-21 14:58:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 229/267 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 218/485 variables, 267/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/504 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/510 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/510 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 334 constraints, problems are : Problem set: 0 solved, 2 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 229/267 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:58:36] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:58:37] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:58:37] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:58:37] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:58:37] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 218/485 variables, 267/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:58:37] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (OVERLAPS) 19/504 variables, 8/338 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 14:58:37] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:58:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 2/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/510 variables, 4/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/510 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 344 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 1383ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 156 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 273 stabilizing places and 223 stable transitions
Graph (complete) has 598 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 271 transition count 223
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 267 transition count 219
Applied a total of 24 rules in 28 ms. Remains 267 /279 variables (removed 12) and now considering 219/231 (removed 12) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-21 14:58:38] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 14:58:38] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-21 14:58:38] [INFO ] Invariant cache hit.
[2024-05-21 14:58:38] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 14:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 14:58:40] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 3 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:58:41] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 14:58:42] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-21 14:58:42] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-21 14:58:42] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 14:58:42] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-21 14:58:42] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-21 14:58:42] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 14:58:43] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-21 14:58:43] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:58:43] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 14:58:43] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-21 14:58:44] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:58:44] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:58:44] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 3 ms to minimize.
[2024-05-21 14:58:44] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-21 14:58:44] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:58:44] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 14:58:47] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-21 14:58:47] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-21 14:58:47] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-21 14:58:47] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:58:47] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:58:48] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 3 ms to minimize.
[2024-05-21 14:58:48] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 356 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14839 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 3 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:58:55] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-21 14:58:56] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:58:56] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 14:58:58] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:58:59] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:58:59] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:58:59] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:58:59] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2024-05-21 14:58:59] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:58:59] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 14:59:00] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-21 14:59:00] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-21 14:59:00] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:59:00] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
[2024-05-21 14:59:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
[2024-05-21 14:59:02] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 13/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 14:59:17] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/486 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 14:59:22] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:59:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 601 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 61/61 constraints]
After SMT, in 44946ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 44953ms
Starting structural reductions in LTL mode, iteration 1 : 267/279 places, 219/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45503 ms. Remains : 267/279 places, 219/231 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-01 finished in 45822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 272 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 268 transition count 220
Applied a total of 22 rules in 16 ms. Remains 268 /279 variables (removed 11) and now considering 220/231 (removed 11) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-21 14:59:23] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 14:59:24] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 14:59:24] [INFO ] Invariant cache hit.
[2024-05-21 14:59:24] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 14:59:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 14:59:26] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-21 14:59:26] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-05-21 14:59:27] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 14:59:28] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-05-21 14:59:28] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:59:28] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-21 14:59:28] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:59:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 14:59:28] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-21 14:59:29] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 14:59:29] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-21 14:59:29] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:59:30] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:59:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:59:30] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-21 14:59:30] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 14:59:32] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:59:32] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-21 14:59:32] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-21 14:59:32] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-21 14:59:32] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/488 variables, 268/354 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 14:59:36] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 3 ms to minimize.
[2024-05-21 14:59:36] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-21 14:59:36] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-21 14:59:36] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:59:37] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-05-21 14:59:37] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:59:37] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 14:59:38] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:59:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/488 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 363 constraints, problems are : Problem set: 0 solved, 219 unsolved in 29158 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 14:59:55] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:59:55] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:59:55] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:59:55] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:59:55] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2024-05-21 14:59:55] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:59:55] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:59:56] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/371 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 219/590 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 14:59:58] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:59:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:59:59] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:00:00] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:00:00] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:00:00] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 3 ms to minimize.
[2024-05-21 15:00:00] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:00:00] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:00:01] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:00:01] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:00:01] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:00:01] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:00:01] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:00:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 14/604 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:06] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
[2024-05-21 15:00:07] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:14] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:19] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:00:19] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:00:20] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:00:20] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:00:20] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 5/612 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 612 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 70/70 constraints]
After SMT, in 59234ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 59236ms
Starting structural reductions in LTL mode, iteration 1 : 268/279 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59788 ms. Remains : 268/279 places, 220/231 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-02 finished in 59887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 272 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 268 transition count 220
Applied a total of 22 rules in 19 ms. Remains 268 /279 variables (removed 11) and now considering 220/231 (removed 11) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-21 15:00:23] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 15:00:24] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-21 15:00:24] [INFO ] Invariant cache hit.
[2024-05-21 15:00:24] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 15:00:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 3 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/350 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:00:32] [INFO ] Deduced a trap composed of 69 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:00:32] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:34] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:00:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:00:34] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/488 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 361 constraints, problems are : Problem set: 0 solved, 219 unsolved in 17997 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:43] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:00:44] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:00:45] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:00:45] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 15/108 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/376 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 219/595 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:00:48] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:00:48] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:00:49] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:00:50] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:00:51] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:00:51] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 7/602 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:00:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:00:54] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:00:54] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-21 15:00:55] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:00:56] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:00:57] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 6/608 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/488 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 608 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 66/66 constraints]
After SMT, in 48052ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 48055ms
Starting structural reductions in LTL mode, iteration 1 : 268/279 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48535 ms. Remains : 268/279 places, 220/231 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-04 finished in 48706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||G(p1))))))'
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 274 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 274 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 272 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 272 transition count 224
Applied a total of 14 rules in 13 ms. Remains 272 /279 variables (removed 7) and now considering 224/231 (removed 7) transitions.
// Phase 1: matrix 224 rows 272 cols
[2024-05-21 15:01:12] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 15:01:12] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 15:01:12] [INFO ] Invariant cache hit.
[2024-05-21 15:01:12] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-21 15:01:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:14] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:01:14] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:01:15] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 224/496 variables, 272/364 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 372 constraints, problems are : Problem set: 0 solved, 223 unsolved in 18856 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/378 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 223/601 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:01:39] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 8/609 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 1 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:01:59] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:02:01] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 624 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 74/74 constraints]
After SMT, in 48946ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 48949ms
Starting structural reductions in LTL mode, iteration 1 : 272/279 places, 224/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49334 ms. Remains : 272/279 places, 224/231 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-06
Product exploration explored 100000 steps with 924 reset in 350 ms.
Product exploration explored 100000 steps with 923 reset in 343 ms.
Computed a total of 266 stabilizing places and 216 stable transitions
Graph (complete) has 585 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Computed a total of 266 stabilizing places and 216 stable transitions
Detected a total of 266/272 stabilizing places and 216/224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (366 resets) in 227 ms. (175 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (69 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
[2024-05-21 15:02:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 228/263 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 214/477 variables, 263/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/491 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/496 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/496 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 228/263 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/477 variables, 263/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/491 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/496 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/496 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 224/224 transitions.
Graph (trivial) has 135 edges and 272 vertex of which 6 / 272 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 573 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 266 transition count 186
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 237 transition count 186
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 60 place count 237 transition count 132
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 181 place count 170 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 169 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 169 transition count 131
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 351 place count 84 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 83 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 82 transition count 47
Applied a total of 353 rules in 39 ms. Remains 82 /272 variables (removed 190) and now considering 47/224 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 82/272 places, 47/224 transitions.
RANDOM walk for 478 steps (18 resets) in 9 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 224/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-21 15:02:04] [INFO ] Invariant cache hit.
[2024-05-21 15:02:05] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 15:02:05] [INFO ] Invariant cache hit.
[2024-05-21 15:02:05] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-21 15:02:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:02:07] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:09] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:02:09] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:02:09] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:02:09] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:02:09] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:02:10] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:02:10] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:02:10] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:02:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:02:10] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:02:10] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:12] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:13] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:02:13] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:02:13] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:02:13] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:02:13] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 224/496 variables, 272/364 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:02:17] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:18] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:02:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 372 constraints, problems are : Problem set: 0 solved, 223 unsolved in 18226 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:24] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:02:24] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:02:25] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:02:25] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:02:25] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:02:25] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/378 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 223/601 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:29] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:02:29] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:02:30] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-05-21 15:02:30] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:02:30] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:02:31] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:02:31] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:02:32] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 8/609 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:34] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:02:34] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:02:35] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:02:36] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:02:37] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:02:37] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:02:37] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:02:38] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:02:38] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:02:39] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:42] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:02:45] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:02:47] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:02:51] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:02:53] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 624 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 74/74 constraints]
After SMT, in 48282ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 48286ms
Finished structural reductions in LTL mode , in 1 iterations and 48559 ms. Remains : 272/272 places, 224/224 transitions.
Computed a total of 266 stabilizing places and 216 stable transitions
Graph (complete) has 585 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 266 stabilizing places and 216 stable transitions
Detected a total of 266/272 stabilizing places and 216/224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (380 resets) in 380 ms. (104 steps per ms) remains 1/2 properties
BEST_FIRST walk for 36853 steps (66 resets) in 158 ms. (231 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 942 reset in 147 ms.
Product exploration explored 100000 steps with 929 reset in 191 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 224/224 transitions.
Graph (trivial) has 133 edges and 272 vertex of which 6 / 272 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 578 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 266 transition count 217
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 30 place count 266 transition count 252
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 69 place count 266 transition count 252
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 257 transition count 235
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 257 transition count 235
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 185 place count 257 transition count 235
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 205 place count 237 transition count 215
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 225 place count 237 transition count 215
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 225 rules in 47 ms. Remains 237 /272 variables (removed 35) and now considering 215/224 (removed 9) transitions.
[2024-05-21 15:02:55] [INFO ] Redundant transitions in 26 ms returned []
Running 214 sub problems to find dead transitions.
// Phase 1: matrix 215 rows 237 cols
[2024-05-21 15:02:55] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 15:02:55] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 15:02:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:02:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:02:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/75 constraints. Problems are: Problem set: 74 solved, 140 unsolved
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 15:02:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/95 constraints. Problems are: Problem set: 132 solved, 82 unsolved
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD154 is UNSAT
[2024-05-21 15:02:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 15/110 constraints. Problems are: Problem set: 162 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/110 constraints. Problems are: Problem set: 162 solved, 52 unsolved
Problem TDEAD73 is UNSAT
At refinement iteration 6 (OVERLAPS) 214/451 variables, 237/347 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 5/352 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/352 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 1/452 variables, 1/353 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/353 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/353 constraints. Problems are: Problem set: 163 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 353 constraints, problems are : Problem set: 163 solved, 51 unsolved in 5893 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 237/237 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 163 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 136/236 variables, 55/55 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 55/110 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 214/450 variables, 236/346 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 5/351 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 51/402 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/402 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 1/451 variables, 1/403 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/403 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 1/452 variables, 1/404 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/404 constraints. Problems are: Problem set: 163 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 0/452 variables, 0/404 constraints. Problems are: Problem set: 163 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 404 constraints, problems are : Problem set: 163 solved, 51 unsolved in 5402 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 237/237 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 51/214 constraints, Known Traps: 55/55 constraints]
After SMT, in 11413ms problems are : Problem set: 163 solved, 51 unsolved
Search for dead transitions found 163 dead transitions in 11421ms
Found 163 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 163 transitions
Dead transitions reduction (with SMT) removed 163 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 237/272 places, 52/224 transitions.
Graph (complete) has 404 edges and 237 vertex of which 101 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 0 output transitions
Ensure Unique test removed 14 places
Applied a total of 1 rules in 5 ms. Remains 87 /237 variables (removed 150) and now considering 52/52 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/272 places, 52/224 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11506 ms. Remains : 87/272 places, 52/224 transitions.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 272 cols
[2024-05-21 15:03:06] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 15:03:06] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 15:03:06] [INFO ] Invariant cache hit.
[2024-05-21 15:03:07] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-21 15:03:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:03:09] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:03:10] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:03:11] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:03:11] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:11] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:03:12] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:14] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:16] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:03:16] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:03:16] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:03:16] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:03:16] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 224/496 variables, 272/364 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:19] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:03:19] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:03:19] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:03:19] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:03:20] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:03:20] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:21] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:03:21] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 372 constraints, problems are : Problem set: 0 solved, 223 unsolved in 20127 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:29] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:03:29] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:03:29] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:03:29] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:03:29] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:03:29] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/378 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 223/601 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:33] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-21 15:03:33] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:03:33] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:03:33] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:03:34] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:03:34] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:03:34] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:03:35] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 8/609 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:37] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:03:37] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:03:38] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:03:39] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:03:40] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:03:40] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:03:40] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:03:41] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-21 15:03:41] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:03:42] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:45] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:03:48] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:03:49] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 15:03:53] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:03:55] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 624 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 74/74 constraints]
After SMT, in 50198ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 50200ms
Finished structural reductions in LTL mode , in 1 iterations and 50606 ms. Remains : 272/272 places, 224/224 transitions.
Treatment of property BusinessProcesses-PT-05-LTLCardinality-06 finished in 164986 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 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Graph (trivial) has 142 edges and 279 vertex of which 6 / 279 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 591 edges and 274 vertex of which 273 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 272 transition count 192
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 241 transition count 192
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 64 place count 241 transition count 136
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 189 place count 172 transition count 136
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 166 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 166 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 201 place count 166 transition count 129
Deduced a syphon composed of 1 places in 13 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 204 place count 164 transition count 129
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 364 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 81 transition count 49
Applied a total of 366 rules in 55 ms. Remains 81 /279 variables (removed 198) and now considering 49/231 (removed 182) transitions.
// Phase 1: matrix 49 rows 81 cols
[2024-05-21 15:03:57] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 15:03:57] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 15:03:57] [INFO ] Invariant cache hit.
[2024-05-21 15:03:57] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 334 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/279 places, 49/231 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 43 transition count 41
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 35 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 30 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 30 transition count 36
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 30 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 27 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 27 transition count 33
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 42 place count 22 transition count 28
Applied a total of 42 rules in 9 ms. Remains 22 /43 variables (removed 21) and now considering 28/49 (removed 21) transitions.
// Phase 1: matrix 28 rows 22 cols
[2024-05-21 15:03:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:03:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 15:03:57] [INFO ] Invariant cache hit.
[2024-05-21 15:03:58] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/279 places, 28/231 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 498 ms. Remains : 22/279 places, 28/231 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-10 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(X(G(p1)))))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 271 transition count 223
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 267 transition count 219
Applied a total of 24 rules in 22 ms. Remains 267 /279 variables (removed 12) and now considering 219/231 (removed 12) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-21 15:03:58] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 15:03:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 15:03:58] [INFO ] Invariant cache hit.
[2024-05-21 15:03:58] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 15:03:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:04:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:04:01] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:04:02] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:04:02] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:04:02] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:04:03] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:04:03] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:04:03] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:04:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:04:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:04:05] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:04:05] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:04:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:04:06] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:04:06] [INFO ] Deduced a trap composed of 68 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:04:06] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:04:06] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 356 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13321 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:04:13] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:04:14] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:04:14] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:04:14] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:04:16] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:04:17] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:04:17] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:04:17] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:04:17] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:04:17] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:04:17] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:04:18] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:04:18] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:04:18] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:04:18] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-21 15:04:18] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:04:19] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 13/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:04:31] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/486 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:04:37] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:04:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 601 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 61/61 constraints]
After SMT, in 43370ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 43373ms
Starting structural reductions in LTL mode, iteration 1 : 267/279 places, 219/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43717 ms. Remains : 267/279 places, 219/231 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-12 finished in 44005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-05-LTLCardinality-06
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Graph (trivial) has 140 edges and 279 vertex of which 6 / 279 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 591 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 272 transition count 193
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 242 transition count 193
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 62 place count 242 transition count 139
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 183 place count 175 transition count 139
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 171 transition count 135
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 171 transition count 135
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 167 rules applied. Total rules applied 358 place count 87 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 86 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 360 place count 85 transition count 51
Applied a total of 360 rules in 60 ms. Remains 85 /279 variables (removed 194) and now considering 51/231 (removed 180) transitions.
// Phase 1: matrix 51 rows 85 cols
[2024-05-21 15:04:42] [INFO ] Computed 40 invariants in 1 ms
[2024-05-21 15:04:42] [INFO ] Implicit Places using invariants in 65 ms returned [4, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 83/279 places, 51/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 128 ms. Remains : 83/279 places, 51/231 transitions.
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-06
Product exploration explored 100000 steps with 21880 reset in 209 ms.
Product exploration explored 100000 steps with 21906 reset in 188 ms.
Computed a total of 83 stabilizing places and 50 stable transitions
Computed a total of 83 stabilizing places and 50 stable transitions
Detected a total of 83/83 stabilizing places and 50/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 36952 steps (10384 resets) in 299 ms. (123 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 83 cols
[2024-05-21 15:04:43] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 15:04:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 15:04:43] [INFO ] Invariant cache hit.
[2024-05-21 15:04:43] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 160 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/83 places, 51/51 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 42 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 42 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 41 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 41 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 40 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 40 transition count 46
Applied a total of 10 rules in 2 ms. Remains 40 /45 variables (removed 5) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 40 cols
[2024-05-21 15:04:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:04:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 15:04:44] [INFO ] Invariant cache hit.
[2024-05-21 15:04:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/83 places, 46/51 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 40/83 places, 46/51 transitions.
Computed a total of 40 stabilizing places and 45 stable transitions
Graph (complete) has 79 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 45 stable transitions
Detected a total of 40/40 stabilizing places and 45/46 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 20287 steps (5654 resets) in 21 ms. (922 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21794 reset in 65 ms.
Product exploration explored 100000 steps with 21861 reset in 80 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 46/46 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 40 transition count 46
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 40 transition count 50
Deduced a syphon composed of 13 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 40 transition count 48
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 15 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 48/46 (removed -2) transitions.
[2024-05-21 15:04:45] [INFO ] Redundant transitions in 171 ms returned []
Running 45 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-21 15:04:45] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 1 (OVERLAPS) 47/86 variables, 39/39 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/39 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/40 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/40 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/40 constraints. Problems are: Problem set: 16 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 40 constraints, problems are : Problem set: 16 solved, 29 unsolved in 276 ms.
Refiners :[State Equation: 40/40 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 47/73 variables, 26/26 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 29/55 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/55 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 14/87 variables, 14/69 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/69 constraints. Problems are: Problem set: 16 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/69 constraints. Problems are: Problem set: 16 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 69 constraints, problems are : Problem set: 16 solved, 29 unsolved in 318 ms.
Refiners :[State Equation: 40/40 constraints, PredecessorRefiner: 29/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 16 solved, 29 unsolved
Search for dead transitions found 16 dead transitions in 619ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/40 places, 32/46 transitions.
Graph (complete) has 69 edges and 40 vertex of which 27 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 27 /40 variables (removed 13) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/40 places, 32/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 815 ms. Remains : 27/40 places, 32/46 transitions.
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 46/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 40 cols
[2024-05-21 15:04:46] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:04:46] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 15:04:46] [INFO ] Invariant cache hit.
[2024-05-21 15:04:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-21 15:04:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 45/84 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 0/85 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 40 constraints, problems are : Problem set: 0 solved, 43 unsolved in 480 ms.
Refiners :[State Equation: 40/40 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 45/84 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 43/82 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 83 constraints, problems are : Problem set: 0 solved, 43 unsolved in 595 ms.
Refiners :[State Equation: 40/40 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1089ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1090ms
Finished structural reductions in LTL mode , in 1 iterations and 1142 ms. Remains : 40/40 places, 46/46 transitions.
Treatment of property BusinessProcesses-PT-05-LTLCardinality-06 finished in 5202 ms.
[2024-05-21 15:04:47] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:04:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 15:04:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 279 places, 231 transitions and 676 arcs took 4 ms.
Total runtime 432995 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 279
TRANSITIONS: 231
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3280
MODEL NAME: /home/mcc/execution/413/model
279 places, 231 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-05, 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 r047-tajo-171620398300483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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