MCC'2024- Execution of r492-smll-171636266300162

About the Execution of LTSMin+red for EisenbergMcGuire-PT-05

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
641.144	208225.00	286455.00	690.80	??????????T??T??	normal

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.r492-smll-171636266300162.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 EisenbergMcGuire-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717222086815

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:08:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:08:09] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2024-06-01 06:08:09] [INFO ] Transformed 295 places.
[2024-06-01 06:08:09] [INFO ] Transformed 800 transitions.
[2024-06-01 06:08:09] [INFO ] Found NUPN structural information;
[2024-06-01 06:08:09] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 658 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 91 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 285 transition count 750
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 285 transition count 750
Applied a total of 20 rules in 127 ms. Remains 285 /295 variables (removed 10) and now considering 750/800 (removed 50) transitions.
[2024-06-01 06:08:10] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
// Phase 1: matrix 415 rows 285 cols
[2024-06-01 06:08:10] [INFO ] Computed 16 invariants in 39 ms
[2024-06-01 06:08:10] [INFO ] Implicit Places using invariants in 916 ms returned []
[2024-06-01 06:08:10] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
[2024-06-01 06:08:10] [INFO ] Invariant cache hit.
[2024-06-01 06:08:11] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-06-01 06:08:11] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
Running 745 sub problems to find dead transitions.
[2024-06-01 06:08:12] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
[2024-06-01 06:08:12] [INFO ] Invariant cache hit.
[2024-06-01 06:08:12] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-01 06:08:21] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 43 ms to minimize.
[2024-06-01 06:08:21] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 4 ms to minimize.
[2024-06-01 06:08:21] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 5 ms to minimize.
[2024-06-01 06:08:22] [INFO ] Deduced a trap composed of 51 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:08:22] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 5 ms to minimize.
[2024-06-01 06:08:22] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:08:22] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:08:23] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 4 ms to minimize.
[2024-06-01 06:08:23] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:08:23] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:08:23] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:08:23] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:08:23] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:08:24] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 4 ms to minimize.
[2024-06-01 06:08:25] [INFO ] Deduced a trap composed of 64 places in 328 ms of which 5 ms to minimize.
[2024-06-01 06:08:25] [INFO ] Deduced a trap composed of 52 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:08:25] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:08:25] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 4 ms to minimize.
[2024-06-01 06:08:26] [INFO ] Deduced a trap composed of 74 places in 245 ms of which 5 ms to minimize.
[2024-06-01 06:08:26] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-01 06:08:27] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:08:27] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:08:27] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 4 ms to minimize.
[2024-06-01 06:08:27] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:08:27] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 4 ms to minimize.
[2024-06-01 06:08:28] [INFO ] Deduced a trap composed of 60 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:08:29] [INFO ] Deduced a trap composed of 53 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:08:29] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 5 ms to minimize.
[2024-06-01 06:08:29] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:08:29] [INFO ] Deduced a trap composed of 41 places in 311 ms of which 4 ms to minimize.
[2024-06-01 06:08:30] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:08:30] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:08:30] [INFO ] Deduced a trap composed of 74 places in 239 ms of which 5 ms to minimize.
[2024-06-01 06:08:31] [INFO ] Deduced a trap composed of 35 places in 284 ms of which 5 ms to minimize.
[2024-06-01 06:08:31] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:08:31] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:08:32] [INFO ] Deduced a trap composed of 90 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:08:32] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:08:32] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:08:32] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-01 06:08:40] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:08:41] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 5 ms to minimize.
[2024-06-01 06:08:41] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:08:42] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 4 ms to minimize.
[2024-06-01 06:08:42] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:08:42] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/700 variables, and 62 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/285 constraints, ReadFeed: 0/156 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-01 06:08:46] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:08:46] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:08:46] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:08:46] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 5 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 81 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:08:47] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 73 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 5 ms to minimize.
[2024-06-01 06:08:48] [INFO ] Deduced a trap composed of 74 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:08:50] [INFO ] Deduced a trap composed of 81 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:08:50] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 5 ms to minimize.
[2024-06-01 06:08:50] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:08:51] [INFO ] Deduced a trap composed of 71 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:08:51] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:08:53] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:08:54] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:08:55] [INFO ] Deduced a trap composed of 57 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:08:55] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-01 06:08:56] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 4 ms to minimize.
[2024-06-01 06:08:57] [INFO ] Deduced a trap composed of 76 places in 318 ms of which 5 ms to minimize.
[2024-06-01 06:08:57] [INFO ] Deduced a trap composed of 84 places in 327 ms of which 5 ms to minimize.
[2024-06-01 06:08:58] [INFO ] Deduced a trap composed of 104 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:08:58] [INFO ] Deduced a trap composed of 80 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:08:58] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:08:58] [INFO ] Deduced a trap composed of 75 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:08:59] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 5 ms to minimize.
[2024-06-01 06:08:59] [INFO ] Deduced a trap composed of 81 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:08:59] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:09:00] [INFO ] Deduced a trap composed of 74 places in 224 ms of which 4 ms to minimize.
[2024-06-01 06:09:00] [INFO ] Deduced a trap composed of 71 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:09:00] [INFO ] Deduced a trap composed of 60 places in 298 ms of which 4 ms to minimize.
[2024-06-01 06:09:01] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:09:01] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:09:03] [INFO ] Deduced a trap composed of 53 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:09:03] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:09:04] [INFO ] Deduced a trap composed of 89 places in 271 ms of which 5 ms to minimize.
[2024-06-01 06:09:07] [INFO ] Deduced a trap composed of 82 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:09:07] [INFO ] Deduced a trap composed of 61 places in 294 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-01 06:09:09] [INFO ] Deduced a trap composed of 78 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:09:09] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:09:11] [INFO ] Deduced a trap composed of 74 places in 278 ms of which 4 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 285/700 variables, and 105 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/285 constraints, ReadFeed: 0/156 constraints, PredecessorRefiner: 0/745 constraints, Known Traps: 89/89 constraints]
After SMT, in 60905ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 60966ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 750/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63175 ms. Remains : 285/295 places, 750/800 transitions.
Support contains 91 out of 285 places after structural reductions.
[2024-06-01 06:09:13] [INFO ] Flatten gal took : 173 ms
[2024-06-01 06:09:13] [INFO ] Flatten gal took : 110 ms
[2024-06-01 06:09:13] [INFO ] Input system was already deterministic with 750 transitions.
Support contains 90 out of 285 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4369 ms. (9 steps per ms) remains 45/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
[2024-06-01 06:09:15] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
[2024-06-01 06:09:15] [INFO ] Invariant cache hit.
[2024-06-01 06:09:15] [INFO ] State equation strengthened by 156 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 225/285 variables, 10/11 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 5/16 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 4 ms to minimize.
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:09:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:09:17] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
Problem AtomicPropp67 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 12/28 constraints. Problems are: Problem set: 3 solved, 41 unsolved
[2024-06-01 06:09:18] [INFO ] Deduced a trap composed of 61 places in 263 ms of which 3 ms to minimize.
[2024-06-01 06:09:18] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:09:18] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:09:18] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 4/32 constraints. Problems are: Problem set: 3 solved, 41 unsolved
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/34 constraints. Problems are: Problem set: 3 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 41 unsolved
SMT process timed out in 5056ms, After SMT, problems are : Problem set: 3 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 10 place count 280 transition count 676
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 148 place count 211 transition count 676
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 152 place count 207 transition count 656
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 207 transition count 656
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 194 place count 188 transition count 637
Applied a total of 194 rules in 180 ms. Remains 188 /285 variables (removed 97) and now considering 637/750 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 188/285 places, 637/750 transitions.
RANDOM walk for 40000 steps (8 resets) in 897 ms. (44 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
[2024-06-01 06:09:21] [INFO ] Flow matrix only has 302 transitions (discarded 335 similar events)
// Phase 1: matrix 302 rows 188 cols
[2024-06-01 06:09:21] [INFO ] Computed 16 invariants in 7 ms
[2024-06-01 06:09:21] [INFO ] State equation strengthened by 140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 137/188 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:22] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:09:22] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:09:22] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:09:22] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:09:23] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:09:23] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:09:23] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:09:23] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:09:23] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:09:23] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:09:24] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:09:24] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:24] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:09:24] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:24] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:09:25] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:09:25] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:09:25] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:25] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:09:26] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:26] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:09:27] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 302/490 variables, 188/226 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 140/366 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 0/490 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 366 constraints, problems are : Problem set: 0 solved, 36 unsolved in 7786 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 137/188 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:09:30] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 7 ms to minimize.
[2024-06-01 06:09:31] [INFO ] Deduced a trap composed of 56 places in 247 ms of which 3 ms to minimize.
[2024-06-01 06:09:31] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:09:31] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:09:31] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:09:32] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:09:33] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:09:33] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:33] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:09:34] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:09:34] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 302/490 variables, 188/243 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 140/383 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 36/419 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:36] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:09:36] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:39] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:09:39] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/490 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/490 variables, 4/427 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:44] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 06:09:45] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 20 (OVERLAPS) 0/490 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 429 constraints, problems are : Problem set: 0 solved, 36 unsolved in 20357 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 49/49 constraints]
After SMT, in 28209ms problems are : Problem set: 0 solved, 36 unsolved
Parikh walk visited 2 properties in 6675 ms.
Support contains 49 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 637/637 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 188 transition count 632
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 183 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 182 transition count 627
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 182 transition count 627
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 181 transition count 626
Applied a total of 14 rules in 54 ms. Remains 181 /188 variables (removed 7) and now considering 626/637 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 181/188 places, 626/637 transitions.
RANDOM walk for 40000 steps (8 resets) in 686 ms. (58 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 198510 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :12 out of 32
Probabilistic random walk after 198510 steps, saw 54169 distinct states, run finished after 3014 ms. (steps per millisecond=65 ) properties seen :12
[2024-06-01 06:09:59] [INFO ] Flow matrix only has 291 transitions (discarded 335 similar events)
// Phase 1: matrix 291 rows 181 cols
[2024-06-01 06:09:59] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:09:59] [INFO ] State equation strengthened by 136 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 143/181 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:00] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:10:00] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:10:00] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:10:00] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:10:01] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:10:01] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:10:01] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:01] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:10:01] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 291/472 variables, 181/206 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 136/342 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:02] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/472 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 343 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3265 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 143/181 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:03] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:10:03] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:10:04] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 3 ms to minimize.
[2024-06-01 06:10:04] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:10:04] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:10:04] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:10:04] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:10:05] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:10:05] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:10:05] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:10:05] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:10:05] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:06] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:10:06] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:06] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:10:06] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:07] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 3 ms to minimize.
[2024-06-01 06:10:07] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:10:07] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:10:08] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:08] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:10:08] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:10:08] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 291/472 variables, 181/230 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 136/366 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/472 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 386 constraints, problems are : Problem set: 0 solved, 20 unsolved in 8088 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 33/33 constraints]
After SMT, in 11387ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 2045 ms.
Support contains 38 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 626/626 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 181 transition count 623
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 178 transition count 623
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 175 transition count 608
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 175 transition count 608
Applied a total of 12 rules in 29 ms. Remains 175 /181 variables (removed 6) and now considering 608/626 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 175/181 places, 608/626 transitions.
RANDOM walk for 40000 steps (8 resets) in 376 ms. (106 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 234798 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 20
Probabilistic random walk after 234798 steps, saw 56883 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 06:10:16] [INFO ] Flow matrix only has 273 transitions (discarded 335 similar events)
// Phase 1: matrix 273 rows 175 cols
[2024-06-01 06:10:16] [INFO ] Computed 16 invariants in 6 ms
[2024-06-01 06:10:16] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 137/175 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 3 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:10:17] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 273/448 variables, 175/199 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 124/323 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:18] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:10:18] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:10:18] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-06-01 06:10:19] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/448 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 327 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3356 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 175/175 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 137/175 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:20] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:10:20] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 4 ms to minimize.
[2024-06-01 06:10:20] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:10:21] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:10:22] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:23] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:10:23] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:10:23] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:10:23] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:23] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:24] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:24] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 273/448 variables, 175/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 124/346 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 20/366 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:10:26] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/448 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 367 constraints, problems are : Problem set: 0 solved, 20 unsolved in 8156 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 175/175 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 32/32 constraints]
After SMT, in 11546ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 1611 ms.
Support contains 38 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 608/608 transitions.
Applied a total of 0 rules in 17 ms. Remains 175 /175 variables (removed 0) and now considering 608/608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 175/175 places, 608/608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 608/608 transitions.
Applied a total of 0 rules in 15 ms. Remains 175 /175 variables (removed 0) and now considering 608/608 (removed 0) transitions.
[2024-06-01 06:10:29] [INFO ] Flow matrix only has 273 transitions (discarded 335 similar events)
[2024-06-01 06:10:29] [INFO ] Invariant cache hit.
[2024-06-01 06:10:30] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 06:10:30] [INFO ] Flow matrix only has 273 transitions (discarded 335 similar events)
[2024-06-01 06:10:30] [INFO ] Invariant cache hit.
[2024-06-01 06:10:30] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:10:30] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2024-06-01 06:10:30] [INFO ] Redundant transitions in 63 ms returned []
Running 603 sub problems to find dead transitions.
[2024-06-01 06:10:30] [INFO ] Flow matrix only has 273 transitions (discarded 335 similar events)
[2024-06-01 06:10:30] [INFO ] Invariant cache hit.
[2024-06-01 06:10:30] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:10:36] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:10:37] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:10:37] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:10:37] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:10:37] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:10:38] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:10:38] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 5 ms to minimize.
[2024-06-01 06:10:38] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:10:38] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:10:38] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:10:39] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:10:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:10:39] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:10:39] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:10:39] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:10:40] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:10:41] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:10:41] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:10:41] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:10:41] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:10:42] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:10:42] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:10:42] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:10:42] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:10:43] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:10:43] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:10:43] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:10:43] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:10:43] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:10:44] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:10:44] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:10:44] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:10:44] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:10:45] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:10:45] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:10:45] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:10:51] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:10:51] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:10:52] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:10:53] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:10:53] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:10:53] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:10:54] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:10:54] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:10:55] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:10:55] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:10:56] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:10:56] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:10:56] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:10:58] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:10:59] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:11:00] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:11:00] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:11:00] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:11:01] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/448 variables, and 75 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/175 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:11:05] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:11:05] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:11:06] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:11:06] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:11:07] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:11:07] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:11:07] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:11:07] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:11:08] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:11:08] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:11:08] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:11:09] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:11:14] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:11:14] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:11:15] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:11:16] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:11:16] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:11:16] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:11:16] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:11:17] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:11:17] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:11:17] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:11:17] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:11:18] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:11:18] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:11:19] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:11:19] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:11:19] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:11:20] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:11:21] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:11:21] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:11:21] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:11:21] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:11:22] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:11:23] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:11:23] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:11:24] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:11:24] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:11:25] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:11:25] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:11:25] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:11:26] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:11:26] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:11:27] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 16/123 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-06-01 06:11:31] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2024-06-01 06:11:31] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:11:31] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 175/448 variables, and 126 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/175 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/603 constraints, Known Traps: 110/110 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61532 ms. Remains : 175/175 places, 608/608 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-01 06:11:31] [INFO ] Flatten gal took : 74 ms
[2024-06-01 06:11:31] [INFO ] Flatten gal took : 79 ms
[2024-06-01 06:11:31] [INFO ] Input system was already deterministic with 750 transitions.
Support contains 85 out of 285 places (down from 86) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 275 transition count 700
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 275 transition count 700
Applied a total of 20 rules in 21 ms. Remains 275 /285 variables (removed 10) and now considering 700/750 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 275/285 places, 700/750 transitions.
[2024-06-01 06:11:31] [INFO ] Flatten gal took : 45 ms
[2024-06-01 06:11:31] [INFO ] Flatten gal took : 49 ms
[2024-06-01 06:11:31] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 10 place count 280 transition count 668
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 164 place count 203 transition count 668
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 173 place count 194 transition count 623
Iterating global reduction 2 with 9 rules applied. Total rules applied 182 place count 194 transition count 623
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 220 place count 175 transition count 604
Applied a total of 220 rules in 117 ms. Remains 175 /285 variables (removed 110) and now considering 604/750 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 122 ms. Remains : 175/285 places, 604/750 transitions.
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 38 ms
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 41 ms
[2024-06-01 06:11:32] [INFO ] Input system was already deterministic with 604 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 280 transition count 667
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 202 transition count 667
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 195 transition count 632
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 195 transition count 632
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 218 place count 176 transition count 613
Applied a total of 218 rules in 57 ms. Remains 176 /285 variables (removed 109) and now considering 613/750 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 176/285 places, 613/750 transitions.
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 23 ms
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:11:32] [INFO ] Input system was already deterministic with 613 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 280 transition count 666
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 201 transition count 666
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 177 place count 192 transition count 621
Iterating global reduction 2 with 9 rules applied. Total rules applied 186 place count 192 transition count 621
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 226 place count 172 transition count 601
Applied a total of 226 rules in 47 ms. Remains 172 /285 variables (removed 113) and now considering 601/750 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 172/285 places, 601/750 transitions.
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 22 ms
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 23 ms
[2024-06-01 06:11:32] [INFO ] Input system was already deterministic with 601 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 280 transition count 667
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 202 transition count 667
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 174 place count 194 transition count 627
Iterating global reduction 2 with 8 rules applied. Total rules applied 182 place count 194 transition count 627
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 222 place count 174 transition count 607
Applied a total of 222 rules in 43 ms. Remains 174 /285 variables (removed 111) and now considering 607/750 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 174/285 places, 607/750 transitions.
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 24 ms
[2024-06-01 06:11:32] [INFO ] Input system was already deterministic with 607 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 11 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 276/285 places, 705/750 transitions.
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 22 ms
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 24 ms
[2024-06-01 06:11:32] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 275 transition count 700
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 275 transition count 700
Applied a total of 20 rules in 14 ms. Remains 275 /285 variables (removed 10) and now considering 700/750 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 275/285 places, 700/750 transitions.
[2024-06-01 06:11:32] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 51 ms
[2024-06-01 06:11:33] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 14 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 276/285 places, 705/750 transitions.
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 32 ms
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 35 ms
[2024-06-01 06:11:33] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 14 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 276/285 places, 705/750 transitions.
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 33 ms
[2024-06-01 06:11:33] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 12 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 276/285 places, 705/750 transitions.
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 33 ms
[2024-06-01 06:11:33] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 280 transition count 666
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 201 transition count 666
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 191 transition count 616
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 191 transition count 616
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 228 place count 171 transition count 596
Applied a total of 228 rules in 55 ms. Remains 171 /285 variables (removed 114) and now considering 596/750 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 171/285 places, 596/750 transitions.
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 24 ms
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 26 ms
[2024-06-01 06:11:33] [INFO ] Input system was already deterministic with 596 transitions.
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 331 steps, run visited all 1 properties in 5 ms. (steps per millisecond=66 )
Probabilistic random walk after 331 steps, saw 269 distinct states, run finished after 11 ms. (steps per millisecond=30 ) properties seen :1
FORMULA EisenbergMcGuire-PT-05-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 280 transition count 667
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 202 transition count 667
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 192 transition count 617
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 192 transition count 617
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 226 place count 172 transition count 597
Applied a total of 226 rules in 38 ms. Remains 172 /285 variables (removed 113) and now considering 597/750 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 172/285 places, 597/750 transitions.
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 19 ms
[2024-06-01 06:11:33] [INFO ] Input system was already deterministic with 597 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 8 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 276/285 places, 705/750 transitions.
[2024-06-01 06:11:33] [INFO ] Flatten gal took : 19 ms
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:11:34] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 285 transition count 746
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 281 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 10 place count 280 transition count 666
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 168 place count 201 transition count 666
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 178 place count 191 transition count 616
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 228 place count 171 transition count 596
Applied a total of 228 rules in 41 ms. Remains 171 /285 variables (removed 114) and now considering 596/750 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 171/285 places, 596/750 transitions.
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 19 ms
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:11:34] [INFO ] Input system was already deterministic with 596 transitions.
RANDOM walk for 712 steps (0 resets) in 9 ms. (71 steps per ms) remains 0/1 properties
FORMULA EisenbergMcGuire-PT-05-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 275 transition count 700
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 275 transition count 700
Applied a total of 20 rules in 6 ms. Remains 275 /285 variables (removed 10) and now considering 700/750 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 275/285 places, 700/750 transitions.
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 18 ms
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:11:34] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 277 transition count 710
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 277 transition count 710
Applied a total of 16 rules in 6 ms. Remains 277 /285 variables (removed 8) and now considering 710/750 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 277/285 places, 710/750 transitions.
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 19 ms
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:11:34] [INFO ] Input system was already deterministic with 710 transitions.
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 22 ms
[2024-06-01 06:11:34] [INFO ] Flatten gal took : 20 ms
[2024-06-01 06:11:34] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 06:11:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 285 places, 750 transitions and 3400 arcs took 7 ms.
Total runtime 205611 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 : EisenbergMcGuire-PT-05-CTLFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-01
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2024-11
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2023-14
Could not compute solution for formula : EisenbergMcGuire-PT-05-CTLFireability-2023-15

BK_STOP 1717222295040

--------------------
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 EisenbergMcGuire-PT-05-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1568/ctl_0_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1568/ctl_1_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1568/ctl_2_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1568/ctl_3_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1568/ctl_4_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1568/ctl_5_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1568/ctl_6_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1568/ctl_7_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1568/ctl_8_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1568/ctl_9_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1568/ctl_10_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1568/ctl_11_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1568/ctl_12_
ctl formula name EisenbergMcGuire-PT-05-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1568/ctl_13_
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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r492-smll-171636266300162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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