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-171620399700539.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-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 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 146K 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-12-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717225689447

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:08:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:08:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:08:10] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-01 07:08:10] [INFO ] Transformed 586 places.
[2024-06-01 07:08:10] [INFO ] Transformed 525 transitions.
[2024-06-01 07:08:10] [INFO ] Found NUPN structural information;
[2024-06-01 07:08:10] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 580 transition count 521
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 80 place count 502 transition count 443
Iterating global reduction 1 with 78 rules applied. Total rules applied 158 place count 502 transition count 443
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 198 place count 462 transition count 403
Iterating global reduction 1 with 40 rules applied. Total rules applied 238 place count 462 transition count 403
Applied a total of 238 rules in 118 ms. Remains 462 /582 variables (removed 120) and now considering 403/521 (removed 118) transitions.
// Phase 1: matrix 403 rows 462 cols
[2024-06-01 07:08:11] [INFO ] Computed 96 invariants in 26 ms
[2024-06-01 07:08:11] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 07:08:11] [INFO ] Invariant cache hit.
[2024-06-01 07:08:12] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2024-06-01 07:08:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 2/462 variables, 53/92 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 7 ms to minimize.
[2024-06-01 07:08:20] [INFO ] Deduced a trap composed of 72 places in 246 ms of which 5 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 85 places in 479 ms of which 3 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 25 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 8 ms to minimize.
[2024-06-01 07:08:21] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 9 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD385 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/116 constraints. Problems are: Problem set: 7 solved, 395 unsolved
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/136 constraints. Problems are: Problem set: 7 solved, 395 unsolved
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/156 constraints. Problems are: Problem set: 22 solved, 380 unsolved
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 20/176 constraints. Problems are: Problem set: 22 solved, 380 unsolved
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 9 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 20/196 constraints. Problems are: Problem set: 27 solved, 375 unsolved
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 14 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 20/216 constraints. Problems are: Problem set: 27 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/865 variables, and 216 constraints, problems are : Problem set: 27 solved, 375 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/462 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 27 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 39/39 constraints. Problems are: Problem set: 27 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/39 constraints. Problems are: Problem set: 27 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 2/462 variables, 53/92 constraints. Problems are: Problem set: 27 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 4/96 constraints. Problems are: Problem set: 27 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 120/216 constraints. Problems are: Problem set: 27 solved, 375 unsolved
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
Problem TDEAD384 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/236 constraints. Problems are: Problem set: 28 solved, 374 unsolved
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 4 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 6 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/256 constraints. Problems are: Problem set: 28 solved, 374 unsolved
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 20/276 constraints. Problems are: Problem set: 33 solved, 369 unsolved
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 20/296 constraints. Problems are: Problem set: 33 solved, 369 unsolved
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 20/316 constraints. Problems are: Problem set: 33 solved, 369 unsolved
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 14 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 20/336 constraints. Problems are: Problem set: 33 solved, 369 unsolved
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 3 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 6 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 20/356 constraints. Problems are: Problem set: 33 solved, 369 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 20/376 constraints. Problems are: Problem set: 33 solved, 369 unsolved
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [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 30 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
SMT process timed out in 60306ms, After SMT, problems are : Problem set: 33 solved, 369 unsolved
Search for dead transitions found 33 dead transitions in 60334ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 462/582 places, 370/521 transitions.
Applied a total of 0 rules in 20 ms. Remains 462 /462 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61379 ms. Remains : 462/582 places, 370/521 transitions.
Support contains 25 out of 462 places after structural reductions.
[2024-06-01 07:09:12] [INFO ] Flatten gal took : 115 ms
[2024-06-01 07:09:12] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:09:12] [INFO ] Input system was already deterministic with 370 transitions.
RANDOM walk for 40000 steps (288 resets) in 1796 ms. (22 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40003 steps (53 resets) in 203 ms. (196 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (54 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (44 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (50 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (51 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
// Phase 1: matrix 370 rows 462 cols
[2024-06-01 07:09:14] [INFO ] Computed 102 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 216/332 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 127/459 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 16 places in 956 ms of which 43 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 4 ms to minimize.
SMT process timed out in 5105ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 370/370 transitions.
Graph (trivial) has 206 edges and 462 vertex of which 6 / 462 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 969 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 455 transition count 316
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 409 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 408 transition count 315
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 96 place count 408 transition count 220
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 303 place count 296 transition count 220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 306 place count 293 transition count 217
Iterating global reduction 3 with 3 rules applied. Total rules applied 309 place count 293 transition count 217
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 545 place count 171 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 170 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 549 place count 170 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 551 place count 168 transition count 105
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 556 place count 168 transition count 105
Applied a total of 556 rules in 137 ms. Remains 168 /462 variables (removed 294) and now considering 105/370 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 168/462 places, 105/370 transitions.
RANDOM walk for 33844 steps (958 resets) in 415 ms. (81 steps per ms) remains 0/6 properties
FORMULA BusinessProcesses-PT-12-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 447 stabilizing places and 355 stable transitions
Graph (complete) has 976 edges and 462 vertex of which 460 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 455 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 455 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 454 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 454 transition count 363
Applied a total of 15 rules in 50 ms. Remains 454 /462 variables (removed 8) and now considering 363/370 (removed 7) transitions.
// Phase 1: matrix 363 rows 454 cols
[2024-06-01 07:09:19] [INFO ] Computed 101 invariants in 22 ms
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-01 07:09:20] [INFO ] Invariant cache hit.
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants and state equation in 399 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 850 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 451/462 places, 363/370 transitions.
Applied a total of 0 rules in 9 ms. Remains 451 /451 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 910 ms. Remains : 451/462 places, 363/370 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-00
Product exploration explored 100000 steps with 25000 reset in 316 ms.
Product exploration explored 100000 steps with 25000 reset in 169 ms.
Computed a total of 436 stabilizing places and 348 stable transitions
Graph (complete) has 951 edges and 451 vertex of which 450 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 436 stabilizing places and 348 stable transitions
Detected a total of 436/451 stabilizing places and 348/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (292 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (54 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 978138 steps, run visited all 1 properties in 2812 ms. (steps per millisecond=347 )
Probabilistic random walk after 978138 steps, saw 148406 distinct states, run finished after 2815 ms. (steps per millisecond=347 ) properties seen :1
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 363/363 transitions.
Applied a total of 0 rules in 22 ms. Remains 451 /451 variables (removed 0) and now considering 363/363 (removed 0) transitions.
// Phase 1: matrix 363 rows 451 cols
[2024-06-01 07:09:25] [INFO ] Computed 98 invariants in 3 ms
[2024-06-01 07:09:25] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-06-01 07:09:25] [INFO ] Invariant cache hit.
[2024-06-01 07:09:26] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-06-01 07:09:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 107 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 117 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 124 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:09:55] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 30111ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 30115ms
Finished structural reductions in LTL mode , in 1 iterations and 31240 ms. Remains : 451/451 places, 363/363 transitions.
Computed a total of 436 stabilizing places and 348 stable transitions
Graph (complete) has 951 edges and 451 vertex of which 450 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 436 stabilizing places and 348 stable transitions
Detected a total of 436/451 stabilizing places and 348/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (288 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (56 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 978138 steps, run visited all 1 properties in 2776 ms. (steps per millisecond=352 )
Probabilistic random walk after 978138 steps, saw 148406 distinct states, run finished after 2778 ms. (steps per millisecond=352 ) properties seen :1
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 451 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 451/451 places, 363/363 transitions.
Graph (trivial) has 204 edges and 451 vertex of which 6 / 451 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 945 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 445 transition count 356
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 69 Pre rules applied. Total rules applied 46 place count 445 transition count 405
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 115 place count 445 transition count 405
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 429 transition count 374
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 429 transition count 374
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 294 place count 429 transition count 374
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 327 place count 396 transition count 341
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 360 place count 396 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 396 transition count 355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 395 transition count 353
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 395 transition count 353
Deduced a syphon composed of 211 places in 0 ms
Applied a total of 363 rules in 187 ms. Remains 395 /451 variables (removed 56) and now considering 353/363 (removed 10) transitions.
[2024-06-01 07:10:00] [INFO ] Redundant transitions in 28 ms returned []
Running 352 sub problems to find dead transitions.
// Phase 1: matrix 353 rows 395 cols
[2024-06-01 07:10:00] [INFO ] Computed 98 invariants in 10 ms
[2024-06-01 07:10:00] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 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
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 4 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 5 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 22 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 26 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem 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 TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 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 TDEAD40 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 20/118 constraints. Problems are: Problem set: 149 solved, 203 unsolved
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 13 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 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 TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 20/138 constraints. Problems are: Problem set: 209 solved, 143 unsolved
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 11 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD278 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 20/158 constraints. Problems are: Problem set: 234 solved, 118 unsolved
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 20/178 constraints. Problems are: Problem set: 242 solved, 110 unsolved
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
Problem TDEAD163 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 20/198 constraints. Problems are: Problem set: 247 solved, 105 unsolved
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 9/207 constraints. Problems are: Problem set: 247 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/207 constraints. Problems are: Problem set: 247 solved, 105 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD213 is UNSAT
At refinement iteration 11 (OVERLAPS) 352/747 variables, 395/602 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/747 variables, 17/619 constraints. Problems are: Problem set: 256 solved, 96 unsolved
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/747 variables, 2/621 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/747 variables, 0/621 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 1/748 variables, 1/622 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/748 variables, 0/622 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 17 (OVERLAPS) 0/748 variables, 0/622 constraints. Problems are: Problem set: 256 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 622 constraints, problems are : Problem set: 256 solved, 96 unsolved in 26305 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 395/395 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 256 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 164/347 variables, 54/54 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 2/56 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 111/167 constraints. Problems are: Problem set: 256 solved, 96 unsolved
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 19/186 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/186 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 46/393 variables, 42/228 constraints. Problems are: Problem set: 256 solved, 96 unsolved
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 7/235 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/235 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 352/745 variables, 393/628 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 17/645 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/745 variables, 96/741 constraints. Problems are: Problem set: 256 solved, 96 unsolved
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/745 variables, 2/743 constraints. Problems are: Problem set: 256 solved, 96 unsolved
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/745 variables, 4/747 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/745 variables, 0/747 constraints. Problems are: Problem set: 256 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 2/747 variables, 2/749 constraints. Problems are: Problem set: 256 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 749 constraints, problems are : Problem set: 256 solved, 96 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 395/395 constraints, ReadFeed: 17/18 constraints, PredecessorRefiner: 96/352 constraints, Known Traps: 143/143 constraints]
After SMT, in 56572ms problems are : Problem set: 256 solved, 96 unsolved
Search for dead transitions found 256 dead transitions in 56578ms
Found 256 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 256 transitions
Dead transitions reduction (with SMT) removed 256 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 395/451 places, 97/363 transitions.
Graph (complete) has 712 edges and 395 vertex of which 184 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.1 ms
Discarding 211 places :
Also discarding 0 output transitions
Ensure Unique test removed 29 places
Applied a total of 1 rules in 6 ms. Remains 155 /395 variables (removed 240) and now considering 97/97 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/451 places, 97/363 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56814 ms. Remains : 155/451 places, 97/363 transitions.
Support contains 2 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 363/363 transitions.
Applied a total of 0 rules in 6 ms. Remains 451 /451 variables (removed 0) and now considering 363/363 (removed 0) transitions.
// Phase 1: matrix 363 rows 451 cols
[2024-06-01 07:10:57] [INFO ] Computed 98 invariants in 5 ms
[2024-06-01 07:10:57] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 07:10:57] [INFO ] Invariant cache hit.
[2024-06-01 07:10:58] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-06-01 07:10:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 124 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30074ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 30079ms
Finished structural reductions in LTL mode , in 1 iterations and 30747 ms. Remains : 451/451 places, 363/363 transitions.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-00 finished in 128507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Graph (trivial) has 212 edges and 462 vertex of which 6 / 462 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 970 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 454 transition count 313
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 405 transition count 313
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 100 place count 405 transition count 217
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 310 place count 291 transition count 217
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 316 place count 285 transition count 211
Iterating global reduction 2 with 6 rules applied. Total rules applied 322 place count 285 transition count 211
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 562 place count 160 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 566 place count 158 transition count 99
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 572 place count 158 transition count 99
Applied a total of 572 rules in 66 ms. Remains 158 /462 variables (removed 304) and now considering 99/370 (removed 271) transitions.
// Phase 1: matrix 99 rows 158 cols
[2024-06-01 07:11:28] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 07:11:28] [INFO ] Implicit Places using invariants in 556 ms returned [1, 2, 5, 6, 23, 24, 25, 26, 35, 36, 37, 42, 43, 44, 45, 46, 47, 48, 49]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 557 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/462 places, 99/370 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 628 ms. Remains : 139/462 places, 99/370 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-01 finished in 722 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 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Graph (trivial) has 210 edges and 462 vertex of which 6 / 462 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 970 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 454 transition count 314
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 406 transition count 314
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 98 place count 406 transition count 217
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 310 place count 291 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 314 place count 287 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 318 place count 287 transition count 213
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 562 place count 160 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 566 place count 158 transition count 99
Applied a total of 566 rules in 42 ms. Remains 158 /462 variables (removed 304) and now considering 99/370 (removed 271) transitions.
// Phase 1: matrix 99 rows 158 cols
[2024-06-01 07:11:29] [INFO ] Computed 73 invariants in 9 ms
[2024-06-01 07:11:29] [INFO ] Implicit Places using invariants in 180 ms returned [1, 2, 5, 6, 23, 24, 25, 26, 33, 34, 35, 40, 41, 42, 43, 44, 45, 46, 47]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 190 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/462 places, 99/370 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 139/462 places, 99/370 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-02 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 364
Applied a total of 13 rules in 18 ms. Remains 455 /462 variables (removed 7) and now considering 364/370 (removed 6) transitions.
// Phase 1: matrix 364 rows 455 cols
[2024-06-01 07:11:29] [INFO ] Computed 101 invariants in 2 ms
[2024-06-01 07:11:29] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 07:11:29] [INFO ] Invariant cache hit.
[2024-06-01 07:11:29] [INFO ] Implicit Places using invariants and state equation in 479 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 744 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 364/370 transitions.
Applied a total of 0 rules in 5 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 769 ms. Remains : 452/462 places, 364/370 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-05 finished in 853 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((F(p0)&&G((X(G(p1))||F(p2))))))'
Support contains 5 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 364
Applied a total of 13 rules in 17 ms. Remains 455 /462 variables (removed 7) and now considering 364/370 (removed 6) transitions.
// Phase 1: matrix 364 rows 455 cols
[2024-06-01 07:11:30] [INFO ] Computed 101 invariants in 5 ms
[2024-06-01 07:11:30] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 07:11:30] [INFO ] Invariant cache hit.
[2024-06-01 07:11:30] [INFO ] Implicit Places using invariants and state equation in 351 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 554 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 364/370 transitions.
Applied a total of 0 rules in 5 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 452/462 places, 364/370 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-06
Product exploration explored 100000 steps with 1815 reset in 228 ms.
Product exploration explored 100000 steps with 1804 reset in 212 ms.
Computed a total of 437 stabilizing places and 349 stable transitions
Graph (complete) has 952 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 437 stabilizing places and 349 stable transitions
Detected a total of 437/452 stabilizing places and 349/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 778 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
RANDOM walk for 5274 steps (36 resets) in 21 ms. (239 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2 p0)))]
Knowledge based reduction with 17 factoid took 1653 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Support contains 5 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 364/364 transitions.
Applied a total of 0 rules in 7 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
// Phase 1: matrix 364 rows 452 cols
[2024-06-01 07:11:34] [INFO ] Computed 98 invariants in 5 ms
[2024-06-01 07:11:34] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 07:11:34] [INFO ] Invariant cache hit.
[2024-06-01 07:11:34] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-01 07:11:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 4 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 8 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30149ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 30152ms
Finished structural reductions in LTL mode , in 1 iterations and 30795 ms. Remains : 452/452 places, 364/364 transitions.
Computed a total of 437 stabilizing places and 349 stable transitions
Graph (complete) has 952 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 437 stabilizing places and 349 stable transitions
Detected a total of 437/452 stabilizing places and 349/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 708 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
RANDOM walk for 5510 steps (39 resets) in 21 ms. (250 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2 p0)))]
Knowledge based reduction with 17 factoid took 2153 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Product exploration explored 100000 steps with 1812 reset in 154 ms.
Product exploration explored 100000 steps with 1795 reset in 316 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Support contains 5 out of 452 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 452/452 places, 364/364 transitions.
Graph (trivial) has 203 edges and 452 vertex of which 6 / 452 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 946 edges and 447 vertex of which 446 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 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 446 transition count 357
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 47 place count 446 transition count 406
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 446 transition count 406
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 430 transition count 375
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 430 transition count 375
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 241 places in 0 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 291 place count 430 transition count 375
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 325 place count 396 transition count 341
Deduced a syphon composed of 207 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 359 place count 396 transition count 341
Deduced a syphon composed of 207 places in 0 ms
Applied a total of 359 rules in 49 ms. Remains 396 /452 variables (removed 56) and now considering 341/364 (removed 23) transitions.
[2024-06-01 07:12:09] [INFO ] Redundant transitions in 3 ms returned []
Running 340 sub problems to find dead transitions.
// Phase 1: matrix 341 rows 396 cols
[2024-06-01 07:12:09] [INFO ] Computed 98 invariants in 6 ms
[2024-06-01 07:12:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 4 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
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 TDEAD30 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 8 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem 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 TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 20/118 constraints. Problems are: Problem set: 121 solved, 219 unsolved
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 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 TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 20/138 constraints. Problems are: Problem set: 176 solved, 164 unsolved
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/158 constraints. Problems are: Problem set: 216 solved, 124 unsolved
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 20/178 constraints. Problems are: Problem set: 226 solved, 114 unsolved
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD191 is UNSAT
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 20/198 constraints. Problems are: Problem set: 233 solved, 107 unsolved
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
Problem TDEAD261 is UNSAT
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD265 is UNSAT
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 19/217 constraints. Problems are: Problem set: 235 solved, 105 unsolved
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 3/220 constraints. Problems are: Problem set: 235 solved, 105 unsolved
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/221 constraints. Problems are: Problem set: 235 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/221 constraints. Problems are: Problem set: 235 solved, 105 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 13 (OVERLAPS) 340/736 variables, 396/617 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 11/628 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/628 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 1/737 variables, 1/629 constraints. Problems are: Problem set: 244 solved, 96 unsolved
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 1/630 constraints. Problems are: Problem set: 244 solved, 96 unsolved
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/737 variables, 1/631 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/737 variables, 0/631 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 20 (OVERLAPS) 0/737 variables, 0/631 constraints. Problems are: Problem set: 244 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 737/737 variables, and 631 constraints, problems are : Problem set: 244 solved, 96 unsolved in 27551 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 396/396 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 244 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 159/347 variables, 54/54 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 125/179 constraints. Problems are: Problem set: 244 solved, 96 unsolved
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 20/199 constraints. Problems are: Problem set: 244 solved, 96 unsolved
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 10/209 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/209 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 47/394 variables, 44/253 constraints. Problems are: Problem set: 244 solved, 96 unsolved
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 4/257 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/257 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 340/734 variables, 394/651 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 11/662 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/734 variables, 96/758 constraints. Problems are: Problem set: 244 solved, 96 unsolved
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/734 variables, 1/759 constraints. Problems are: Problem set: 244 solved, 96 unsolved
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/734 variables, 1/760 constraints. Problems are: Problem set: 244 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/734 variables, 0/760 constraints. Problems are: Problem set: 244 solved, 96 unsolved
SMT process timed out in 57802ms, After SMT, problems are : Problem set: 244 solved, 96 unsolved
Search for dead transitions found 244 dead transitions in 57807ms
Found 244 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 244 transitions
Dead transitions reduction (with SMT) removed 244 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 396/452 places, 97/364 transitions.
Graph (complete) has 709 edges and 396 vertex of which 189 are kept as prefixes of interest. Removing 207 places using SCC suffix rule.3 ms
Discarding 207 places :
Also discarding 0 output transitions
Ensure Unique test removed 31 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 158 transition count 109
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 25 ms. Remains 158 /396 variables (removed 238) and now considering 109/97 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/452 places, 109/364 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57898 ms. Remains : 158/452 places, 109/364 transitions.
Support contains 5 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 364/364 transitions.
Applied a total of 0 rules in 11 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
// Phase 1: matrix 364 rows 452 cols
[2024-06-01 07:13:07] [INFO ] Computed 98 invariants in 6 ms
[2024-06-01 07:13:07] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 07:13:07] [INFO ] Invariant cache hit.
[2024-06-01 07:13:08] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-01 07:13:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 86 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 2.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 2.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 1.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 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.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 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/816 variables, and 234 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 136/136 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/94 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 136/234 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 6 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 60124ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 60845 ms. Remains : 452/452 places, 364/364 transitions.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-06 finished in 158246 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((X(X(p1))||p0))))'
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 364
Applied a total of 13 rules in 30 ms. Remains 455 /462 variables (removed 7) and now considering 364/370 (removed 6) transitions.
// Phase 1: matrix 364 rows 455 cols
[2024-06-01 07:14:08] [INFO ] Computed 101 invariants in 4 ms
[2024-06-01 07:14:08] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 07:14:08] [INFO ] Invariant cache hit.
[2024-06-01 07:14:09] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 793 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 364/370 transitions.
Applied a total of 0 rules in 8 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 831 ms. Remains : 452/462 places, 364/370 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Computed a total of 437 stabilizing places and 349 stable transitions
Graph (complete) has 952 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 437 stabilizing places and 349 stable transitions
Detected a total of 437/452 stabilizing places and 349/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 24 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-07 finished in 1469 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(F(p0))&&(G(F(!p1))||(F(!p1)&&F(G(p2)))))))'
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 455 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 455 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 454 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 454 transition count 363
Applied a total of 15 rules in 23 ms. Remains 454 /462 variables (removed 8) and now considering 363/370 (removed 7) transitions.
// Phase 1: matrix 363 rows 454 cols
[2024-06-01 07:14:09] [INFO ] Computed 101 invariants in 16 ms
[2024-06-01 07:14:10] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-01 07:14:10] [INFO ] Invariant cache hit.
[2024-06-01 07:14:10] [INFO ] Implicit Places using invariants and state equation in 440 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 686 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 451/462 places, 363/370 transitions.
Applied a total of 0 rules in 7 ms. Remains 451 /451 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 716 ms. Remains : 451/462 places, 363/370 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), p1, (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-08
Product exploration explored 100000 steps with 1452 reset in 245 ms.
Stack based approach found an accepted trace after 8984 steps with 122 reset with depth 6 and stack size 6 in 26 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-08 finished in 1258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Graph (trivial) has 210 edges and 462 vertex of which 6 / 462 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 970 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 454 transition count 314
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 406 transition count 314
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 98 place count 406 transition count 217
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 309 place count 292 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 314 place count 287 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 319 place count 287 transition count 212
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 561 place count 161 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 565 place count 159 transition count 99
Applied a total of 565 rules in 31 ms. Remains 159 /462 variables (removed 303) and now considering 99/370 (removed 271) transitions.
// Phase 1: matrix 99 rows 159 cols
[2024-06-01 07:14:11] [INFO ] Computed 74 invariants in 2 ms
[2024-06-01 07:14:11] [INFO ] Implicit Places using invariants in 315 ms returned [1, 2, 3, 6, 7, 24, 25, 26, 27, 34, 35, 36, 41, 42, 43, 44, 45, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 319 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/462 places, 99/370 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 356 ms. Remains : 140/462 places, 99/370 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-09
Stuttering criterion allowed to conclude after 258 steps with 59 reset in 3 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-09 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 364
Applied a total of 13 rules in 66 ms. Remains 455 /462 variables (removed 7) and now considering 364/370 (removed 6) transitions.
// Phase 1: matrix 364 rows 455 cols
[2024-06-01 07:14:11] [INFO ] Computed 101 invariants in 3 ms
[2024-06-01 07:14:11] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 07:14:11] [INFO ] Invariant cache hit.
[2024-06-01 07:14:12] [INFO ] Implicit Places using invariants and state equation in 473 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 745 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 364/370 transitions.
Applied a total of 0 rules in 7 ms. Remains 452 /452 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 819 ms. Remains : 452/462 places, 364/370 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-11 finished in 963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : BusinessProcesses-PT-12-LTLCardinality-00
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Graph (trivial) has 212 edges and 462 vertex of which 6 / 462 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 970 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 454 transition count 314
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 406 transition count 314
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 98 place count 406 transition count 215
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 314 place count 289 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 283 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 283 transition count 209
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 558 place count 163 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 562 place count 161 transition count 100
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 568 place count 161 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 569 place count 160 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 570 place count 159 transition count 99
Applied a total of 570 rules in 36 ms. Remains 159 /462 variables (removed 303) and now considering 99/370 (removed 271) transitions.
// Phase 1: matrix 99 rows 159 cols
[2024-06-01 07:14:12] [INFO ] Computed 74 invariants in 1 ms
[2024-06-01 07:14:12] [INFO ] Implicit Places using invariants in 113 ms returned [30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 149, 151]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 114 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 146/462 places, 99/370 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 154 ms. Remains : 146/462 places, 99/370 transitions.
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-00
Product exploration explored 100000 steps with 27591 reset in 354 ms.
Product exploration explored 100000 steps with 27544 reset in 221 ms.
Computed a total of 146 stabilizing places and 98 stable transitions
Computed a total of 146 stabilizing places and 98 stable transitions
Detected a total of 146/146 stabilizing places and 98/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9093 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2443 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 950 steps, run visited all 1 properties in 7 ms. (steps per millisecond=135 )
Probabilistic random walk after 950 steps, saw 363 distinct states, run finished after 7 ms. (steps per millisecond=135 ) properties seen :1
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 146 cols
[2024-06-01 07:14:14] [INFO ] Computed 61 invariants in 1 ms
[2024-06-01 07:14:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 07:14:14] [INFO ] Invariant cache hit.
[2024-06-01 07:14:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:14:14] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [9, 10, 11, 30, 32, 34, 36, 41, 48, 50, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 124, 132, 136]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 279 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/146 places, 99/99 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 94
Applied a total of 8 rules in 2 ms. Remains 108 /112 variables (removed 4) and now considering 94/99 (removed 5) transitions.
// Phase 1: matrix 94 rows 108 cols
[2024-06-01 07:14:14] [INFO ] Computed 27 invariants in 1 ms
[2024-06-01 07:14:14] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 07:14:14] [INFO ] Invariant cache hit.
[2024-06-01 07:14:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:14:14] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/146 places, 94/99 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 494 ms. Remains : 108/146 places, 94/99 transitions.
Computed a total of 108 stabilizing places and 93 stable transitions
Graph (complete) has 300 edges and 108 vertex of which 105 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Computed a total of 108 stabilizing places and 93 stable transitions
Detected a total of 108/108 stabilizing places and 93/94 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9131 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2486 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 920 steps, run visited all 1 properties in 6 ms. (steps per millisecond=153 )
Probabilistic random walk after 920 steps, saw 351 distinct states, run finished after 6 ms. (steps per millisecond=153 ) properties seen :1
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27574 reset in 119 ms.
Product exploration explored 100000 steps with 27592 reset in 99 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 94/94 transitions.
Graph (complete) has 300 edges and 108 vertex of which 105 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 105 transition count 93
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 105 transition count 95
Deduced a syphon composed of 19 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 105 transition count 93
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 22 rules in 8 ms. Remains 105 /108 variables (removed 3) and now considering 93/94 (removed 1) transitions.
[2024-06-01 07:14:16] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
// Phase 1: matrix 93 rows 105 cols
[2024-06-01 07:14:16] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 07:14:16] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD21 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 11/42 constraints. Problems are: Problem set: 19 solved, 68 unsolved
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/43 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/43 constraints. Problems are: Problem set: 20 solved, 67 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 10 (OVERLAPS) 92/196 variables, 104/147 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 9/156 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/156 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 1/197 variables, 1/157 constraints. Problems are: Problem set: 23 solved, 64 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 2/159 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/159 constraints. Problems are: Problem set: 23 solved, 64 unsolved
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/197 variables, 1/160 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/197 variables, 0/160 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 18 (OVERLAPS) 0/197 variables, 0/160 constraints. Problems are: Problem set: 23 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/198 variables, and 160 constraints, problems are : Problem set: 23 solved, 64 unsolved in 4097 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 105/105 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 23 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 4/8 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 18/26 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/26 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 18/102 variables, 10/36 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/39 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/42 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/42 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 2/104 variables, 4/46 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/46 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 92/196 variables, 104/150 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 9/159 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 64/223 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/223 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 1/197 variables, 1/224 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/224 constraints. Problems are: Problem set: 23 solved, 64 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/224 constraints. Problems are: Problem set: 23 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/198 variables, and 224 constraints, problems are : Problem set: 23 solved, 64 unsolved in 2653 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 105/105 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 64/87 constraints, Known Traps: 21/21 constraints]
After SMT, in 6799ms problems are : Problem set: 23 solved, 64 unsolved
Search for dead transitions found 23 dead transitions in 6800ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 70/94 transitions.
Graph (complete) has 293 edges and 105 vertex of which 86 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 84 /105 variables (removed 21) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/108 places, 70/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6826 ms. Remains : 84/108 places, 70/94 transitions.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 94/94 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 108 cols
[2024-06-01 07:14:22] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 07:14:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 07:14:22] [INFO ] Invariant cache hit.
[2024-06-01 07:14:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:14:22] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-01 07:14:22] [INFO ] Invariant cache hit.
[2024-06-01 07:14:22] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 1/107 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 9 (OVERLAPS) 93/200 variables, 107/145 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 4/149 constraints. Problems are: Problem set: 3 solved, 85 unsolved
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 6/155 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 1/201 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 85 unsolved
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 4/160 constraints. Problems are: Problem set: 3 solved, 85 unsolved
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 1/161 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 17 (OVERLAPS) 0/201 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/202 variables, and 161 constraints, problems are : Problem set: 3 solved, 85 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 108/108 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 3 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 10/16 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 17/33 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 1/107 variables, 8/41 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/44 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 5/49 constraints. Problems are: Problem set: 3 solved, 85 unsolved
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 93/200 variables, 107/157 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 4/161 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 85/246 constraints. Problems are: Problem set: 3 solved, 85 unsolved
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 4/250 constraints. Problems are: Problem set: 3 solved, 85 unsolved
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/251 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/251 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 15 (OVERLAPS) 1/201 variables, 1/252 constraints. Problems are: Problem set: 3 solved, 85 unsolved
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 2/254 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 85 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/202 variables, and 254 constraints, problems are : Problem set: 3 solved, 85 unsolved in 7095 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 108/108 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 85/88 constraints, Known Traps: 30/30 constraints]
After SMT, in 11531ms problems are : Problem set: 3 solved, 85 unsolved
Search for dead transitions found 3 dead transitions in 11533ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 91/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11689 ms. Remains : 108/108 places, 91/94 transitions.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-00 finished in 22053 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((F(p0)&&G((X(G(p1))||F(p2))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-12-LTLCardinality-06
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Support contains 5 out of 462 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 462/462 places, 370/370 transitions.
Graph (trivial) has 209 edges and 462 vertex of which 6 / 462 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 970 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 454 transition count 315
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 407 transition count 315
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 96 place count 407 transition count 218
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 308 place count 292 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 313 place count 287 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 318 place count 287 transition count 213
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 554 place count 164 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 558 place count 162 transition count 103
Applied a total of 558 rules in 36 ms. Remains 162 /462 variables (removed 300) and now considering 103/370 (removed 267) transitions.
// Phase 1: matrix 103 rows 162 cols
[2024-06-01 07:14:34] [INFO ] Computed 73 invariants in 2 ms
[2024-06-01 07:14:35] [INFO ] Implicit Places using invariants in 160 ms returned [1, 2, 5, 6, 23, 24, 25, 26, 33, 34, 35, 40, 41, 42, 43, 44, 45, 46, 47]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 173 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 143/462 places, 103/370 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 212 ms. Remains : 143/462 places, 103/370 transitions.
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-06
Stuttering criterion allowed to conclude after 51 steps with 6 reset in 0 ms.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-06 finished in 572 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 07:14:35] [INFO ] Flatten gal took : 34 ms
[2024-06-01 07:14:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:14:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 462 places, 370 transitions and 1116 arcs took 8 ms.
Total runtime 384533 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-12-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226075790

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-12-LTLCardinality-00
ltl formula formula --ltl=/tmp/5521/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 462 places, 370 transitions and 1116 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.070 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5521/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5521/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5521/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5521/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 463 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 463, there are 377 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 21 transitions, fanout: 1.500
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 84.4 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 373 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-12-LTLCardinality-06
ltl formula formula --ltl=/tmp/5521/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
pnml2lts-mc( 0/ 4): Petri net has 462 places, 370 transitions and 1116 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5521/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5521/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5521/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5521/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 462 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 463, there are 516 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):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 72
pnml2lts-mc( 0/ 4): unique states count: 396
pnml2lts-mc( 0/ 4): unique transitions count: 1797
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 403
pnml2lts-mc( 0/ 4): - cum. max stack depth: 332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 403 states 1820 transitions, fanout: 4.516
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20150, Transitions per second: 91000
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, 27.8 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 373 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)

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-12"
export BK_EXAMINATION="LTLCardinality"
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-12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399700539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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