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.r512-smll-171654407300266.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 ltsminxred
Input is Peterson-PT-4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-CTLFireability-2024-00
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-01
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-02
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-03
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-04
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-05
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-06
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-07
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-08
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-09
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-10
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-11
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-12
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-13
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-14
FORMULA_NAME Peterson-PT-4-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717270465372

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:34:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:34:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:34:27] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-06-01 19:34:27] [INFO ] Transformed 480 places.
[2024-06-01 19:34:27] [INFO ] Transformed 690 transitions.
[2024-06-01 19:34:27] [INFO ] Found NUPN structural information;
[2024-06-01 19:34:27] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 43 ms.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 27 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:34:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:34:27] [INFO ] Computed 19 invariants in 35 ms
[2024-06-01 19:34:28] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-06-01 19:34:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:34:28] [INFO ] Invariant cache hit.
[2024-06-01 19:34:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:34:28] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:34:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:34:28] [INFO ] Invariant cache hit.
[2024-06-01 19:34:28] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:34:50] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 39 ms to minimize.
[2024-06-01 19:34:50] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 6 ms to minimize.
[2024-06-01 19:34:50] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 5 ms to minimize.
[2024-06-01 19:34:50] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 5 ms to minimize.
[2024-06-01 19:34:51] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 4 ms to minimize.
[2024-06-01 19:34:51] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 4 ms to minimize.
[2024-06-01 19:34:51] [INFO ] Deduced a trap composed of 54 places in 339 ms of which 4 ms to minimize.
[2024-06-01 19:34:52] [INFO ] Deduced a trap composed of 32 places in 381 ms of which 4 ms to minimize.
[2024-06-01 19:34:52] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 4 ms to minimize.
[2024-06-01 19:34:52] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 5 ms to minimize.
[2024-06-01 19:34:52] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 4 ms to minimize.
[2024-06-01 19:34:53] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 5 ms to minimize.
[2024-06-01 19:34:53] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 4 ms to minimize.
[2024-06-01 19:34:53] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 4 ms to minimize.
[2024-06-01 19:34:53] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-06-01 19:34:54] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:34:54] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:34:54] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 3 ms to minimize.
[2024-06-01 19:34:54] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 4 ms to minimize.
[2024-06-01 19:34:54] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30044 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:35:08] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 5 ms to minimize.
[2024-06-01 19:35:09] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:35:09] [INFO ] Deduced a trap composed of 86 places in 232 ms of which 3 ms to minimize.
[2024-06-01 19:35:09] [INFO ] Deduced a trap composed of 83 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:35:09] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 3 ms to minimize.
[2024-06-01 19:35:10] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 4 ms to minimize.
[2024-06-01 19:35:10] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 4 ms to minimize.
[2024-06-01 19:35:10] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 4 ms to minimize.
[2024-06-01 19:35:10] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:35:11] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 4 ms to minimize.
[2024-06-01 19:35:11] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 4 ms to minimize.
[2024-06-01 19:35:11] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:35:11] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 4 ms to minimize.
[2024-06-01 19:35:11] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 4 ms to minimize.
[2024-06-01 19:35:12] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 7 ms to minimize.
[2024-06-01 19:35:12] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 4 ms to minimize.
[2024-06-01 19:35:12] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 4 ms to minimize.
[2024-06-01 19:35:12] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 4 ms to minimize.
[2024-06-01 19:35:13] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:35:13] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:35:14] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2024-06-01 19:35:14] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 4 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 102 places in 261 ms of which 4 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 4 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 4 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 4 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 4 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 3 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 4 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:35:20] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 128 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 36 places in 322 ms of which 4 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 4 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:35:24] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:35:24] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:35:24] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:35:24] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:35:24] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:35:28] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:35:28] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 4 ms to minimize.
[2024-06-01 19:35:28] [INFO ] Deduced a trap composed of 84 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:35:28] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 4 ms to minimize.
[2024-06-01 19:35:29] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 584 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30021 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 85/85 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Finished structural reductions in LTL mode , in 1 iterations and 61623 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2024-06-01 19:35:29] [INFO ] Flatten gal took : 160 ms
[2024-06-01 19:35:30] [INFO ] Flatten gal took : 87 ms
[2024-06-01 19:35:30] [INFO ] Input system was already deterministic with 690 transitions.
Reduction of identical properties reduced properties to check from 62 to 60
RANDOM walk for 40000 steps (8 resets) in 2242 ms. (17 steps per ms) remains 16/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 327 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
[2024-06-01 19:35:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:35:31] [INFO ] Invariant cache hit.
[2024-06-01 19:35:31] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 320/470 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 320/487 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 4 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 4 ms to minimize.
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 4 ms to minimize.
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 62 places in 280 ms of which 4 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 4 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 3 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 3 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 12/507 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 4 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 3 ms to minimize.
SMT process timed out in 5275ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 150 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 480 transition count 592
Reduce places removed 98 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 106 rules applied. Total rules applied 204 place count 382 transition count 584
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 212 place count 374 transition count 584
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 212 place count 374 transition count 507
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 366 place count 297 transition count 507
Applied a total of 366 rules in 109 ms. Remains 297 /480 variables (removed 183) and now considering 507/690 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 297/480 places, 507/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 626 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 348492 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 16
Probabilistic random walk after 348492 steps, saw 61644 distinct states, run finished after 3006 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 19:35:40] [INFO ] Flow matrix only has 447 transitions (discarded 60 similar events)
// Phase 1: matrix 447 rows 297 cols
[2024-06-01 19:35:40] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 19:35:40] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 137/287 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 137/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:40] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 3 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 3 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 15/319 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 447/734 variables, 287/606 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 116/722 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:43] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:35:43] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:35:43] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 3/725 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/734 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/734 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/734 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/734 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 10/744 variables, 10/740 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/744 variables, 10/750 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/744 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/744 variables, 14/766 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:35:50] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/744 variables, 4/770 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/744 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:51] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:35:51] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:35:51] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2024-06-01 19:35:51] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 3 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/744 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:52] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:35:52] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:35:52] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:35:52] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/744 variables, 6/780 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/744 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:55] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
[2024-06-01 19:35:55] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:35:55] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/744 variables, 3/785 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/744 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/744 variables, 6/791 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:35:59] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:35:59] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:35:59] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/744 variables, 4/795 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/744 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 0/744 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 795 constraints, problems are : Problem set: 0 solved, 16 unsolved in 22782 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 297/297 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 137/287 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 137/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 28/332 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:03] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:36:03] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 3 ms to minimize.
[2024-06-01 19:36:03] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 14/346 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 4 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 447/734 variables, 287/642 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/734 variables, 116/758 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/734 variables, 14/772 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:09] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:36:09] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/734 variables, 2/774 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/734 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 10/744 variables, 10/784 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/744 variables, 10/794 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/744 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/744 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/744 variables, 38/836 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:13] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:36:13] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:36:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:36:14] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 3 ms to minimize.
[2024-06-01 19:36:14] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-01 19:36:14] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:36:15] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:36:15] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/744 variables, 8/844 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:36:18] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:36:18] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/744 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:21] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/744 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:23] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:36:24] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:36:24] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/744 variables, 3/851 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:26] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-06-01 19:36:26] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 3 ms to minimize.
[2024-06-01 19:36:26] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:36:28] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:36:29] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/744 variables, 5/856 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:31] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/744 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/744 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 19:36:34] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/744 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/744 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 31 (OVERLAPS) 0/744 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 858 constraints, problems are : Problem set: 0 solved, 16 unsolved in 37575 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 297/297 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 113/113 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1138 ms.
Support contains 150 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 507/507 transitions.
Applied a total of 0 rules in 30 ms. Remains 297 /297 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 297/297 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 507/507 transitions.
Applied a total of 0 rules in 21 ms. Remains 297 /297 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2024-06-01 19:36:41] [INFO ] Flow matrix only has 447 transitions (discarded 60 similar events)
[2024-06-01 19:36:41] [INFO ] Invariant cache hit.
[2024-06-01 19:36:42] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 19:36:42] [INFO ] Flow matrix only has 447 transitions (discarded 60 similar events)
[2024-06-01 19:36:42] [INFO ] Invariant cache hit.
[2024-06-01 19:36:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:36:42] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-06-01 19:36:42] [INFO ] Redundant transitions in 31 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 19:36:42] [INFO ] Flow matrix only has 447 transitions (discarded 60 similar events)
[2024-06-01 19:36:42] [INFO ] Invariant cache hit.
[2024-06-01 19:36:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 292/292 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 5/297 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 19:36:52] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:36:52] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 4 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 3 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 3 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 4 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 3 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:37:03] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:37:04] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:37:04] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:37:04] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:37:04] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 19:37:05] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:37:05] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:37:05] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 3 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 3 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:37:06] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:37:07] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:37:07] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
[2024-06-01 19:37:07] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:37:07] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:37:07] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:37:07] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
[2024-06-01 19:37:07] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:37:08] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/744 variables, and 396 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30014 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/297 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 292/292 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 71/367 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 5/297 variables, 10/377 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 5/382 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 9/396 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 19:37:20] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:37:20] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:37:20] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:37:20] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:37:20] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:37:21] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:37:21] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:37:21] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-06-01 19:37:21] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:37:21] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:37:22] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:37:22] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:37:22] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:37:22] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:37:22] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:37:22] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:37:22] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 3 ms to minimize.
[2024-06-01 19:37:23] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:37:23] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:37:23] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 19:37:30] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:37:30] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:37:30] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:37:30] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:37:31] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:37:31] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:37:31] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:37:32] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:37:32] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:37:32] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:37:32] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:37:32] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:37:32] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:37:32] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:37:33] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:37:33] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:37:33] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:37:34] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:37:34] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-06-01 19:37:34] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/744 variables, and 436 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30015 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/297 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/502 constraints, Known Traps: 120/120 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60884 ms. Remains : 297/297 places, 507/507 transitions.
[2024-06-01 19:37:42] [INFO ] Flatten gal took : 48 ms
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 54 ms
[2024-06-01 19:37:43] [INFO ] Input system was already deterministic with 690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 480 transition count 673
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 463 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 34 place count 463 transition count 604
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 172 place count 394 transition count 604
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 180 place count 390 transition count 600
Applied a total of 180 rules in 69 ms. Remains 390 /480 variables (removed 90) and now considering 600/690 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 390/480 places, 600/690 transitions.
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 37 ms
[2024-06-01 19:37:43] [INFO ] Input system was already deterministic with 600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:37:43] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 480 transition count 674
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 464 transition count 674
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 32 place count 464 transition count 669
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 459 transition count 669
Applied a total of 42 rules in 40 ms. Remains 459 /480 variables (removed 21) and now considering 669/690 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 459/480 places, 669/690 transitions.
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 23 ms
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:37:43] [INFO ] Input system was already deterministic with 669 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:37:43] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 398 place count 281 transition count 395
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 620 place count 170 transition count 380
Applied a total of 620 rules in 33 ms. Remains 170 /480 variables (removed 310) and now considering 380/690 (removed 310) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 170/480 places, 380/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 15 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 380 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 24 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 22 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 16 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 21 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 480 transition count 492
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 396 place count 282 transition count 392
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 636 place count 162 transition count 372
Applied a total of 636 rules in 27 ms. Remains 162 /480 variables (removed 318) and now considering 372/690 (removed 318) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 162/480 places, 372/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 191 place count 480 transition count 499
Reduce places removed 191 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 195 rules applied. Total rules applied 386 place count 289 transition count 495
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 390 place count 285 transition count 495
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 390 place count 285 transition count 398
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 584 place count 188 transition count 398
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 624 place count 168 transition count 378
Applied a total of 624 rules in 28 ms. Remains 168 /480 variables (removed 312) and now considering 378/690 (removed 312) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 168/480 places, 378/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 378 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 20 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 14 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 20 ms
[2024-06-01 19:37:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:37:44] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:37:45] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:37:45] [INFO ] Flatten gal took : 20 ms
[2024-06-01 19:37:45] [INFO ] Flatten gal took : 20 ms
[2024-06-01 19:37:45] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 283 transition count 493
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 394 place count 283 transition count 394
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 592 place count 184 transition count 394
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 632 place count 164 transition count 374
Applied a total of 632 rules in 24 ms. Remains 164 /480 variables (removed 316) and now considering 374/690 (removed 316) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 164/480 places, 374/690 transitions.
[2024-06-01 19:37:45] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:37:45] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:37:45] [INFO ] Input system was already deterministic with 374 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 281 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 638 place count 161 transition count 371
Applied a total of 638 rules in 27 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 161/480 places, 371/690 transitions.
[2024-06-01 19:37:45] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:37:45] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:37:45] [INFO ] Input system was already deterministic with 371 transitions.
RANDOM walk for 40000 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1339308 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1339308 steps, saw 223306 distinct states, run finished after 3005 ms. (steps per millisecond=445 ) properties seen :0
[2024-06-01 19:37:48] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2024-06-01 19:37:48] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 19:37:48] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 63/92 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/176 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/176 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/176 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/176 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 160/336 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 108/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/336 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 72/408 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 72/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/412 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/412 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/412 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/416 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/416 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/416 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 56/472 variables, 80/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/472 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/472 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 63/92 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/176 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/176 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/176 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/176 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 160/336 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 108/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/336 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 72/408 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 72/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/412 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/412 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/412 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/416 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/416 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/416 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:37:48] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:37:49] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:37:49] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/416 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/416 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 56/472 variables, 80/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/472 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/472 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 831ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA Peterson-PT-4-CTLFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
[2024-06-01 19:37:49] [INFO ] Flatten gal took : 33 ms
[2024-06-01 19:37:49] [INFO ] Flatten gal took : 33 ms
[2024-06-01 19:37:49] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 46 ms.
[2024-06-01 19:37:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 9 ms.
Total runtime 202561 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-00
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-01
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-02
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-03
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-04
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-05
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-06
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-07
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-08
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-09
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-10
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-11
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-12
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-13
Could not compute solution for formula : Peterson-PT-4-CTLFireability-2024-14

BK_STOP 1717270670237

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-PT-4-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1595/ctl_0_
ctl formula name Peterson-PT-4-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1595/ctl_1_
ctl formula name Peterson-PT-4-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1595/ctl_2_
ctl formula name Peterson-PT-4-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1595/ctl_3_
ctl formula name Peterson-PT-4-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1595/ctl_4_
ctl formula name Peterson-PT-4-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1595/ctl_5_
ctl formula name Peterson-PT-4-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1595/ctl_6_
ctl formula name Peterson-PT-4-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1595/ctl_7_
ctl formula name Peterson-PT-4-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1595/ctl_8_
ctl formula name Peterson-PT-4-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1595/ctl_9_
ctl formula name Peterson-PT-4-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1595/ctl_10_
ctl formula name Peterson-PT-4-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1595/ctl_11_
ctl formula name Peterson-PT-4-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1595/ctl_12_
ctl formula name Peterson-PT-4-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1595/ctl_13_
ctl formula name Peterson-PT-4-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1595/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;