Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662339400835.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ResAllocation-PT-R003C100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339400835
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 11 23:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 721K May 18 16:43 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 ResAllocation-PT-R003C100-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716717814126

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-26 10:03:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 10:03:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:03:35] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-26 10:03:35] [INFO ] Transformed 600 places.
[2024-05-26 10:03:35] [INFO ] Transformed 400 transitions.
[2024-05-26 10:03:35] [INFO ] Found NUPN structural information;
[2024-05-26 10:03:35] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 62 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2024-05-26 10:03:35] [INFO ] Computed 300 invariants in 13 ms
[2024-05-26 10:03:36] [INFO ] Implicit Places using invariants in 537 ms returned [595, 597, 599]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 568 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/600 places, 400/400 transitions.
Applied a total of 0 rules in 19 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 663 ms. Remains : 597/600 places, 400/400 transitions.
Support contains 28 out of 597 places after structural reductions.
[2024-05-26 10:03:36] [INFO ] Flatten gal took : 68 ms
[2024-05-26 10:03:36] [INFO ] Flatten gal took : 33 ms
[2024-05-26 10:03:36] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 27 out of 597 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (190 resets) in 2605 ms. (15 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
// Phase 1: matrix 400 rows 597 cols
[2024-05-26 10:03:37] [INFO ] Computed 297 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/30 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/46 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/62 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 16/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/62 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/78 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/78 variables, 16/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/78 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/94 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/94 variables, 16/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/94 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/108 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/108 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/108 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 14/122 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 14/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 14/136 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 14/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/136 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 14/150 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/150 variables, 14/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/150 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 14/164 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/164 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 8 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/164 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/164 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 12/176 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/176 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/176 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 12/188 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/188 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/188 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 12/200 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/200 variables, 12/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/200 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 12/212 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/212 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/212 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 12/224 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/224 variables, 12/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/224 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 12/236 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/236 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/236 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 12/248 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/248 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/248 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/248 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 12/260 variables, 6/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/260 variables, 12/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/260 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/260 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 12/272 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/272 variables, 12/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/272 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/272 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 11/283 variables, 6/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/283 variables, 11/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/283 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/283 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 8/291 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/291 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/291 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 8/299 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/299 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/299 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 8/307 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/307 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/307 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 8/315 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/315 variables, 8/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/315 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 8/323 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/323 variables, 8/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 84 (INCLUDED_ONLY) 0/323 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/323 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 8/331 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/331 variables, 8/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/331 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 8/339 variables, 4/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/339 variables, 8/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/339 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 8/347 variables, 4/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/347 variables, 8/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/347 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 8/355 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/355 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/355 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 8/363 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/363 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/363 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 8/371 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/371 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/371 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 8/379 variables, 4/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/379 variables, 8/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 106 (INCLUDED_ONLY) 0/379 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/379 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 8/387 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/387 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/387 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 8/395 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/395 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/395 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 8/403 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/403 variables, 8/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/403 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 8/411 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/411 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/411 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 8/419 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/419 variables, 8/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/419 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 8/427 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/427 variables, 8/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 125 (INCLUDED_ONLY) 0/427 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/427 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 8/435 variables, 4/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/435 variables, 8/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/435 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 8/443 variables, 4/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/443 variables, 8/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/443 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 8/451 variables, 4/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/451 variables, 8/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/451 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 8/459 variables, 4/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/459 variables, 8/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/459 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 6/465 variables, 3/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/465 variables, 6/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 141 (INCLUDED_ONLY) 0/465 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/465 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 6/471 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/471 variables, 6/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 145 (INCLUDED_ONLY) 0/471 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/471 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 6/477 variables, 3/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/477 variables, 6/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/477 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 6/483 variables, 3/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/483 variables, 6/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/483 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (OVERLAPS) 6/489 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/489 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/489 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 6/495 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/495 variables, 6/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 158 (INCLUDED_ONLY) 0/495 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/495 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 6/501 variables, 3/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/501 variables, 6/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/501 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 6/507 variables, 3/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/507 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/507 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 6/513 variables, 3/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/513 variables, 6/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/513 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 6/519 variables, 3/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/519 variables, 6/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/519 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (OVERLAPS) 4/523 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/523 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/523 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 4/527 variables, 2/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/527 variables, 4/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/527 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (OVERLAPS) 4/531 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/531 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/531 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 2/533 variables, 1/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/533 variables, 2/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/533 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (OVERLAPS) 2/535 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/535 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/535 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (OVERLAPS) 2/537 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/537 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/537 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 2/539 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/539 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/539 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (OVERLAPS) 2/541 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/541 variables, 2/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 195 (INCLUDED_ONLY) 0/541 variables, 1/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/541 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (OVERLAPS) 2/543 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/543 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 199 (INCLUDED_ONLY) 0/543 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/543 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 2/545 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/545 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/545 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (OVERLAPS) 2/547 variables, 1/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/547 variables, 2/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 206 (INCLUDED_ONLY) 0/547 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/547 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (OVERLAPS) 2/549 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/549 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/549 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 2/551 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/551 variables, 2/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/551 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (OVERLAPS) 2/553 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/553 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/553 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (OVERLAPS) 2/555 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/555 variables, 2/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 3 ms to minimize.
At refinement iteration 219 (INCLUDED_ONLY) 0/555 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/555 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (OVERLAPS) 2/557 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/557 variables, 2/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/557 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (OVERLAPS) 2/559 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/559 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/559 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (OVERLAPS) 2/561 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/561 variables, 2/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/561 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (OVERLAPS) 2/563 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/563 variables, 2/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/563 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (OVERLAPS) 2/565 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/565 variables, 2/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/565 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (OVERLAPS) 2/567 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/567 variables, 2/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/567 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 2/569 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/569 variables, 2/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/569 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (OVERLAPS) 2/571 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/571 variables, 2/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/571 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (OVERLAPS) 2/573 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/573 variables, 2/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/573 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (OVERLAPS) 2/575 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/575 variables, 2/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/575 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (OVERLAPS) 2/577 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/577 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 253 (INCLUDED_ONLY) 0/577 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/577 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 2/579 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/579 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/579 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 2/581 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/581 variables, 2/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/581 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (OVERLAPS) 2/583 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/583 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/583 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (OVERLAPS) 2/585 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/585 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/585 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (OVERLAPS) 2/587 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/587 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/587 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (OVERLAPS) 2/589 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/589 variables, 2/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/589 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (OVERLAPS) 2/591 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/591 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/591 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (OVERLAPS) 2/593 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/593 variables, 2/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/593 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (OVERLAPS) 2/595 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/595 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/595 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (OVERLAPS) 2/597 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/597 variables, 2/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/597 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (OVERLAPS) 400/997 variables, 597/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/997 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (OVERLAPS) 0/997 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 997/997 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2640 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/30 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/46 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/62 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 16/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/62 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/78 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/78 variables, 16/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/78 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/94 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/94 variables, 16/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/94 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/108 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/108 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/108 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/108 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 14/122 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/122 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/122 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 14/136 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/136 variables, 14/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 14/150 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/150 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/150 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 14/164 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/164 variables, 14/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/164 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/164 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 12/176 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/176 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/176 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 12/188 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/188 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/188 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 12/200 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/200 variables, 12/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/200 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 12/212 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/212 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/212 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 12/224 variables, 6/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/224 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/224 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/224 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 12/236 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/236 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/236 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 12/248 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/248 variables, 12/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/248 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/248 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 12/260 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/260 variables, 12/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/260 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/260 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 12/272 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/272 variables, 12/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/272 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/272 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 11/283 variables, 6/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/283 variables, 11/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/283 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/283 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 8/291 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/291 variables, 8/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/291 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 8/299 variables, 4/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/299 variables, 8/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/299 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 8/307 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/307 variables, 8/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/307 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/307 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 8/315 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/315 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/315 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 8/323 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/323 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/323 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 89 (INCLUDED_ONLY) 0/323 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/323 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 8/331 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/331 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/331 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 8/339 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/339 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/339 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 8/347 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/347 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 99 (INCLUDED_ONLY) 0/347 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/347 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 8/355 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/355 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 103 (INCLUDED_ONLY) 0/355 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/355 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 8/363 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/363 variables, 8/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/363 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 8/371 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/371 variables, 8/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/371 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 8/379 variables, 4/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/379 variables, 8/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/379 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/379 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 8/387 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/387 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/387 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 8/395 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/395 variables, 8/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/395 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 8/403 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/403 variables, 8/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/403 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 8/411 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/411 variables, 8/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/411 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 8/419 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/419 variables, 8/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/419 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 8/427 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/427 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/427 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/427 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 8/435 variables, 4/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/435 variables, 8/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 136 (INCLUDED_ONLY) 0/435 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/435 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 8/443 variables, 4/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/443 variables, 8/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/443 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 8/451 variables, 4/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/451 variables, 8/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/451 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 8/459 variables, 4/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/459 variables, 8/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 146 (INCLUDED_ONLY) 0/459 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/459 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 6/465 variables, 3/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/465 variables, 6/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/465 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/465 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 6/471 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/471 variables, 6/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/471 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/471 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 6/477 variables, 3/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/477 variables, 6/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/477 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 6/483 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/483 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/483 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 6/489 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/489 variables, 6/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/489 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 6/495 variables, 3/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/495 variables, 6/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/495 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/495 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 6/501 variables, 3/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/501 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/501 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (OVERLAPS) 6/507 variables, 3/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/507 variables, 6/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 174 (INCLUDED_ONLY) 0/507 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/507 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (OVERLAPS) 6/513 variables, 3/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/513 variables, 6/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/513 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (OVERLAPS) 6/519 variables, 3/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/519 variables, 6/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/519 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (OVERLAPS) 4/523 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/523 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/523 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (OVERLAPS) 4/527 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/527 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/527 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (OVERLAPS) 4/531 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/531 variables, 4/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/531 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (OVERLAPS) 2/533 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/533 variables, 2/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/533 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (OVERLAPS) 2/535 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/535 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/535 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (OVERLAPS) 2/537 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/537 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/537 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (OVERLAPS) 2/539 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/539 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/539 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (OVERLAPS) 2/541 variables, 1/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/541 variables, 2/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/541 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/541 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 2/543 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/543 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/543 variables, 1/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/543 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 2/545 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/545 variables, 2/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/545 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (OVERLAPS) 2/547 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/547 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/547 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/547 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (OVERLAPS) 2/549 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/549 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/549 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (OVERLAPS) 2/551 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/551 variables, 2/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 223 (INCLUDED_ONLY) 0/551 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/551 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (OVERLAPS) 2/553 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/553 variables, 2/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/553 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (OVERLAPS) 2/555 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/555 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/555 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/555 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (OVERLAPS) 2/557 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/557 variables, 2/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/557 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 2/559 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/559 variables, 2/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/559 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (OVERLAPS) 2/561 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/561 variables, 2/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/561 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (OVERLAPS) 2/563 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/563 variables, 2/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 243 (INCLUDED_ONLY) 0/563 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/563 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (OVERLAPS) 2/565 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/565 variables, 2/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/565 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (OVERLAPS) 2/567 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/567 variables, 2/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/567 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (OVERLAPS) 2/569 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/569 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/569 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (OVERLAPS) 2/571 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/571 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/571 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (OVERLAPS) 2/573 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/573 variables, 2/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/573 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (OVERLAPS) 2/575 variables, 1/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/575 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 262 (INCLUDED_ONLY) 0/575 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/575 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (OVERLAPS) 2/577 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/577 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/577 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/577 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (OVERLAPS) 2/579 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/579 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/579 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (OVERLAPS) 2/581 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/581 variables, 2/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/581 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (OVERLAPS) 2/583 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/583 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/583 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 2/585 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/585 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/585 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (OVERLAPS) 2/587 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/587 variables, 2/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/587 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (OVERLAPS) 2/589 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/589 variables, 2/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/589 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (OVERLAPS) 2/591 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/591 variables, 2/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/591 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (OVERLAPS) 2/593 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/593 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/593 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (OVERLAPS) 2/595 variables, 1/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/595 variables, 2/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/595 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (OVERLAPS) 2/597 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/597 variables, 2/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/597 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (OVERLAPS) 400/997 variables, 597/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/997 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/997 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 10:03:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 301 (OVERLAPS) 0/997 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/997 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 0/997 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 997/997 variables, and 1525 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1692 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints]
After SMT, in 4380ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 98 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 10 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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 3 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 499 transition count 302
Applied a total of 196 rules in 60 ms. Remains 499 /597 variables (removed 98) and now considering 302/400 (removed 98) transitions.
// Phase 1: matrix 302 rows 499 cols
[2024-05-26 10:03:42] [INFO ] Computed 297 invariants in 4 ms
[2024-05-26 10:03:42] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-26 10:03:42] [INFO ] Invariant cache hit.
[2024-05-26 10:03:43] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2024-05-26 10:03:43] [INFO ] Redundant transitions in 15 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-26 10:03:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 297/796 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-26 10:03:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 4 ms to minimize.
[2024-05-26 10:03:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 302/801 variables, 499/1297 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/801 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 801/801 variables, and 1297 constraints, problems are : Problem set: 0 solved, 202 unsolved in 13646 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 297/796 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 302/801 variables, 499/1297 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 202/1499 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/801 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 801/801 variables, and 1499 constraints, problems are : Problem set: 0 solved, 202 unsolved in 16173 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 2/2 constraints]
After SMT, in 29889ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 29894ms
Starting structural reductions in SI_LTL mode, iteration 1 : 499/597 places, 302/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30834 ms. Remains : 499/597 places, 302/400 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-00
Stuttering criterion allowed to conclude after 203 steps with 0 reset in 10 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-00 finished in 31117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2024-05-26 10:04:13] [INFO ] Computed 297 invariants in 4 ms
[2024-05-26 10:04:13] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-26 10:04:13] [INFO ] Invariant cache hit.
[2024-05-26 10:04:14] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-26 10:04:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 597/597 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 297/894 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/914 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 20/934 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 20/954 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 20/974 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:04:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 20/994 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 20/1014 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:36] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:04:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:04:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 20/1034 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 8/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/997 variables, and 1042 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30029 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 148/148 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 597/597 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 297/894 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 148/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 400/997 variables, 597/1639 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 300/1939 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:05:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1940 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 149/149 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 61011 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-01
Stuttering criterion allowed to conclude after 340 steps with 1 reset in 10 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-01 finished in 61207 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(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 6 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 500 transition count 303
Applied a total of 194 rules in 31 ms. Remains 500 /597 variables (removed 97) and now considering 303/400 (removed 97) transitions.
// Phase 1: matrix 303 rows 500 cols
[2024-05-26 10:05:14] [INFO ] Computed 297 invariants in 5 ms
[2024-05-26 10:05:15] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-26 10:05:15] [INFO ] Invariant cache hit.
[2024-05-26 10:05:15] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-05-26 10:05:15] [INFO ] Redundant transitions in 4 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-26 10:05:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 297/797 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-26 10:05:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:05:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:05:18] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 3/800 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 303/803 variables, 500/1300 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/803 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 803/803 variables, and 1300 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13140 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 297/797 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 3/800 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 303/803 variables, 500/1300 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 203/1503 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/803 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 803/803 variables, and 1503 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17152 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 3/3 constraints]
After SMT, in 30330ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 30333ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/597 places, 303/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31155 ms. Remains : 500/597 places, 303/400 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-05
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 3 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-05 finished in 31456 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) U G(p1)))'
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 500 transition count 303
Applied a total of 194 rules in 28 ms. Remains 500 /597 variables (removed 97) and now considering 303/400 (removed 97) transitions.
// Phase 1: matrix 303 rows 500 cols
[2024-05-26 10:05:46] [INFO ] Computed 297 invariants in 4 ms
[2024-05-26 10:05:46] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-26 10:05:46] [INFO ] Invariant cache hit.
[2024-05-26 10:05:46] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2024-05-26 10:05:46] [INFO ] Redundant transitions in 4 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-26 10:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 297/797 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-26 10:05:48] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 303/803 variables, 500/1298 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/803 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 803/803 variables, and 1298 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13004 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 297/797 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-26 10:06:01] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-26 10:06:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 303/803 variables, 500/1300 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/803 variables, 203/1503 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/803 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/803 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 803/803 variables, and 1503 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19068 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 3/3 constraints]
After SMT, in 32109ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 32112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/597 places, 303/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32971 ms. Remains : 500/597 places, 303/400 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), p0]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-09
Stuttering criterion allowed to conclude after 31633 steps with 157 reset in 316 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-09 finished in 33407 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 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 498 transition count 301
Applied a total of 198 rules in 27 ms. Remains 498 /597 variables (removed 99) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2024-05-26 10:06:19] [INFO ] Computed 297 invariants in 4 ms
[2024-05-26 10:06:19] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-26 10:06:19] [INFO ] Invariant cache hit.
[2024-05-26 10:06:20] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2024-05-26 10:06:20] [INFO ] Redundant transitions in 2 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-26 10:06:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 10:06:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:06:22] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 1295 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13109 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 201/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 1496 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15744 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
After SMT, in 28884ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 28886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 498/597 places, 301/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29717 ms. Remains : 498/597 places, 301/400 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-11
Product exploration explored 100000 steps with 498 reset in 917 ms.
Product exploration explored 100000 steps with 501 reset in 997 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21831 steps (106 resets) in 272 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 301/301 transitions.
Applied a total of 0 rules in 15 ms. Remains 498 /498 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-05-26 10:06:51] [INFO ] Invariant cache hit.
[2024-05-26 10:06:52] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-26 10:06:52] [INFO ] Invariant cache hit.
[2024-05-26 10:06:52] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-05-26 10:06:52] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-26 10:06:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 10:06:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:06:54] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 1295 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13113 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 201/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 1496 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15928 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
After SMT, in 29075ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 29078ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29854 ms. Remains : 498/498 places, 301/301 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28344 steps (139 resets) in 350 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 501 reset in 859 ms.
Product exploration explored 100000 steps with 501 reset in 967 ms.
Built C files in :
/tmp/ltsmin9629406140163661730
[2024-05-26 10:07:24] [INFO ] Computing symmetric may disable matrix : 301 transitions.
[2024-05-26 10:07:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:07:24] [INFO ] Computing symmetric may enable matrix : 301 transitions.
[2024-05-26 10:07:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:07:24] [INFO ] Computing Do-Not-Accords matrix : 301 transitions.
[2024-05-26 10:07:24] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:07:24] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9629406140163661730
Running compilation step : cd /tmp/ltsmin9629406140163661730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 948 ms.
Running link step : cd /tmp/ltsmin9629406140163661730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9629406140163661730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1082468210387999507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 301/301 transitions.
Applied a total of 0 rules in 27 ms. Remains 498 /498 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-05-26 10:07:39] [INFO ] Invariant cache hit.
[2024-05-26 10:07:39] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-26 10:07:39] [INFO ] Invariant cache hit.
[2024-05-26 10:07:40] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2024-05-26 10:07:40] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-26 10:07:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 10:07:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:07:41] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 1295 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13041 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 201/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 1496 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15539 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
After SMT, in 28614ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 28617ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29426 ms. Remains : 498/498 places, 301/301 transitions.
Built C files in :
/tmp/ltsmin13928033310263796521
[2024-05-26 10:08:08] [INFO ] Computing symmetric may disable matrix : 301 transitions.
[2024-05-26 10:08:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:08:08] [INFO ] Computing symmetric may enable matrix : 301 transitions.
[2024-05-26 10:08:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:08:08] [INFO ] Computing Do-Not-Accords matrix : 301 transitions.
[2024-05-26 10:08:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:08:08] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13928033310263796521
Running compilation step : cd /tmp/ltsmin13928033310263796521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 761 ms.
Running link step : cd /tmp/ltsmin13928033310263796521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13928033310263796521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased579655567257808458.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 10:08:24] [INFO ] Flatten gal took : 20 ms
[2024-05-26 10:08:24] [INFO ] Flatten gal took : 19 ms
[2024-05-26 10:08:24] [INFO ] Time to serialize gal into /tmp/LTL6605149910753196327.gal : 4 ms
[2024-05-26 10:08:24] [INFO ] Time to serialize properties into /tmp/LTL4233126403985769356.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6605149910753196327.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11496165000172672601.hoa' '-atoms' '/tmp/LTL4233126403985769356.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4233126403985769356.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11496165000172672601.hoa
Reverse transition relation is NOT exact ! Due to transitions t107, t101.t100, t109.t108, Intersection with reachable at each step enabled. (destroyed/rev...189
Computing Next relation with stutter on 1.55983e+12 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
650 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.55685,210392,1,0,618,1.42957e+06,632,308,15650,658540,628
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-11 finished in 132097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U G(p2))))'
Support contains 6 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2024-05-26 10:08:31] [INFO ] Computed 297 invariants in 2 ms
[2024-05-26 10:08:31] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-26 10:08:31] [INFO ] Invariant cache hit.
[2024-05-26 10:08:32] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-26 10:08:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 597/597 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 297/894 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:08:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/914 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:08:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 20/934 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:08:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:08:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:08:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 20/954 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:08:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 5 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:08:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 20/974 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:08:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:08:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 20/994 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:08:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 4 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:08:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 20/1014 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:08:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:08:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 4 ms to minimize.
[2024-05-26 10:08:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 20/1034 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 8/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/997 variables, and 1042 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 148/148 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 597/597 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 297/894 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 148/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 400/997 variables, 597/1639 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 300/1939 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1940 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 149/149 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in LTL mode , in 1 iterations and 61019 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 9295 steps with 44 reset in 93 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-12 finished in 61427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 12 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-26 10:09:33] [INFO ] Invariant cache hit.
[2024-05-26 10:09:33] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-26 10:09:33] [INFO ] Invariant cache hit.
[2024-05-26 10:09:34] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-26 10:09:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 597/597 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 297/894 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/914 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 20/934 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 20/954 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:09:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 20/974 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:09:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 20/994 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:52] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-26 10:09:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 20/1014 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:09:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:09:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 20/1034 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:09:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:10:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:10:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:10:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:10:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:10:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:10:00] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:10:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 8/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/997 variables, and 1042 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 148/148 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 597/597 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 297/894 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 148/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 400/997 variables, 597/1639 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 300/1939 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-26 10:10:29] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1940 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Domain max(s): 597/597 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 149/149 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in LTL mode , in 1 iterations and 61039 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-15
Product exploration explored 100000 steps with 1562 reset in 1194 ms.
Stack based approach found an accepted trace after 4066 steps with 63 reset with depth 208 and stack size 208 in 52 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-15 finished in 62433 ms.
All properties solved by simple procedures.
Total runtime 420226 ms.

BK_STOP 1716718235538

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R003C100, 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 r312-tall-171662339400835"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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