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.r472-tajo-171620399600492.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 ltsminxred
Input is BusinessProcesses-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-06-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225203041

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:00:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:00:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:00:04] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-01 07:00:04] [INFO ] Transformed 376 places.
[2024-06-01 07:00:04] [INFO ] Transformed 297 transitions.
[2024-06-01 07:00:04] [INFO ] Found NUPN structural information;
[2024-06-01 07:00:04] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 337 transition count 260
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 337 transition count 260
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 321 transition count 244
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 321 transition count 244
Applied a total of 106 rules in 99 ms. Remains 321 /375 variables (removed 54) and now considering 244/296 (removed 52) transitions.
// Phase 1: matrix 244 rows 321 cols
[2024-06-01 07:00:05] [INFO ] Computed 79 invariants in 22 ms
[2024-06-01 07:00:05] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-06-01 07:00:05] [INFO ] Invariant cache hit.
[2024-06-01 07:00:05] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-06-01 07:00:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 22 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 6 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 8 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 3 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 17 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 4 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 10 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 3 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 3 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 10 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:19] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 3 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 19/158 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:22] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:30] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:30] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:00:31] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 14 (OVERLAPS) 244/565 variables, 321/494 constraints. Problems are: Problem set: 0 solved, 243 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 565/565 variables, and 494 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 94/173 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:37] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 3 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 244/565 variables, 321/500 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 243/743 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 8/751 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 751 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 108/108 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 321/375 places, 244/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60906 ms. Remains : 321/375 places, 244/296 transitions.
Support contains 41 out of 321 places after structural reductions.
[2024-06-01 07:01:06] [INFO ] Flatten gal took : 52 ms
[2024-06-01 07:01:06] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:01:06] [INFO ] Input system was already deterministic with 244 transitions.
Support contains 40 out of 321 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (404 resets) in 2044 ms. (19 steps per ms) remains 1/32 properties
BEST_FIRST walk for 32208 steps (51 resets) in 141 ms. (226 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-06-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 314 stabilizing places and 235 stable transitions
Graph (complete) has 632 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&(p1||X(p2)))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 23 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-06-01 07:01:07] [INFO ] Computed 79 invariants in 7 ms
[2024-06-01 07:01:07] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 07:01:07] [INFO ] Invariant cache hit.
[2024-06-01 07:01:07] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 07:01:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 3 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 3 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 4 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 3 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 29109 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 3 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 3 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:02] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:02:02] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:02] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:02] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 59171ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 59175ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59583 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 1074 reset in 298 ms.
Product exploration explored 100000 steps with 1076 reset in 206 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 700 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8513 steps (88 resets) in 51 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 12 factoid took 926 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Graph (trivial) has 131 edges and 309 vertex of which 6 / 309 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 611 edges and 304 vertex of which 303 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 302 transition count 198
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 276 transition count 198
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 54 place count 276 transition count 133
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 194 place count 201 transition count 133
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 355 place count 120 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 356 place count 119 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 118 transition count 52
Applied a total of 357 rules in 124 ms. Remains 118 /309 variables (removed 191) and now considering 52/232 (removed 180) transitions.
// Phase 1: matrix 52 rows 118 cols
[2024-06-01 07:02:09] [INFO ] Computed 67 invariants in 2 ms
[2024-06-01 07:02:10] [INFO ] Implicit Places using invariants in 154 ms returned [110, 112, 114]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 156 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/309 places, 52/232 transitions.
Applied a total of 0 rules in 11 ms. Remains 115 /115 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 291 ms. Remains : 115/309 places, 52/232 transitions.
Computed a total of 115 stabilizing places and 51 stable transitions
Computed a total of 115 stabilizing places and 51 stable transitions
Detected a total of 115/115 stabilizing places and 51/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 833 steps (147 resets) in 21 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15942 reset in 431 ms.
Product exploration explored 100000 steps with 15953 reset in 329 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 50
Applied a total of 4 rules in 10 ms. Remains 113 /115 variables (removed 2) and now considering 50/52 (removed 2) transitions.
// Phase 1: matrix 50 rows 113 cols
[2024-06-01 07:02:11] [INFO ] Computed 64 invariants in 1 ms
[2024-06-01 07:02:13] [INFO ] Implicit Places using invariants in 2007 ms returned []
[2024-06-01 07:02:13] [INFO ] Invariant cache hit.
[2024-06-01 07:02:13] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 43, 44, 46, 48, 50, 52, 54, 56, 58, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 2182 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/115 places, 50/52 transitions.
Graph (complete) has 157 edges and 75 vertex of which 67 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 67 transition count 40
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 58 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 52 transition count 35
Applied a total of 30 rules in 6 ms. Remains 52 /75 variables (removed 23) and now considering 35/50 (removed 15) transitions.
// Phase 1: matrix 35 rows 52 cols
[2024-06-01 07:02:13] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 07:02:13] [INFO ] Implicit Places using invariants in 40 ms returned [49, 50, 51]
[2024-06-01 07:02:13] [INFO ] Actually due to overlaps returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/115 places, 35/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2244 ms. Remains : 51/115 places, 35/52 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-02 finished in 66534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(p1 U (p2||G(p1)))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 12 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-06-01 07:02:13] [INFO ] Computed 79 invariants in 2 ms
[2024-06-01 07:02:13] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 07:02:13] [INFO ] Invariant cache hit.
[2024-06-01 07:02:14] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-06-01 07:02:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 3 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (OVERLAPS) 234/545 variables, 311/459 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 233 unsolved
(s139 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 479 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 89/168 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 234/545 variables, 311/482 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 233/715 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:02:51] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:51] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 15/730 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 732 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 109/109 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03
Product exploration explored 100000 steps with 1031 reset in 250 ms.
Product exploration explored 100000 steps with 1035 reset in 193 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 349 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (411 resets) in 336 ms. (118 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
[2024-06-01 07:03:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/188 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/301 variables, 45/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 225/526 variables, 301/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/542 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 545/545 variables, and 399 constraints, problems are : Problem set: 1 solved, 0 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 504ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p0 p1) p2))), (F p0), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 26 factoid took 652 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 309 transition count 205
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 282 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 280 transition count 203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 59 place count 280 transition count 138
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 199 place count 205 transition count 138
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 381 place count 110 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 382 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 108 transition count 49
Applied a total of 384 rules in 48 ms. Remains 108 /311 variables (removed 203) and now considering 49/234 (removed 185) transitions.
// Phase 1: matrix 49 rows 108 cols
[2024-06-01 07:03:17] [INFO ] Computed 60 invariants in 1 ms
[2024-06-01 07:03:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 07:03:17] [INFO ] Invariant cache hit.
[2024-06-01 07:03:17] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 73, 74, 76]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 190 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/311 places, 49/234 transitions.
Graph (complete) has 174 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 60 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 45 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 44 transition count 30
Applied a total of 44 rules in 7 ms. Remains 44 /77 variables (removed 33) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 44 cols
[2024-06-01 07:03:17] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 07:03:17] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 07:03:17] [INFO ] Invariant cache hit.
[2024-06-01 07:03:17] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/311 places, 30/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 348 ms. Remains : 44/311 places, 30/234 transitions.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 219 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 1841 steps (268 resets) in 17 ms. (102 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (OR (NOT p2) (NOT p0)))))]
Knowledge based reduction with 17 factoid took 752 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16016 reset in 148 ms.
Product exploration explored 100000 steps with 15858 reset in 134 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 07:03:19] [INFO ] Invariant cache hit.
[2024-06-01 07:03:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 07:03:19] [INFO ] Invariant cache hit.
[2024-06-01 07:03:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-01 07:03:19] [INFO ] Redundant transitions in 30 ms returned []
Running 28 sub problems to find dead transitions.
[2024-06-01 07:03:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/73 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 59 constraints, problems are : Problem set: 0 solved, 28 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/73 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 27/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 87 constraints, problems are : Problem set: 0 solved, 28 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 844ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 844ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1000 ms. Remains : 44/44 places, 30/30 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 66261 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(F(p0))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 12 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-06-01 07:03:20] [INFO ] Computed 79 invariants in 2 ms
[2024-06-01 07:03:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 07:03:20] [INFO ] Invariant cache hit.
[2024-06-01 07:03:20] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 07:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 3 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 26446 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 56484ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 56486ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56896 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 138 ms.
Product exploration explored 100000 steps with 33333 reset in 121 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-04 finished in 57350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 140 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 314 transition count 204
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 282 transition count 204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 66 place count 282 transition count 138
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 208 place count 206 transition count 138
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 198 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 198 transition count 130
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 392 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 108 transition count 49
Applied a total of 394 rules in 56 ms. Remains 108 /321 variables (removed 213) and now considering 49/244 (removed 195) transitions.
// Phase 1: matrix 49 rows 108 cols
[2024-06-01 07:04:17] [INFO ] Computed 60 invariants in 1 ms
[2024-06-01 07:04:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 07:04:17] [INFO ] Invariant cache hit.
[2024-06-01 07:04:17] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 16, 18, 20, 22, 24, 26, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 233 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/321 places, 49/244 transitions.
Graph (complete) has 141 edges and 69 vertex of which 61 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 61 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 51 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 36 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 35 transition count 29
Applied a total of 46 rules in 6 ms. Remains 35 /69 variables (removed 34) and now considering 29/49 (removed 20) transitions.
// Phase 1: matrix 29 rows 35 cols
[2024-06-01 07:04:17] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 07:04:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 07:04:17] [INFO ] Invariant cache hit.
[2024-06-01 07:04:17] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/321 places, 29/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 383 ms. Remains : 35/321 places, 29/244 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-06
Product exploration explored 100000 steps with 31660 reset in 70 ms.
Product exploration explored 100000 steps with 31775 reset in 94 ms.
Computed a total of 35 stabilizing places and 28 stable transitions
Graph (complete) has 101 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 35 stabilizing places and 28 stable transitions
Detected a total of 35/35 stabilizing places and 28/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 16983 steps (6487 resets) in 22 ms. (738 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 761 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-06-01 07:04:19] [INFO ] Invariant cache hit.
[2024-06-01 07:04:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 07:04:19] [INFO ] Invariant cache hit.
[2024-06-01 07:04:19] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-01 07:04:19] [INFO ] Redundant transitions in 43 ms returned []
Running 25 sub problems to find dead transitions.
[2024-06-01 07:04:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 28/62 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 42 constraints, problems are : Problem set: 0 solved, 25 unsolved in 295 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 28/62 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 67 constraints, problems are : Problem set: 0 solved, 25 unsolved in 283 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 587ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 744 ms. Remains : 35/35 places, 29/29 transitions.
Computed a total of 35 stabilizing places and 28 stable transitions
Graph (complete) has 101 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 35 stabilizing places and 28 stable transitions
Detected a total of 35/35 stabilizing places and 28/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7110 steps (2729 resets) in 16 ms. (418 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 582 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31892 reset in 108 ms.
Product exploration explored 100000 steps with 31764 reset in 90 ms.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-06-01 07:04:21] [INFO ] Invariant cache hit.
[2024-06-01 07:04:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 07:04:21] [INFO ] Invariant cache hit.
[2024-06-01 07:04:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-06-01 07:04:21] [INFO ] Redundant transitions in 30 ms returned []
Running 25 sub problems to find dead transitions.
[2024-06-01 07:04:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 28/62 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 42 constraints, problems are : Problem set: 0 solved, 25 unsolved in 265 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 28/62 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 67 constraints, problems are : Problem set: 0 solved, 25 unsolved in 296 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 570ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 35/35 places, 29/29 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-06 finished in 5101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 314 transition count 203
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 281 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 70 place count 280 transition count 136
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 212 place count 204 transition count 136
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 221 place count 195 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 230 place count 195 transition count 127
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 26 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-06-01 07:04:22] [INFO ] Computed 60 invariants in 1 ms
[2024-06-01 07:04:22] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 07:04:22] [INFO ] Invariant cache hit.
[2024-06-01 07:04:22] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 210 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 58 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 49 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 34 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 33 transition count 27
Applied a total of 44 rules in 5 ms. Remains 33 /66 variables (removed 33) and now considering 27/46 (removed 19) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-06-01 07:04:22] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 07:04:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 07:04:22] [INFO ] Invariant cache hit.
[2024-06-01 07:04:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/321 places, 27/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 313 ms. Remains : 33/321 places, 27/244 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-07
Stuttering criterion allowed to conclude after 125 steps with 35 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-07 finished in 357 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 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 11 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-06-01 07:04:22] [INFO ] Computed 79 invariants in 3 ms
[2024-06-01 07:04:23] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 07:04:23] [INFO ] Invariant cache hit.
[2024-06-01 07:04:23] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 07:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:26] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:04:39] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 27054 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:05:16] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:05:17] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 57100ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 57102ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57538 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-08 finished in 57647 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 (G(p1)||X((p2||X(((p3||F(!p2)) U (p2&&(p3||F(!p2)))))))))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 12 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
[2024-06-01 07:05:20] [INFO ] Invariant cache hit.
[2024-06-01 07:05:20] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 07:05:20] [INFO ] Invariant cache hit.
[2024-06-01 07:05:21] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 07:05:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:05:24] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:05:32] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:05:33] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 28688 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 58744ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 58746ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59212 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-09
Product exploration explored 100000 steps with 33378 reset in 126 ms.
Product exploration explored 100000 steps with 33404 reset in 136 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 1818 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
RANDOM walk for 40000 steps (413 resets) in 149 ms. (266 steps per ms) remains 3/18 properties
BEST_FIRST walk for 30804 steps (52 resets) in 40 ms. (751 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p3), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 27 factoid took 8598 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Applied a total of 0 rules in 6 ms. Remains 309 /309 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-06-01 07:06:32] [INFO ] Invariant cache hit.
[2024-06-01 07:06:32] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 07:06:32] [INFO ] Invariant cache hit.
[2024-06-01 07:06:32] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 07:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 3 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 27654 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 57698ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 57701ms
Finished structural reductions in LTL mode , in 1 iterations and 58212 ms. Remains : 309/309 places, 232/232 transitions.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 1811 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
RANDOM walk for 40000 steps (422 resets) in 327 ms. (121 steps per ms) remains 3/18 properties
BEST_FIRST walk for 32188 steps (56 resets) in 88 ms. (361 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p3), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 27 factoid took 7730 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Product exploration explored 100000 steps with 33409 reset in 171 ms.
Product exploration explored 100000 steps with 33195 reset in 177 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Graph (trivial) has 130 edges and 309 vertex of which 6 / 309 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 611 edges and 304 vertex of which 303 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 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 303 transition count 225
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 27 place count 303 transition count 249
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 64 place count 303 transition count 249
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 292 transition count 228
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 292 transition count 228
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 195 place count 292 transition count 228
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 210 place count 277 transition count 213
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 225 place count 277 transition count 213
Deduced a syphon composed of 145 places in 0 ms
Applied a total of 225 rules in 72 ms. Remains 277 /309 variables (removed 32) and now considering 213/232 (removed 19) transitions.
[2024-06-01 07:07:42] [INFO ] Redundant transitions in 32 ms returned []
Running 212 sub problems to find dead transitions.
// Phase 1: matrix 213 rows 277 cols
[2024-06-01 07:07:42] [INFO ] Computed 79 invariants in 5 ms
[2024-06-01 07:07:42] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/99 constraints. Problems are: Problem set: 70 solved, 142 unsolved
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
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 TDEAD29 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 TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 20/119 constraints. Problems are: Problem set: 125 solved, 87 unsolved
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 20/139 constraints. Problems are: Problem set: 142 solved, 70 unsolved
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 7/146 constraints. Problems are: Problem set: 148 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/146 constraints. Problems are: Problem set: 148 solved, 64 unsolved
Problem TDEAD0 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 TDEAD20 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 9 (OVERLAPS) 212/489 variables, 277/423 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 13/436 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 0/436 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 1/490 variables, 1/437 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 1/438 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/438 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/490 variables, 0/438 constraints. Problems are: Problem set: 159 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 438 constraints, problems are : Problem set: 159 solved, 53 unsolved in 9521 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 277/277 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 159 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 108/239 variables, 40/40 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 68/108 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 5/113 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/113 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 36/275 variables, 39/152 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 2/154 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/154 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 212/487 variables, 275/429 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 13/442 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 53/495 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/495 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 2/489 variables, 2/497 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 0/497 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 1/490 variables, 1/498 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 4/502 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 0/502 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 17 (OVERLAPS) 0/490 variables, 0/502 constraints. Problems are: Problem set: 159 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 502 constraints, problems are : Problem set: 159 solved, 53 unsolved in 11043 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 277/277 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 53/212 constraints, Known Traps: 79/79 constraints]
After SMT, in 20662ms problems are : Problem set: 159 solved, 53 unsolved
Search for dead transitions found 159 dead transitions in 20667ms
Found 159 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 159 transitions
Dead transitions reduction (with SMT) removed 159 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 277/309 places, 54/232 transitions.
Graph (complete) has 538 edges and 277 vertex of which 132 are kept as prefixes of interest. Removing 145 places using SCC suffix rule.0 ms
Discarding 145 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Applied a total of 1 rules in 5 ms. Remains 120 /277 variables (removed 157) and now considering 54/54 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/309 places, 54/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20786 ms. Remains : 120/309 places, 54/232 transitions.
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Applied a total of 0 rules in 12 ms. Remains 309 /309 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-06-01 07:08:03] [INFO ] Computed 79 invariants in 7 ms
[2024-06-01 07:08:03] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 07:08:03] [INFO ] Invariant cache hit.
[2024-06-01 07:08:04] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 07:08:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 3 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 3 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 27626 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 57663ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 57665ms
Finished structural reductions in LTL mode , in 1 iterations and 58120 ms. Remains : 309/309 places, 232/232 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-09 finished in 221223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 314 transition count 202
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 280 transition count 137
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 196 transition count 128
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 196 transition count 128
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 24 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-06-01 07:09:01] [INFO ] Computed 60 invariants in 1 ms
[2024-06-01 07:09:01] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 07:09:01] [INFO ] Invariant cache hit.
[2024-06-01 07:09:02] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 13, 15, 17, 19, 21, 23, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 206 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 58 transition count 35
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 33 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 32 transition count 26
Applied a total of 46 rules in 6 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 32 cols
[2024-06-01 07:09:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 07:09:02] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 07:09:02] [INFO ] Invariant cache hit.
[2024-06-01 07:09:02] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/321 places, 26/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 323 ms. Remains : 32/321 places, 26/244 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-10
Stuttering criterion allowed to conclude after 377 steps with 119 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-10 finished in 389 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' '!((p0 U (G(p0)||(X((F(p0)&&X(G(p2))))&&p1))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 310 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 310 transition count 233
Applied a total of 22 rules in 12 ms. Remains 310 /321 variables (removed 11) and now considering 233/244 (removed 11) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-06-01 07:09:02] [INFO ] Computed 79 invariants in 2 ms
[2024-06-01 07:09:02] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 07:09:02] [INFO ] Invariant cache hit.
[2024-06-01 07:09:02] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-06-01 07:09:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
SMT process timed out in 30041ms, After SMT, problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 30044ms
Starting structural reductions in LTL mode, iteration 1 : 310/321 places, 233/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30491 ms. Remains : 310/321 places, 233/244 transitions.
Stuttering acceptance computed with spot in 323 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 1031 reset in 251 ms.
Product exploration explored 100000 steps with 1016 reset in 271 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 455 ms. Reduced automaton from 9 states, 32 edges and 3 AP (stutter sensitive) to 9 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 19 to 14
RANDOM walk for 40000 steps (411 resets) in 440 ms. (90 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40002 steps (72 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (73 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (72 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (73 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (70 resets) in 392 ms. (101 steps per ms) remains 5/5 properties
[2024-06-01 07:09:34] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 189/211 variables, 39/40 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 88/299 variables, 39/83 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 1/84 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 221/520 variables, 299/383 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/383 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 16/536 variables, 7/390 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/390 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 543/543 variables, and 394 constraints, problems are : Problem set: 5 solved, 0 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 430ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p0 p2)), (G (OR p0 p2)), (G (OR p0 (NOT p1))), (G (OR p0 (NOT p1) p2)), (G (OR p0 p1 p2)), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1 p2))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 34 factoid took 1276 ms. Reduced automaton from 9 states, 32 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 295 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 310 /310 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-06-01 07:09:37] [INFO ] Invariant cache hit.
[2024-06-01 07:09:37] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 07:09:37] [INFO ] Invariant cache hit.
[2024-06-01 07:09:37] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-06-01 07:09:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 3 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 4 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 3 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:10:03] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 16 (OVERLAPS) 233/543 variables, 310/483 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 483 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 94/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 233/543 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 232/716 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 10/726 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 7/733 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 733 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 112/112 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in LTL mode , in 1 iterations and 60515 ms. Remains : 310/310 places, 233/233 transitions.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p1 p2))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 937 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 15239 steps (151 resets) in 199 ms. (76 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p1 p2))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1 p2))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 2146 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1034 reset in 200 ms.
Product exploration explored 100000 steps with 1025 reset in 214 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Graph (trivial) has 129 edges and 310 vertex of which 6 / 310 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 612 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 304 transition count 226
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 27 place count 304 transition count 249
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 64 place count 304 transition count 249
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 294 transition count 230
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 294 transition count 230
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 1 with 114 rules applied. Total rules applied 198 place count 294 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 214 place count 278 transition count 214
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 230 place count 278 transition count 214
Deduced a syphon composed of 150 places in 0 ms
Applied a total of 230 rules in 30 ms. Remains 278 /310 variables (removed 32) and now considering 214/233 (removed 19) transitions.
[2024-06-01 07:10:42] [INFO ] Redundant transitions in 54 ms returned []
Running 213 sub problems to find dead transitions.
// Phase 1: matrix 214 rows 278 cols
[2024-06-01 07:10:42] [INFO ] Computed 79 invariants in 3 ms
[2024-06-01 07:10:42] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 40/71 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 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 TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 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 TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 20/99 constraints. Problems are: Problem set: 89 solved, 124 unsolved
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 20/119 constraints. Problems are: Problem set: 130 solved, 83 unsolved
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 17/136 constraints. Problems are: Problem set: 153 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/136 constraints. Problems are: Problem set: 153 solved, 60 unsolved
Problem TDEAD0 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 TDEAD20 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 8 (OVERLAPS) 213/491 variables, 278/414 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 13/427 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/427 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 1/492 variables, 1/428 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 0/428 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 13 (OVERLAPS) 0/492 variables, 0/428 constraints. Problems are: Problem set: 164 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 428 constraints, problems are : Problem set: 164 solved, 49 unsolved in 7378 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 278/278 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 164 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 112/239 variables, 40/40 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/41 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 57/98 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/98 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 37/276 variables, 38/136 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/136 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 213/489 variables, 276/412 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 13/425 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 49/474 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/474 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 2/491 variables, 2/476 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 0/476 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 13 (OVERLAPS) 1/492 variables, 1/477 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/477 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 15 (OVERLAPS) 0/492 variables, 0/477 constraints. Problems are: Problem set: 164 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 477 constraints, problems are : Problem set: 164 solved, 49 unsolved in 6577 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 278/278 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 49/213 constraints, Known Traps: 57/57 constraints]
After SMT, in 14036ms problems are : Problem set: 164 solved, 49 unsolved
Search for dead transitions found 164 dead transitions in 14040ms
Found 164 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 164 transitions
Dead transitions reduction (with SMT) removed 164 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 278/310 places, 50/233 transitions.
Graph (complete) has 544 edges and 278 vertex of which 128 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.6 ms
Discarding 150 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Applied a total of 1 rules in 13 ms. Remains 112 /278 variables (removed 166) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/310 places, 50/233 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14157 ms. Remains : 112/310 places, 50/233 transitions.
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 310 /310 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-06-01 07:10:57] [INFO ] Computed 79 invariants in 4 ms
[2024-06-01 07:10:57] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 07:10:57] [INFO ] Invariant cache hit.
[2024-06-01 07:10:57] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-06-01 07:10:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 16 (OVERLAPS) 233/543 variables, 310/483 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 486 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 97/97 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 97/176 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 233/543 variables, 310/486 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 232/718 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 8/726 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 732 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 111/111 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 310/310 places, 233/233 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-11 finished in 175444 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((G(p0)||X(p1)))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 313 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 13 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-06-01 07:11:57] [INFO ] Computed 79 invariants in 2 ms
[2024-06-01 07:11:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 07:11:57] [INFO ] Invariant cache hit.
[2024-06-01 07:11:58] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-06-01 07:11:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 4 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 234/545 variables, 311/483 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 486 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 96/175 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 234/545 variables, 311/489 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 233/722 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 14/737 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 742 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 119/119 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 6179 steps with 64 reset in 10 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-12 finished in 60697 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' '!(((p0 U (G(p0)||(p0&&(p1||X(F(!p2)))))) U (G(p0)||(p3&&(p0 U (G(p0)||(p0&&(p1||X(F(!p2))))))&&X((p3 U (!p2||G(p3))))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 313 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 10 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-06-01 07:12:58] [INFO ] Computed 79 invariants in 1 ms
[2024-06-01 07:12:58] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 07:12:58] [INFO ] Invariant cache hit.
[2024-06-01 07:12:58] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-06-01 07:12:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 15/140 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 234/545 variables, 311/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 14 (OVERLAPS) 0/545 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 468 constraints, problems are : Problem set: 0 solved, 233 unsolved in 26463 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 78/157 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 234/545 variables, 311/473 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 233/706 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 6/712 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 6/718 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 721 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 98/98 constraints]
After SMT, in 56503ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 56506ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56916 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, p2, (NOT p0), (AND (NOT p0) p2), (AND (NOT p3) p2), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND p0 p3 (NOT p1) p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 p3 p1 p2))), (X (NOT (AND p0 p3 p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X (AND p0 p3 p1)), (X p1), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 p3 p1 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p0 p3 p1))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 1141 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-13 finished in 58587 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 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 626 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 314 transition count 202
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 280 transition count 137
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 218 place count 197 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 226 place count 197 transition count 129
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 29 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-06-01 07:13:56] [INFO ] Computed 60 invariants in 1 ms
[2024-06-01 07:13:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 07:13:57] [INFO ] Invariant cache hit.
[2024-06-01 07:13:57] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 68, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 204 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 138 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 58 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 49 transition count 36
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 44 place count 33 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 32 transition count 26
Applied a total of 46 rules in 2 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 32 cols
[2024-06-01 07:13:57] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 07:13:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 07:13:57] [INFO ] Invariant cache hit.
[2024-06-01 07:13:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/321 places, 26/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 32/321 places, 26/244 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-14 finished in 348 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(F((p0&&X((G(F(p0))&&(!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 10 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-06-01 07:13:57] [INFO ] Computed 79 invariants in 1 ms
[2024-06-01 07:13:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 07:13:57] [INFO ] Invariant cache hit.
[2024-06-01 07:13:57] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-06-01 07:13:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 13/141 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 234/545 variables, 311/465 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 233 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 545/545 variables, and 467 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 77/156 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 234/545 variables, 311/467 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 233/700 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 12/712 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 3/715 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 3/718 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 718 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 95/95 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60442 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 1032 reset in 148 ms.
Product exploration explored 100000 steps with 1039 reset in 158 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 186 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26382 steps (268 resets) in 55 ms. (471 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 309 transition count 207
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 284 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 282 transition count 205
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 55 place count 282 transition count 138
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 199 place count 205 transition count 138
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 370 place count 118 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 118 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 117 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 116 transition count 52
Applied a total of 373 rules in 18 ms. Remains 116 /311 variables (removed 195) and now considering 52/234 (removed 182) transitions.
// Phase 1: matrix 52 rows 116 cols
[2024-06-01 07:14:58] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 07:14:58] [INFO ] Implicit Places using invariants in 73 ms returned [100, 102, 104, 106, 108]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 87 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/311 places, 52/234 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107 ms. Remains : 111/311 places, 52/234 transitions.
Computed a total of 108 stabilizing places and 48 stable transitions
Computed a total of 108 stabilizing places and 48 stable transitions
Detected a total of 108/111 stabilizing places and 48/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3159 steps (456 resets) in 9 ms. (315 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14212 reset in 197 ms.
Product exploration explored 100000 steps with 14799 reset in 171 ms.
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 52/52 transitions.
Graph (trivial) has 4 edges and 111 vertex of which 2 / 111 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 106 transition count 47
Applied a total of 7 rules in 3 ms. Remains 106 /111 variables (removed 5) and now considering 47/52 (removed 5) transitions.
// Phase 1: matrix 47 rows 106 cols
[2024-06-01 07:14:59] [INFO ] Computed 60 invariants in 3 ms
[2024-06-01 07:14:59] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 07:14:59] [INFO ] Invariant cache hit.
[2024-06-01 07:14:59] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 38, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 212 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/111 places, 47/52 transitions.
Graph (complete) has 139 edges and 67 vertex of which 59 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 36
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 34 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 33 transition count 27
Applied a total of 46 rules in 2 ms. Remains 33 /67 variables (removed 34) and now considering 27/47 (removed 20) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-06-01 07:14:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 07:14:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:14:59] [INFO ] Invariant cache hit.
[2024-06-01 07:14:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/111 places, 27/52 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 33/111 places, 27/52 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 62682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&(p1||X(p2)))))'
Found a Shortening insensitive property : BusinessProcesses-PT-06-LTLFireability-02
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 626 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 314 transition count 202
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 196 transition count 128
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 196 transition count 128
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 379 place count 120 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 380 place count 119 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 381 place count 118 transition count 52
Applied a total of 381 rules in 19 ms. Remains 118 /321 variables (removed 203) and now considering 52/244 (removed 192) transitions.
// Phase 1: matrix 52 rows 118 cols
[2024-06-01 07:15:00] [INFO ] Computed 67 invariants in 1 ms
[2024-06-01 07:15:00] [INFO ] Implicit Places using invariants in 81 ms returned [110, 112, 114]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 115/321 places, 52/244 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 117 ms. Remains : 115/321 places, 52/244 transitions.
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 15980 reset in 164 ms.
Product exploration explored 100000 steps with 15938 reset in 193 ms.
Computed a total of 115 stabilizing places and 51 stable transitions
Computed a total of 115 stabilizing places and 51 stable transitions
Detected a total of 115/115 stabilizing places and 51/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 1296 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 584 steps (101 resets) in 5 ms. (97 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 1384 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 115 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 115 cols
[2024-06-01 07:15:03] [INFO ] Computed 64 invariants in 0 ms
[2024-06-01 07:15:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 07:15:03] [INFO ] Invariant cache hit.
[2024-06-01 07:15:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 20, 22, 24, 26, 45, 46, 48, 50, 52, 54, 56, 58, 60, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 214 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/115 places, 52/52 transitions.
Graph (complete) has 182 edges and 82 vertex of which 74 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 74 transition count 42
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 65 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 59 transition count 37
Applied a total of 30 rules in 2 ms. Remains 59 /82 variables (removed 23) and now considering 37/52 (removed 15) transitions.
// Phase 1: matrix 37 rows 59 cols
[2024-06-01 07:15:03] [INFO ] Computed 23 invariants in 0 ms
[2024-06-01 07:15:03] [INFO ] Implicit Places using invariants in 39 ms returned [56, 57, 58]
[2024-06-01 07:15:03] [INFO ] Actually due to overlaps returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/115 places, 37/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 263 ms. Remains : 58/115 places, 37/52 transitions.
Computed a total of 58 stabilizing places and 36 stable transitions
Computed a total of 58 stabilizing places and 36 stable transitions
Detected a total of 58/58 stabilizing places and 36/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 372 steps (65 resets) in 4 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16449 reset in 82 ms.
Product exploration explored 100000 steps with 16419 reset in 81 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 37/37 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 35
Applied a total of 4 rules in 10 ms. Remains 56 /58 variables (removed 2) and now considering 35/37 (removed 2) transitions.
// Phase 1: matrix 35 rows 56 cols
[2024-06-01 07:15:04] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 07:15:04] [INFO ] Implicit Places using invariants in 44 ms returned [54, 55]
[2024-06-01 07:15:04] [INFO ] Actually due to overlaps returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/58 places, 35/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 55/58 places, 35/37 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-02 finished in 4571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(p1 U (p2||G(p1)))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-06-LTLFireability-03
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (complete) has 632 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 32 place count 319 transition count 211
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 288 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 286 transition count 209
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 67 place count 286 transition count 142
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 211 place count 209 transition count 142
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 219 place count 201 transition count 134
Iterating global reduction 3 with 8 rules applied. Total rules applied 227 place count 201 transition count 134
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 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 401 place count 110 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 402 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 404 place count 108 transition count 49
Applied a total of 404 rules in 15 ms. Remains 108 /321 variables (removed 213) and now considering 49/244 (removed 195) transitions.
// Phase 1: matrix 49 rows 108 cols
[2024-06-01 07:15:04] [INFO ] Computed 60 invariants in 1 ms
[2024-06-01 07:15:04] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 07:15:04] [INFO ] Invariant cache hit.
[2024-06-01 07:15:04] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 73, 74, 76]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 199 ms to find 31 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 77/321 places, 49/244 transitions.
Graph (complete) has 174 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 60 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 45 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 44 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 44 transition count 30
Applied a total of 44 rules in 2 ms. Remains 44 /77 variables (removed 33) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 44 cols
[2024-06-01 07:15:04] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 07:15:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 07:15:05] [INFO ] Invariant cache hit.
[2024-06-01 07:15:05] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 44/321 places, 30/244 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 295 ms. Remains : 44/321 places, 30/244 transitions.
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03
Product exploration explored 100000 steps with 16018 reset in 109 ms.
Product exploration explored 100000 steps with 15875 reset in 121 ms.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 367 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (6400 resets) in 131 ms. (303 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (1813 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-06-01 07:15:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/36 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/65 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 74/74 variables, and 59 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p0 p1) p2))), (F p0), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 26 factoid took 1030 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 07:15:07] [INFO ] Invariant cache hit.
[2024-06-01 07:15:07] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 07:15:07] [INFO ] Invariant cache hit.
[2024-06-01 07:15:07] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-01 07:15:07] [INFO ] Redundant transitions in 25 ms returned []
Running 28 sub problems to find dead transitions.
[2024-06-01 07:15:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/73 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 59 constraints, problems are : Problem set: 0 solved, 28 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/73 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 27/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 87 constraints, problems are : Problem set: 0 solved, 28 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 773ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 774ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 884 ms. Remains : 44/44 places, 30/30 transitions.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 302 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 4438 steps (712 resets) in 24 ms. (177 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (OR (NOT p2) (NOT p0)))))]
Knowledge based reduction with 17 factoid took 872 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15981 reset in 119 ms.
Product exploration explored 100000 steps with 16063 reset in 128 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 07:15:09] [INFO ] Invariant cache hit.
[2024-06-01 07:15:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 07:15:09] [INFO ] Invariant cache hit.
[2024-06-01 07:15:09] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-01 07:15:09] [INFO ] Redundant transitions in 30 ms returned []
Running 28 sub problems to find dead transitions.
[2024-06-01 07:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/73 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 59 constraints, problems are : Problem set: 0 solved, 28 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/73 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 27/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 87 constraints, problems are : Problem set: 0 solved, 28 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 768ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 921 ms. Remains : 44/44 places, 30/30 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 6170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
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 (G(p1)||X((p2||X(((p3||F(!p2)) U (p2&&(p3||F(!p2)))))))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-06-LTLFireability-09
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 142 edges and 321 vertex of which 6 / 321 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 626 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 314 transition count 203
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 281 transition count 203
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 68 place count 281 transition count 137
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 196 transition count 128
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 196 transition count 128
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 378 place count 120 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 119 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 380 place count 118 transition count 53
Applied a total of 380 rules in 21 ms. Remains 118 /321 variables (removed 203) and now considering 53/244 (removed 191) transitions.
// Phase 1: matrix 53 rows 118 cols
[2024-06-01 07:15:11] [INFO ] Computed 66 invariants in 0 ms
[2024-06-01 07:15:11] [INFO ] Implicit Places using invariants in 78 ms returned [102, 104, 106, 108, 110, 112]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 79 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/321 places, 53/244 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 101 ms. Remains : 112/321 places, 53/244 transitions.
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property BusinessProcesses-PT-06-LTLFireability-09 finished in 505 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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' '!((p0 U (G(p0)||(X((F(p0)&&X(G(p2))))&&p1))))'
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(F((p0&&X((G(F(p0))&&(!p1 U (p2||G(!p1)))))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-06-LTLFireability-15
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (complete) has 632 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 319 transition count 212
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 289 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 287 transition count 210
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 65 place count 287 transition count 141
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 213 place count 208 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 221 place count 200 transition count 133
Iterating global reduction 3 with 8 rules applied. Total rules applied 229 place count 200 transition count 133
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 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 390 place count 118 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 118 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 392 place count 117 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 393 place count 116 transition count 52
Applied a total of 393 rules in 22 ms. Remains 116 /321 variables (removed 205) and now considering 52/244 (removed 192) transitions.
// Phase 1: matrix 52 rows 116 cols
[2024-06-01 07:15:11] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 07:15:11] [INFO ] Implicit Places using invariants in 94 ms returned [100, 102, 104, 106, 108]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 94 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 111/321 places, 52/244 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 118 ms. Remains : 111/321 places, 52/244 transitions.
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 14713 reset in 198 ms.
Product exploration explored 100000 steps with 14598 reset in 229 ms.
Computed a total of 108 stabilizing places and 48 stable transitions
Computed a total of 108 stabilizing places and 48 stable transitions
Detected a total of 108/111 stabilizing places and 48/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 201 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2227 steps (305 resets) in 11 ms. (185 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 292 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 111 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 111 cols
[2024-06-01 07:15:13] [INFO ] Computed 60 invariants in 1 ms
[2024-06-01 07:15:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 07:15:13] [INFO ] Invariant cache hit.
[2024-06-01 07:15:13] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 42, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 226 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/111 places, 52/52 transitions.
Graph (complete) has 154 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 69 transition count 41
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 59 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 47 transition count 34
Applied a total of 40 rules in 1 ms. Remains 47 /77 variables (removed 30) and now considering 34/52 (removed 18) transitions.
// Phase 1: matrix 34 rows 47 cols
[2024-06-01 07:15:13] [INFO ] Computed 14 invariants in 0 ms
[2024-06-01 07:15:13] [INFO ] Implicit Places using invariants in 40 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/111 places, 34/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 273 ms. Remains : 46/111 places, 34/52 transitions.
Computed a total of 43 stabilizing places and 30 stable transitions
Computed a total of 43 stabilizing places and 30 stable transitions
Detected a total of 43/46 stabilizing places and 30/34 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4727 steps (770 resets) in 9 ms. (472 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15889 reset in 121 ms.
Product exploration explored 100000 steps with 15738 reset in 150 ms.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 34/34 transitions.
Graph (trivial) has 4 edges and 46 vertex of which 2 / 46 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 40 transition count 32
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 34 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 33 transition count 27
Applied a total of 17 rules in 4 ms. Remains 33 /46 variables (removed 13) and now considering 27/34 (removed 7) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-06-01 07:15:14] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 07:15:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 07:15:14] [INFO ] Invariant cache hit.
[2024-06-01 07:15:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 07:15:14] [INFO ] Redundant transitions in 27 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 07:15:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 26/58 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/60 variables, and 40 constraints, problems are : Problem set: 0 solved, 23 unsolved in 228 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 26/58 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1/59 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/60 variables, and 63 constraints, problems are : Problem set: 0 solved, 23 unsolved in 254 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/46 places, 27/34 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 627 ms. Remains : 33/46 places, 27/34 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 3383 ms.
[2024-06-01 07:15:14] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:14] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:15:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 321 places, 244 transitions and 722 arcs took 3 ms.
Total runtime 910322 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-06-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226879882

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-06-LTLFireability-02
ltl formula formula --ltl=/tmp/7740/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 244 transitions and 722 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7740/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7740/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7740/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7740/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 323 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 322, there are 265 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~86 levels ~10000 states ~44776 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~20000 states ~103380 transitions
pnml2lts-mc( 1/ 4): ~86 levels ~40000 states ~214060 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~80000 states ~463648 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~160000 states ~1006244 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~320000 states ~2158412 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~640000 states ~4507012 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~1280000 states ~9835104 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~2560000 states ~20785084 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~5120000 states ~43091204 transitions
pnml2lts-mc( 1/ 4): ~86 levels ~10240000 states ~87799220 transitions
pnml2lts-mc( 1/ 4): ~86 levels ~20480000 states ~185350828 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553194
pnml2lts-mc( 0/ 4): unique states count: 33553473
pnml2lts-mc( 0/ 4): unique transitions count: 316421208
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 282866784
pnml2lts-mc( 0/ 4): - claim found count: 8
pnml2lts-mc( 0/ 4): - claim success count: 33553481
pnml2lts-mc( 0/ 4): - cum. max stack depth: 354
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553481 states 316421226 transitions, fanout: 9.430
pnml2lts-mc( 0/ 4): Total exploration time 161.060 sec (161.050 sec minimum, 161.055 sec on average)
pnml2lts-mc( 0/ 4): States per second: 208329, Transitions per second: 1964617
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.3MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.3MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-06-LTLFireability-03
ltl formula formula --ltl=/tmp/7740/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 244 transitions and 722 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7740/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7740/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7740/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7740/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 322, there are 303 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~91 levels ~10000 states ~41344 transitions
pnml2lts-mc( 1/ 4): ~332 levels ~20000 states ~79492 transitions
pnml2lts-mc( 1/ 4): ~332 levels ~40000 states ~173452 transitions
pnml2lts-mc( 1/ 4): ~332 levels ~80000 states ~392276 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~160000 states ~991288 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~320000 states ~2060984 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~640000 states ~4427404 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~1280000 states ~9491988 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~2560000 states ~19793716 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~5120000 states ~42105956 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~10240000 states ~88994036 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~20480000 states ~183598728 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 24984098
pnml2lts-mc( 0/ 4): unique states count: 33551335
pnml2lts-mc( 0/ 4): unique transitions count: 307939379
pnml2lts-mc( 0/ 4): - self-loop count: 185
pnml2lts-mc( 0/ 4): - claim dead count: 270958142
pnml2lts-mc( 0/ 4): - claim found count: 3426611
pnml2lts-mc( 0/ 4): - claim success count: 33551356
pnml2lts-mc( 0/ 4): - cum. max stack depth: 871
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551356 states 307939454 transitions, fanout: 9.178
pnml2lts-mc( 0/ 4): Total exploration time 148.960 sec (148.960 sec minimum, 148.960 sec on average)
pnml2lts-mc( 0/ 4): States per second: 225237, Transitions per second: 2067263
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.5MB, 8.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.5MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-06-LTLFireability-06
ltl formula formula --ltl=/tmp/7740/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 244 transitions and 722 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7740/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7740/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7740/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7740/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 322, there are 277 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~87 levels ~10000 states ~47564 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~20000 states ~101656 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~40000 states ~222784 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~80000 states ~484488 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~160000 states ~1014092 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~320000 states ~2161508 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~640000 states ~4613708 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~1280000 states ~9663020 transitions
pnml2lts-mc( 1/ 4): ~86 levels ~2560000 states ~20172772 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~5120000 states ~42848036 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~10240000 states ~81676528 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~20480000 states ~172304276 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553240
pnml2lts-mc( 0/ 4): unique states count: 33553505
pnml2lts-mc( 0/ 4): unique transitions count: 311905863
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 278351437
pnml2lts-mc( 0/ 4): - claim found count: 8
pnml2lts-mc( 0/ 4): - claim success count: 33553518
pnml2lts-mc( 0/ 4): - cum. max stack depth: 358
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553518 states 311905892 transitions, fanout: 9.296
pnml2lts-mc( 0/ 4): Total exploration time 147.630 sec (147.630 sec minimum, 147.630 sec on average)
pnml2lts-mc( 0/ 4): States per second: 227281, Transitions per second: 2112754
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.2MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.2MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-06-LTLFireability-09
ltl formula formula --ltl=/tmp/7740/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 244 transitions and 722 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7740/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7740/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7740/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7740/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 322, there are 303 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~87!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 99
pnml2lts-mc( 0/ 4): unique states count: 328
pnml2lts-mc( 0/ 4): unique transitions count: 1308
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 342
pnml2lts-mc( 0/ 4): - cum. max stack depth: 239
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 342 states 1358 transitions, fanout: 3.971
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 34200, Transitions per second: 135800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 23.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-06-LTLFireability-11
ltl formula formula --ltl=/tmp/7740/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 244 transitions and 722 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7740/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7740/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7740/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7740/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 322, there are 299 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~87 levels ~10000 states ~45040 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~20000 states ~99968 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~40000 states ~190572 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~80000 states ~416600 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~160000 states ~907256 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~320000 states ~1920120 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~640000 states ~4158808 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~1280000 states ~9246140 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~2560000 states ~18731812 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~5120000 states ~39997336 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~10240000 states ~86540196 transitions
pnml2lts-mc( 3/ 4): ~87 levels ~20480000 states ~183069476 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552980
pnml2lts-mc( 0/ 4): unique states count: 33553237
pnml2lts-mc( 0/ 4): unique transitions count: 307689489
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 274135097
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 33553246
pnml2lts-mc( 0/ 4): - cum. max stack depth: 346
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553246 states 307689511 transitions, fanout: 9.170
pnml2lts-mc( 0/ 4): Total exploration time 159.970 sec (159.950 sec minimum, 159.958 sec on average)
pnml2lts-mc( 0/ 4): States per second: 209747, Transitions per second: 1923420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.0MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.0MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-06-LTLFireability-15
ltl formula formula --ltl=/tmp/7740/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 244 transitions and 722 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7740/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7740/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7740/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7740/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 322, there are 289 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~111 levels ~10000 states ~45428 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~20000 states ~100292 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~40000 states ~210380 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~80000 states ~451028 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~160000 states ~953636 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~320000 states ~2057704 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~640000 states ~4443676 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~1280000 states ~9354524 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~2560000 states ~19901900 transitions
pnml2lts-mc( 2/ 4): ~86 levels ~5120000 states ~43043328 transitions
pnml2lts-mc( 2/ 4): ~86 levels ~10240000 states ~91074072 transitions
pnml2lts-mc( 1/ 4): ~87 levels ~20480000 states ~187428980 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 29776560
pnml2lts-mc( 0/ 4): unique states count: 33552891
pnml2lts-mc( 0/ 4): unique transitions count: 312171625
pnml2lts-mc( 0/ 4): - self-loop count: 158
pnml2lts-mc( 0/ 4): - claim dead count: 277106673
pnml2lts-mc( 0/ 4): - claim found count: 1510349
pnml2lts-mc( 0/ 4): - claim success count: 33552901
pnml2lts-mc( 0/ 4): - cum. max stack depth: 612
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552901 states 312171654 transitions, fanout: 9.304
pnml2lts-mc( 0/ 4): Total exploration time 144.630 sec (144.600 sec minimum, 144.608 sec on average)
pnml2lts-mc( 0/ 4): States per second: 231991, Transitions per second: 2158416
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.6MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.6MB (~256.0MB paged-in)

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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399600492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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