Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398400539.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400539
=====================================================================

--------------------
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 1716305785133

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:36:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:36:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:36:26] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-21 15:36:26] [INFO ] Transformed 586 places.
[2024-05-21 15:36:26] [INFO ] Transformed 525 transitions.
[2024-05-21 15:36:26] [INFO ] Found NUPN structural information;
[2024-05-21 15:36:26] [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 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 8 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 127 ms. Remains 462 /582 variables (removed 120) and now considering 403/521 (removed 118) transitions.
// Phase 1: matrix 403 rows 462 cols
[2024-05-21 15:36:26] [INFO ] Computed 96 invariants in 26 ms
[2024-05-21 15:36:27] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-21 15:36:27] [INFO ] Invariant cache hit.
[2024-05-21 15:36:27] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2024-05-21 15:36:27] [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-05-21 15:36:36] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 10 ms to minimize.
[2024-05-21 15:36:36] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 5 ms to minimize.
[2024-05-21 15:36:36] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:36:36] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:36:36] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:36:36] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 5 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:36:37] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:36:38] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:36:38] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:36:38] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:36:38] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:36:38] [INFO ] Deduced a trap composed of 86 places in 108 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-05-21 15:36:38] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:36:38] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:36:38] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:36:39] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:36:39] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:36:39] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:36:39] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:36:39] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:36:39] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:36:39] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:36:40] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:36:40] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:36:40] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:36:40] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:36:40] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 6 ms to minimize.
[2024-05-21 15:36:40] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:36:40] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/136 constraints. Problems are: Problem set: 7 solved, 395 unsolved
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 4 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:36:42] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:36:43] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:36:43] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:36:43] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:36:43] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:36:43] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:36:43] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:36:43] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 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-05-21 15:36:46] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:36:46] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:36:46] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:36:46] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:36:46] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:36:46] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:36:46] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:36:47] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:36:48] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:36:48] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:36:48] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:36:48] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:36:48] [INFO ] Deduced a trap composed of 86 places in 94 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-05-21 15:36:48] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:36:49] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:36:50] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:36:50] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:36:50] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:36:50] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:36:50] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:36:50] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:36:50] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:36:51] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:36:51] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:36:51] [INFO ] Deduced a trap composed of 68 places in 109 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-05-21 15:36:51] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:36:51] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:36:51] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:36:51] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:36:51] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:36:52] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:36:52] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:36:52] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:36:52] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:36:52] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:36:52] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:36:53] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:36:54] [INFO ] Deduced a trap composed of 15 places in 123 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
[2024-05-21 15:36:57] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:36:57] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:36:57] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:36:57] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:36:57] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:36:57] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 27 solved, 375 unsolved
Search for dead transitions found 27 dead transitions in 30194ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 462/582 places, 376/521 transitions.
Applied a total of 0 rules in 9 ms. Remains 462 /462 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31251 ms. Remains : 462/582 places, 376/521 transitions.
Support contains 25 out of 462 places after structural reductions.
[2024-05-21 15:36:58] [INFO ] Flatten gal took : 59 ms
[2024-05-21 15:36:58] [INFO ] Flatten gal took : 35 ms
[2024-05-21 15:36:58] [INFO ] Input system was already deterministic with 376 transitions.
RANDOM walk for 40000 steps (291 resets) in 1309 ms. (30 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40003 steps (55 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (52 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (48 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
// Phase 1: matrix 376 rows 462 cols
[2024-05-21 15:36:58] [INFO ] Computed 98 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 111/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 211/333 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 123/456 variables, 43/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:36:59] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:36:59] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:36:59] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:36:59] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:36:59] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:36:59] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:37:00] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:37:00] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:37:00] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:37:00] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:37:00] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:37:00] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:37:00] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:37:01] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:37:01] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 4 ms to minimize.
[2024-05-21 15:37:01] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:37:01] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:37:01] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:37:01] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 4 ms to minimize.
[2024-05-21 15:37:02] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:37:02] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:37:02] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:37:02] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:37:02] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:37:02] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:37:02] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:37:03] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:37:04] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 5101ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 376/376 transitions.
Graph (trivial) has 204 edges and 462 vertex of which 6 / 462 are part of one of the 1 SCC in 3 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 981 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 455 transition count 323
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 410 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 409 transition count 322
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 94 place count 409 transition count 228
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 298 place count 299 transition count 228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 300 place count 297 transition count 226
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 297 transition count 226
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 536 place count 178 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 538 place count 177 transition count 115
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 540 place count 177 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 542 place count 175 transition count 113
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 547 place count 175 transition count 113
Applied a total of 547 rules in 102 ms. Remains 175 /462 variables (removed 287) and now considering 113/376 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 175/462 places, 113/376 transitions.
RANDOM walk for 21426 steps (583 resets) in 527 ms. (40 steps per ms) remains 0/7 properties
FORMULA BusinessProcesses-PT-12-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 447 stabilizing places and 361 stable transitions
Graph (complete) has 988 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, 376/376 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 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 455 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 455 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 454 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 454 transition count 369
Applied a total of 15 rules in 45 ms. Remains 454 /462 variables (removed 8) and now considering 369/376 (removed 7) transitions.
// Phase 1: matrix 369 rows 454 cols
[2024-05-21 15:37:04] [INFO ] Computed 97 invariants in 8 ms
[2024-05-21 15:37:04] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 15:37:04] [INFO ] Invariant cache hit.
[2024-05-21 15:37:05] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 687 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 451/462 places, 369/376 transitions.
Applied a total of 0 rules in 23 ms. Remains 451 /451 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 755 ms. Remains : 451/462 places, 369/376 transitions.
Stuttering acceptance computed with spot in 241 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 278 ms.
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Computed a total of 436 stabilizing places and 354 stable transitions
Graph (complete) has 963 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 354 stable transitions
Detected a total of 436/451 stabilizing places and 354/369 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 98 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)]
RANDOM walk for 40000 steps (289 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 978138 steps, run visited all 1 properties in 2413 ms. (steps per millisecond=405 )
Probabilistic random walk after 978138 steps, saw 148406 distinct states, run finished after 2417 ms. (steps per millisecond=404 ) 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 145 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 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 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, 369/369 transitions.
Applied a total of 0 rules in 7 ms. Remains 451 /451 variables (removed 0) and now considering 369/369 (removed 0) transitions.
// Phase 1: matrix 369 rows 451 cols
[2024-05-21 15:37:09] [INFO ] Computed 94 invariants in 5 ms
[2024-05-21 15:37:09] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 15:37:09] [INFO ] Invariant cache hit.
[2024-05-21 15:37:09] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-21 15:37:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:16] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:16] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:37:16] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:37:16] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:37:16] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:37:16] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:37:17] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:37:18] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:37:19] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:37:20] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:37:21] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:37:22] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:37:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:37:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:37:27] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:37:28] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 4 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:37:29] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:37:30] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 4 ms to minimize.
[2024-05-21 15:37:31] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:37:32] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:37:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:37:34] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:37:35] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:37:36] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:37:36] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:37:36] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/820 variables, and 214 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/451 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 120/214 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:37:43] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 4 ms to minimize.
[2024-05-21 15:37:44] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:37:45] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:37:46] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:37:47] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:37:48] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 4 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:37:49] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:37:50] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:37:51] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:37:52] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:37:53] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:37:54] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:37:55] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:37:56] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:37:57] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:37:57] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:37:58] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:37:59] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:38:00] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:38:00] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:38:00] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:38:01] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:38:02] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:38:03] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:38:04] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:38:05] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:38:06] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:38:07] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:38:07] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:38:07] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:08] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:09] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:38:10] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/820 variables, and 374 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/451 constraints, PredecessorRefiner: 0/368 constraints, Known Traps: 280/280 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in LTL mode , in 1 iterations and 60724 ms. Remains : 451/451 places, 369/369 transitions.
Computed a total of 436 stabilizing places and 354 stable transitions
Graph (complete) has 963 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 354 stable transitions
Detected a total of 436/451 stabilizing places and 354/369 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 74 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)]
RANDOM walk for 40000 steps (291 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 978138 steps, run visited all 1 properties in 2600 ms. (steps per millisecond=376 )
Probabilistic random walk after 978138 steps, saw 148406 distinct states, run finished after 2600 ms. (steps per millisecond=376 ) 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 102 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 103 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 132 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, 369/369 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 957 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 362
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 411
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 411
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 429 transition count 380
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 380
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 380
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 327 place count 396 transition count 347
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 347
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 361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 395 transition count 359
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 359
Deduced a syphon composed of 211 places in 0 ms
Applied a total of 363 rules in 127 ms. Remains 395 /451 variables (removed 56) and now considering 359/369 (removed 10) transitions.
[2024-05-21 15:38:14] [INFO ] Redundant transitions in 19 ms returned []
Running 358 sub problems to find dead transitions.
// Phase 1: matrix 359 rows 395 cols
[2024-05-21 15:38:14] [INFO ] Computed 94 invariants in 5 ms
[2024-05-21 15:38:14] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 54/92 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-21 15:38:20] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:38:20] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:38:20] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:38:20] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:38:20] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:38:20] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 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
Problem TDEAD16 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
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
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 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 TDEAD41 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 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 TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 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
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 20/114 constraints. Problems are: Problem set: 135 solved, 223 unsolved
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:38:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
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 TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 20/134 constraints. Problems are: Problem set: 194 solved, 164 unsolved
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-21 15:38:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:38:23] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
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 TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 20/154 constraints. Problems are: Problem set: 221 solved, 137 unsolved
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:38:24] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-05-21 15:38:25] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
Problem TDEAD234 is UNSAT
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:38:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 20/174 constraints. Problems are: Problem set: 229 solved, 129 unsolved
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD176 is UNSAT
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:38:27] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:38:28] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:38:28] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 12/186 constraints. Problems are: Problem set: 233 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/186 constraints. Problems are: Problem set: 233 solved, 125 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 10 (OVERLAPS) 358/753 variables, 395/581 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 17/598 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/753 variables, 0/598 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 1/754 variables, 1/599 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/754 variables, 0/599 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/754 variables, 0/599 constraints. Problems are: Problem set: 262 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 599 constraints, problems are : Problem set: 262 solved, 96 unsolved in 20964 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 395/395 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 262 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 164/347 variables, 54/54 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 2/56 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 92/148 constraints. Problems are: Problem set: 262 solved, 96 unsolved
[2024-05-21 15:38:36] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:38:36] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:38:36] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:38:36] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:38:36] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:38:36] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:38:36] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:38:37] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 20/168 constraints. Problems are: Problem set: 262 solved, 96 unsolved
[2024-05-21 15:38:38] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:38:39] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 3/171 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/171 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 46/393 variables, 38/209 constraints. Problems are: Problem set: 262 solved, 96 unsolved
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:38:40] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 3/212 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/212 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 358/751 variables, 393/605 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 17/622 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 96/718 constraints. Problems are: Problem set: 262 solved, 96 unsolved
[2024-05-21 15:38:45] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:38:45] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 6 ms to minimize.
[2024-05-21 15:38:45] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:38:46] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:38:47] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 5/723 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/751 variables, 0/723 constraints. Problems are: Problem set: 262 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 2/753 variables, 2/725 constraints. Problems are: Problem set: 262 solved, 96 unsolved
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:39:00] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/753 variables, 2/727 constraints. Problems are: Problem set: 262 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/754 variables, and 727 constraints, problems are : Problem set: 262 solved, 96 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 395/395 constraints, ReadFeed: 17/18 constraints, PredecessorRefiner: 96/358 constraints, Known Traps: 125/125 constraints]
After SMT, in 51244ms problems are : Problem set: 262 solved, 96 unsolved
Search for dead transitions found 262 dead transitions in 51249ms
Found 262 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 262 transitions
Dead transitions reduction (with SMT) removed 262 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 395/451 places, 97/369 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 9 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/369 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51413 ms. Remains : 155/451 places, 97/369 transitions.
Support contains 2 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 369/369 transitions.
Applied a total of 0 rules in 15 ms. Remains 451 /451 variables (removed 0) and now considering 369/369 (removed 0) transitions.
// Phase 1: matrix 369 rows 451 cols
[2024-05-21 15:39:05] [INFO ] Computed 94 invariants in 7 ms
[2024-05-21 15:39:05] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 15:39:05] [INFO ] Invariant cache hit.
[2024-05-21 15:39:06] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-21 15:39:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:23] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 3 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:39:33] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:39:33] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:39:33] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:39:33] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:33] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/820 variables, and 214 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/451 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 120/214 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:39] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:39:39] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 6 ms to minimize.
[2024-05-21 15:39:39] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 4 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:39:56] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:39:57] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:39:57] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:39:57] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:39:57] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:39:57] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:39:58] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:39:58] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:39:58] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:39:58] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:39:58] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:39:58] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:39:59] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:40:00] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:40:00] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:40:00] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:40:00] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:40:00] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:40:00] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:40:01] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:40:01] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:40:01] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:40:02] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:40:03] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 15:40:04] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:40:04] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:40:05] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:40:06] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:40:06] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:40:06] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:40:06] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/820 variables, and 369 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/451 constraints, PredecessorRefiner: 0/368 constraints, Known Traps: 275/275 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in LTL mode , in 1 iterations and 60863 ms. Remains : 451/451 places, 369/369 transitions.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-00 finished in 181935 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, 376/376 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 982 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 319
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 319
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 223
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 223
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 316 place count 285 transition count 217
Iterating global reduction 2 with 6 rules applied. Total rules applied 322 place count 285 transition count 217
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 6 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 558 place count 164 transition count 102
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 562 place count 162 transition count 105
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 162 transition count 105
Applied a total of 568 rules in 52 ms. Remains 162 /462 variables (removed 300) and now considering 105/376 (removed 271) transitions.
// Phase 1: matrix 105 rows 162 cols
[2024-05-21 15:40:06] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 15:40:06] [INFO ] Implicit Places using invariants in 131 ms returned [1, 2, 5, 6, 27, 28, 29, 30, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 133 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/462 places, 105/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 143 /143 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 143/462 places, 105/376 transitions.
Stuttering acceptance computed with spot in 34 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 246 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, 376/376 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 982 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 320
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 320
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 223
Deduced a syphon composed of 97 places in 1 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 223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 314 place count 287 transition count 219
Iterating global reduction 2 with 4 rules applied. Total rules applied 318 place count 287 transition count 219
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 6 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 558 place count 164 transition count 102
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 562 place count 162 transition count 105
Applied a total of 562 rules in 45 ms. Remains 162 /462 variables (removed 300) and now considering 105/376 (removed 271) transitions.
// Phase 1: matrix 105 rows 162 cols
[2024-05-21 15:40:06] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 15:40:06] [INFO ] Implicit Places using invariants in 130 ms returned [1, 2, 5, 6, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 130 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/462 places, 105/376 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 143/462 places, 105/376 transitions.
Stuttering acceptance computed with spot in 31 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 228 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, 376/376 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 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 370
Applied a total of 13 rules in 23 ms. Remains 455 /462 variables (removed 7) and now considering 370/376 (removed 6) transitions.
// Phase 1: matrix 370 rows 455 cols
[2024-05-21 15:40:07] [INFO ] Computed 97 invariants in 4 ms
[2024-05-21 15:40:07] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 15:40:07] [INFO ] Invariant cache hit.
[2024-05-21 15:40:07] [INFO ] Implicit Places using invariants and state equation in 512 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 682 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 370/376 transitions.
Applied a total of 0 rules in 6 ms. Remains 452 /452 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 713 ms. Remains : 452/462 places, 370/376 transitions.
Stuttering acceptance computed with spot in 71 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 795 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, 376/376 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 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 370
Applied a total of 13 rules in 19 ms. Remains 455 /462 variables (removed 7) and now considering 370/376 (removed 6) transitions.
// Phase 1: matrix 370 rows 455 cols
[2024-05-21 15:40:07] [INFO ] Computed 97 invariants in 4 ms
[2024-05-21 15:40:08] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 15:40:08] [INFO ] Invariant cache hit.
[2024-05-21 15:40:08] [INFO ] Implicit Places using invariants and state equation in 500 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 668 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 370/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 452 /452 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 452/462 places, 370/376 transitions.
Stuttering acceptance computed with spot in 245 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 1822 reset in 210 ms.
Product exploration explored 100000 steps with 1818 reset in 217 ms.
Computed a total of 437 stabilizing places and 355 stable transitions
Graph (complete) has 964 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 437 stabilizing places and 355 stable transitions
Detected a total of 437/452 stabilizing places and 355/370 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 779 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 220 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 4553 steps (33 resets) in 20 ms. (216 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 1758 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 212 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 220 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, 370/370 transitions.
Applied a total of 0 rules in 8 ms. Remains 452 /452 variables (removed 0) and now considering 370/370 (removed 0) transitions.
// Phase 1: matrix 370 rows 452 cols
[2024-05-21 15:40:12] [INFO ] Computed 94 invariants in 3 ms
[2024-05-21 15:40:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 15:40:12] [INFO ] Invariant cache hit.
[2024-05-21 15:40:13] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-05-21 15:40:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:19] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:40:19] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:40:19] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:40:20] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:40:21] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:22] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:40:23] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:40:23] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:40:23] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:40:23] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:40:23] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:40:23] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:40:24] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:40:25] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:40:25] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:40:25] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:40:25] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:27] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:40:27] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:40:27] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:40:27] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:40:28] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:40:29] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:40:30] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:40:30] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:40:33] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:40:34] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:40:34] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:36] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:40:36] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:40:36] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:40:36] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:40:37] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:40:37] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:40:37] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:40:37] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:40:37] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:40:37] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:40:38] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:40:38] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:39] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-05-21 15:40:40] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:40:40] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:40:40] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:40:40] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:40:41] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:40:41] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:40:41] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:40:41] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:40:41] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:40:42] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 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 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 3.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 2.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.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 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.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 0.0)
(s206 0.0)
(s207 1.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 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.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/822 variables, and 182 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 88/182 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:40:46] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:40:47] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:40:48] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:40:49] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:40:50] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 107 places in 189 ms of which 4 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:40:51] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:40:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:40:53] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:54] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:40:54] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:40:54] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:40:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:40:56] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:40:56] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:40:56] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:40:56] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:40:57] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 4 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:40:58] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:40:59] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:40:59] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:40:59] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:40:59] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:41:00] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:41:01] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:41:02] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:41:03] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:41:04] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:41:05] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:41:06] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:41:07] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:41:07] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:41:07] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:41:08] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:41:09] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:41:09] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:09] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:09] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:41:10] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 2 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:41:11] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:41:12] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:41:13] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:41:13] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 3 ms to minimize.
SMT process timed out in 60120ms, After SMT, problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 60740 ms. Remains : 452/452 places, 370/370 transitions.
Computed a total of 437 stabilizing places and 355 stable transitions
Graph (complete) has 964 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 437 stabilizing places and 355 stable transitions
Detected a total of 437/452 stabilizing places and 355/370 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 940 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 277 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 4119 steps (29 resets) in 37 ms. (108 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 1963 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 217 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 257 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 296 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 1800 reset in 256 ms.
Product exploration explored 100000 steps with 1814 reset in 219 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 285 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, 370/370 transitions.
Graph (trivial) has 203 edges and 452 vertex of which 6 / 452 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 958 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 363
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 412
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 446 transition count 412
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 430 transition count 381
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 430 transition count 381
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 381
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 325 place count 396 transition count 347
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 347
Deduced a syphon composed of 207 places in 0 ms
Applied a total of 359 rules in 71 ms. Remains 396 /452 variables (removed 56) and now considering 347/370 (removed 23) transitions.
[2024-05-21 15:41:18] [INFO ] Redundant transitions in 2 ms returned []
Running 346 sub problems to find dead transitions.
// Phase 1: matrix 347 rows 396 cols
[2024-05-21 15:41:18] [INFO ] Computed 94 invariants in 11 ms
[2024-05-21 15:41:18] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 54/92 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 3 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
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:41:24] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
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-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 27 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 TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
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 TDEAD60 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 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 TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 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 TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 20/114 constraints. Problems are: Problem set: 131 solved, 215 unsolved
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:41:25] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
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 TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 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 TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 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 TDEAD198 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 20/134 constraints. Problems are: Problem set: 188 solved, 158 unsolved
[2024-05-21 15:41:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 5 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:41:27] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:41:28] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:41:28] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 15:41:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
[2024-05-21 15:41:28] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/154 constraints. Problems are: Problem set: 212 solved, 134 unsolved
[2024-05-21 15:41:29] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-05-21 15:41:30] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-21 15:41:31] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 20/174 constraints. Problems are: Problem set: 217 solved, 129 unsolved
[2024-05-21 15:41:32] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:41:33] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 2 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 4 ms to minimize.
[2024-05-21 15:41:34] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 20/194 constraints. Problems are: Problem set: 220 solved, 126 unsolved
[2024-05-21 15:41:35] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 4 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:41:36] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:41:37] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:41:38] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 17/211 constraints. Problems are: Problem set: 221 solved, 125 unsolved
[2024-05-21 15:41:39] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:41:39] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:41:40] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:41:40] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:41:40] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 5/216 constraints. Problems are: Problem set: 221 solved, 125 unsolved
[2024-05-21 15:41:41] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/217 constraints. Problems are: Problem set: 221 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/217 constraints. Problems are: Problem set: 221 solved, 125 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 13 (OVERLAPS) 346/742 variables, 396/613 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/742 variables, 11/624 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/742 variables, 0/624 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 1/743 variables, 1/625 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:41:46] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/743 variables, 1/626 constraints. Problems are: Problem set: 250 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/743 variables, and 626 constraints, problems are : Problem set: 250 solved, 96 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 396/396 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 124/124 constraints]
Escalating to Integer solving :Problem set: 250 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 159/347 variables, 54/54 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 124/178 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:41:49] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:41:50] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:41:51] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:41:51] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 20/198 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:41:51] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:41:51] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:41:51] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:41:51] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:41:52] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:41:53] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:41:53] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:41:53] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:41:53] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:41:53] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 20/218 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:41:53] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:41:53] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:41:54] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:54] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:41:54] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:41:54] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:41:54] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:41:54] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:41:54] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:41:55] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 10/228 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:41:55] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:41:55] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:41:55] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:41:55] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:41:55] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:41:55] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:41:56] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:41:57] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 15/243 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/243 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 47/394 variables, 40/283 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:41:58] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/284 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:41:59] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/285 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/285 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 346/740 variables, 394/679 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/740 variables, 11/690 constraints. Problems are: Problem set: 250 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/740 variables, 96/786 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:42:06] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:42:06] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:42:07] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:42:07] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:42:07] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:42:07] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:42:08] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:42:08] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:42:10] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:42:10] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/740 variables, 10/796 constraints. Problems are: Problem set: 250 solved, 96 unsolved
[2024-05-21 15:42:17] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 5 ms to minimize.
[2024-05-21 15:42:17] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/743 variables, and 798 constraints, problems are : Problem set: 250 solved, 96 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 394/396 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 96/346 constraints, Known Traps: 203/203 constraints]
After SMT, in 60229ms problems are : Problem set: 250 solved, 96 unsolved
Search for dead transitions found 250 dead transitions in 60236ms
Found 250 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 250 transitions
Dead transitions reduction (with SMT) removed 250 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 396/452 places, 97/370 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.0 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 0 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 0 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 11 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/370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60328 ms. Remains : 158/452 places, 109/370 transitions.
Support contains 5 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 370/370 transitions.
Applied a total of 0 rules in 7 ms. Remains 452 /452 variables (removed 0) and now considering 370/370 (removed 0) transitions.
// Phase 1: matrix 370 rows 452 cols
[2024-05-21 15:42:18] [INFO ] Computed 94 invariants in 7 ms
[2024-05-21 15:42:18] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 15:42:18] [INFO ] Invariant cache hit.
[2024-05-21 15:42:19] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-05-21 15:42:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:25] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:42:25] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:42:25] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:42:26] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:42:27] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:28] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:42:29] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:42:29] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:42:29] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:42:29] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:42:29] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:42:30] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:42:30] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:42:30] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:42:30] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:42:30] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:42:30] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:42:30] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:42:31] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:42:31] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:42:31] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:42:31] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:42:31] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:42:32] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:42:32] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:33] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:42:33] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:42:33] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:42:34] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:42:34] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:42:34] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:42:34] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:42:34] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:42:34] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:42:35] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:42:35] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:42:35] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:42:35] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:42:36] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:42:36] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:42:39] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:42:40] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:42:40] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:42] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:42:42] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:42:42] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:42:42] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:42:42] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:42:43] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:42:43] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:42:43] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:42:43] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:42:43] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:42:43] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:42:43] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:45] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:42:46] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:42:46] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:42:46] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:42:46] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:42:46] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:42:47] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:42:47] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:42:47] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:42:47] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:42:47] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 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 0.0)
(s35 0.0)
(s36 1.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 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 (/ 3.0 2.0))
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 2.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.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 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/822 variables, and 182 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 88/182 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:51] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:42:52] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 4 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:42:53] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:42:54] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:42:54] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:55] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:42:55] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:42:55] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:42:55] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:42:55] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:42:55] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:42:56] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:42:56] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:42:56] [INFO ] Deduced a trap composed of 24 places in 17 ms of which 1 ms to minimize.
[2024-05-21 15:42:56] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 1 ms to minimize.
[2024-05-21 15:42:56] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:42:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:42:57] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:42:58] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:42:58] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:42:58] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:42:59] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-21 15:42:59] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:42:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:42:59] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:42:59] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:43:00] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:00] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:43:01] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:43:02] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:43:03] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:43:03] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:03] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:03] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:43:03] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:43:03] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:43:03] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:43:04] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:43:05] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:43:05] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:43:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:43:05] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:43:06] [INFO ] Deduced a trap composed of 40 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:43:07] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:43:07] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:43:07] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:43:08] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:43:08] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:08] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:09] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:09] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:43:09] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:43:09] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 1 ms to minimize.
[2024-05-21 15:43:10] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:43:11] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:43:11] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:43:11] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:11] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:11] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:12] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:43:13] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 15:43:14] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:14] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:14] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:14] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:43:15] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:43:16] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:17] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:43:17] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:17] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:17] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:43:17] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:43:17] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:43:17] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:43:18] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:43:18] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:43:18] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:43:18] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:43:18] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:43:18] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:43:18] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/822 variables, and 342 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 0/369 constraints, Known Traps: 248/248 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 452/452 places, 370/370 transitions.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-06 finished in 191307 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, 376/376 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 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 370
Applied a total of 13 rules in 20 ms. Remains 455 /462 variables (removed 7) and now considering 370/376 (removed 6) transitions.
// Phase 1: matrix 370 rows 455 cols
[2024-05-21 15:43:19] [INFO ] Computed 97 invariants in 3 ms
[2024-05-21 15:43:19] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 15:43:19] [INFO ] Invariant cache hit.
[2024-05-21 15:43:19] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 564 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 370/376 transitions.
Applied a total of 0 rules in 6 ms. Remains 452 /452 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 452/462 places, 370/376 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 193 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 437 stabilizing places and 355 stable transitions
Graph (complete) has 964 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 437 stabilizing places and 355 stable transitions
Detected a total of 437/452 stabilizing places and 355/370 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 14 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 1111 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, 376/376 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 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 455 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 455 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 454 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 454 transition count 369
Applied a total of 15 rules in 18 ms. Remains 454 /462 variables (removed 8) and now considering 369/376 (removed 7) transitions.
// Phase 1: matrix 369 rows 454 cols
[2024-05-21 15:43:20] [INFO ] Computed 97 invariants in 2 ms
[2024-05-21 15:43:20] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-21 15:43:20] [INFO ] Invariant cache hit.
[2024-05-21 15:43:20] [INFO ] Implicit Places using invariants and state equation in 398 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 714 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 451/462 places, 369/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 451 /451 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 737 ms. Remains : 451/462 places, 369/376 transitions.
Stuttering acceptance computed with spot in 177 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 1417 reset in 204 ms.
Stack based approach found an accepted trace after 3704 steps with 71 reset with depth 6 and stack size 6 in 9 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-08 finished in 1149 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, 376/376 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 982 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 320
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 320
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 223
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 223
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 314 place count 287 transition count 218
Iterating global reduction 2 with 5 rules applied. Total rules applied 319 place count 287 transition count 218
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 557 place count 165 transition count 102
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 561 place count 163 transition count 105
Applied a total of 561 rules in 28 ms. Remains 163 /462 variables (removed 299) and now considering 105/376 (removed 271) transitions.
// Phase 1: matrix 105 rows 163 cols
[2024-05-21 15:43:21] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 15:43:21] [INFO ] Implicit Places using invariants in 92 ms returned [1, 2, 3, 6, 7, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 53, 54]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 107 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/462 places, 105/376 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 144/462 places, 105/376 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-09
Stuttering criterion allowed to conclude after 223 steps with 51 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-09 finished in 222 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, 376/376 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 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 370
Applied a total of 13 rules in 16 ms. Remains 455 /462 variables (removed 7) and now considering 370/376 (removed 6) transitions.
// Phase 1: matrix 370 rows 455 cols
[2024-05-21 15:43:21] [INFO ] Computed 97 invariants in 3 ms
[2024-05-21 15:43:21] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 15:43:21] [INFO ] Invariant cache hit.
[2024-05-21 15:43:22] [INFO ] Implicit Places using invariants and state equation in 393 ms returned [65, 66, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 581 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 452/462 places, 370/376 transitions.
Applied a total of 0 rules in 12 ms. Remains 452 /452 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 609 ms. Remains : 452/462 places, 370/376 transitions.
Stuttering acceptance computed with spot in 87 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 1 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-11 finished in 709 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 106 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, 376/376 transitions.
Graph (trivial) has 212 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 982 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 320
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 320
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 221
Deduced a syphon composed of 99 places in 0 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 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 283 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 283 transition count 215
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 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 554 place count 167 transition count 103
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 165 transition count 106
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 564 place count 165 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 565 place count 164 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 566 place count 163 transition count 105
Applied a total of 566 rules in 35 ms. Remains 163 /462 variables (removed 299) and now considering 105/376 (removed 271) transitions.
// Phase 1: matrix 105 rows 163 cols
[2024-05-21 15:43:22] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 15:43:22] [INFO ] Implicit Places using invariants in 95 ms returned [34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54, 153, 155]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 96 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 150/462 places, 105/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 150 /150 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 134 ms. Remains : 150/462 places, 105/376 transitions.
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-00
Product exploration explored 100000 steps with 27617 reset in 226 ms.
Product exploration explored 100000 steps with 27615 reset in 204 ms.
Computed a total of 150 stabilizing places and 104 stable transitions
Computed a total of 150 stabilizing places and 104 stable transitions
Detected a total of 150/150 stabilizing places and 104/105 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 78 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 104 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9105 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2453 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 950 steps, run visited all 1 properties in 6 ms. (steps per millisecond=158 )
Probabilistic random walk after 950 steps, saw 363 distinct states, run finished after 6 ms. (steps per millisecond=158 ) 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 64 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 97 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 150 cols
[2024-05-21 15:43:23] [INFO ] Computed 61 invariants in 1 ms
[2024-05-21 15:43:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 15:43:23] [INFO ] Invariant cache hit.
[2024-05-21 15:43:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:43:23] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [9, 10, 11, 18, 22, 34, 36, 38, 40, 45, 52, 54, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 128, 132]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 218 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/150 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 113 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 111 transition count 100
Applied a total of 8 rules in 3 ms. Remains 111 /115 variables (removed 4) and now considering 100/105 (removed 5) transitions.
// Phase 1: matrix 100 rows 111 cols
[2024-05-21 15:43:23] [INFO ] Computed 26 invariants in 0 ms
[2024-05-21 15:43:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 15:43:23] [INFO ] Invariant cache hit.
[2024-05-21 15:43:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:43:24] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/150 places, 100/105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 394 ms. Remains : 111/150 places, 100/105 transitions.
Computed a total of 111 stabilizing places and 99 stable transitions
Graph (complete) has 330 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 111 stabilizing places and 99 stable transitions
Detected a total of 111/111 stabilizing places and 99/100 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 65 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 101 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9172 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2492 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 920 steps, run visited all 1 properties in 7 ms. (steps per millisecond=131 )
Probabilistic random walk after 920 steps, saw 351 distinct states, run finished after 7 ms. (steps per millisecond=131 ) 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 80 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 99 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27577 reset in 103 ms.
Product exploration explored 100000 steps with 27572 reset in 101 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 100/100 transitions.
Graph (complete) has 330 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 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 108 transition count 99
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 108 transition count 101
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 108 transition count 99
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 22 rules in 13 ms. Remains 108 /111 variables (removed 3) and now considering 99/100 (removed 1) transitions.
[2024-05-21 15:43:25] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 108 cols
[2024-05-21 15:43:25] [INFO ] Computed 24 invariants in 0 ms
[2024-05-21 15:43:25] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-21 15:43:25] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:43:25] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:43:25] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:43:25] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/107 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-21 15:43:25] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 15:43:25] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 9/37 constraints. Problems are: Problem set: 7 solved, 86 unsolved
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 15:43:27] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
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 TDEAD26 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 17/54 constraints. Problems are: Problem set: 19 solved, 74 unsolved
[2024-05-21 15:43:27] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 15:43:27] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 2/56 constraints. Problems are: Problem set: 20 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/56 constraints. Problems are: Problem set: 20 solved, 73 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 10 (OVERLAPS) 98/205 variables, 107/163 constraints. Problems are: Problem set: 28 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 9/172 constraints. Problems are: Problem set: 28 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/172 constraints. Problems are: Problem set: 28 solved, 65 unsolved
Problem TDEAD20 is UNSAT
At refinement iteration 13 (OVERLAPS) 1/206 variables, 1/173 constraints. Problems are: Problem set: 29 solved, 64 unsolved
[2024-05-21 15:43:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:43:28] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 2/175 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/175 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 16 (OVERLAPS) 0/206 variables, 0/175 constraints. Problems are: Problem set: 29 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/207 variables, and 175 constraints, problems are : Problem set: 29 solved, 64 unsolved in 3721 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 108/108 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 29 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 6/10 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 21/31 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/31 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 18/105 variables, 9/40 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/41 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 13/54 constraints. Problems are: Problem set: 29 solved, 64 unsolved
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 4/58 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/58 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 2/107 variables, 4/62 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/62 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 98/205 variables, 107/169 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 9/178 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 64/242 constraints. Problems are: Problem set: 29 solved, 64 unsolved
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 2/244 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/244 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 16 (OVERLAPS) 1/206 variables, 1/245 constraints. Problems are: Problem set: 29 solved, 64 unsolved
[2024-05-21 15:43:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:43:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 2/247 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/247 constraints. Problems are: Problem set: 29 solved, 64 unsolved
At refinement iteration 19 (OVERLAPS) 0/206 variables, 0/247 constraints. Problems are: Problem set: 29 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/207 variables, and 247 constraints, problems are : Problem set: 29 solved, 64 unsolved in 5095 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 108/108 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 64/93 constraints, Known Traps: 42/42 constraints]
After SMT, in 8858ms problems are : Problem set: 29 solved, 64 unsolved
Search for dead transitions found 29 dead transitions in 8859ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/111 places, 70/100 transitions.
Graph (complete) has 311 edges and 108 vertex of which 89 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 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 5 ms. Remains 84 /108 variables (removed 24) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/111 places, 70/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8890 ms. Remains : 84/111 places, 70/100 transitions.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 100/100 transitions.
Applied a total of 0 rules in 0 ms. Remains 111 /111 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 111 cols
[2024-05-21 15:43:33] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 15:43:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 15:43:34] [INFO ] Invariant cache hit.
[2024-05-21 15:43:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:43:34] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-21 15:43:34] [INFO ] Invariant cache hit.
[2024-05-21 15:43:34] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 37 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 36 places in 23 ms of which 0 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 37 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 36 places in 22 ms of which 1 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 7 (OVERLAPS) 99/209 variables, 110/147 constraints. Problems are: Problem set: 7 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 4/151 constraints. Problems are: Problem set: 7 solved, 87 unsolved
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 15:43:36] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-21 15:43:36] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:43:36] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:43:36] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 9/160 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:36] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/161 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/161 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 1/210 variables, 1/162 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:37] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:43:37] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:43:37] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:43:37] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 4/166 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:38] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 1/167 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 0/167 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 16 (OVERLAPS) 0/210 variables, 0/167 constraints. Problems are: Problem set: 9 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 167 constraints, problems are : Problem set: 9 solved, 85 unsolved in 4853 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 9 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 11/16 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 16/32 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:39] [INFO ] Deduced a trap composed of 35 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/33 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:39] [INFO ] Deduced a trap composed of 35 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/34 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 8/42 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 2/44 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 10/54 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:39] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:43:39] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 2/56 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/56 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 99/209 variables, 110/166 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 4/170 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 85/255 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:40] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:43:40] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:43:41] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:43:41] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 4/259 constraints. Problems are: Problem set: 9 solved, 85 unsolved
[2024-05-21 15:43:42] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:43:42] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 2/261 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/261 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/262 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/262 constraints. Problems are: Problem set: 9 solved, 85 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/262 constraints. Problems are: Problem set: 9 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 262 constraints, problems are : Problem set: 9 solved, 85 unsolved in 8375 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 85/94 constraints, Known Traps: 36/36 constraints]
After SMT, in 13269ms problems are : Problem set: 9 solved, 85 unsolved
Search for dead transitions found 9 dead transitions in 13270ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 111/111 places, 91/100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 108 transition count 91
Applied a total of 3 rules in 1 ms. Remains 108 /111 variables (removed 3) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 108 cols
[2024-05-21 15:43:47] [INFO ] Computed 30 invariants in 1 ms
[2024-05-21 15:43:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 15:43:47] [INFO ] Invariant cache hit.
[2024-05-21 15:43:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:43:47] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [34, 40, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 176 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/111 places, 91/100 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Applied a total of 2 rules in 1 ms. Remains 104 /105 variables (removed 1) and now considering 89/91 (removed 2) transitions.
// Phase 1: matrix 89 rows 104 cols
[2024-05-21 15:43:47] [INFO ] Computed 27 invariants in 0 ms
[2024-05-21 15:43:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 15:43:47] [INFO ] Invariant cache hit.
[2024-05-21 15:43:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:43:47] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 104/111 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13774 ms. Remains : 104/111 places, 89/100 transitions.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-00 finished in 25430 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 278 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, 376/376 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 982 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 321
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 321
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 224
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 224
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 313 place count 287 transition count 219
Iterating global reduction 2 with 5 rules applied. Total rules applied 318 place count 287 transition count 219
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 6 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 550 place count 168 transition count 106
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 554 place count 166 transition count 109
Applied a total of 554 rules in 30 ms. Remains 166 /462 variables (removed 296) and now considering 109/376 (removed 267) transitions.
// Phase 1: matrix 109 rows 166 cols
[2024-05-21 15:43:48] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 15:43:48] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 5, 6, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 138 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 147/462 places, 109/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 170 ms. Remains : 147/462 places, 109/376 transitions.
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-06
Stuttering criterion allowed to conclude after 84 steps with 10 reset in 0 ms.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-06 finished in 564 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 15:43:48] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:43:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 15:43:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 462 places, 376 transitions and 1152 arcs took 7 ms.
Total runtime 442107 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 462
TRANSITIONS: 376
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.002s]


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


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

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

Process ID: 6252
MODEL NAME: /home/mcc/execution/410/model
462 places, 376 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-12-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716306913798

--------------------
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
MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-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 r047-tajo-171620398400539"
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 ;