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-171636266300169.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-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 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 753K 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-06-CTLCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2023-12
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717223540972

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:32:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:32:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:32:24] [INFO ] Load time of PNML (sax parser for PT used): 504 ms
[2024-06-01 06:32:24] [INFO ] Transformed 414 places.
[2024-06-01 06:32:24] [INFO ] Transformed 1296 transitions.
[2024-06-01 06:32:24] [INFO ] Found NUPN structural information;
[2024-06-01 06:32:24] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 754 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 392 transition count 1164
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 392 transition count 1164
Applied a total of 44 rules in 176 ms. Remains 392 /414 variables (removed 22) and now considering 1164/1296 (removed 132) transitions.
[2024-06-01 06:32:24] [INFO ] Flow matrix only has 570 transitions (discarded 594 similar events)
// Phase 1: matrix 570 rows 392 cols
[2024-06-01 06:32:24] [INFO ] Computed 19 invariants in 42 ms
[2024-06-01 06:32:25] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2024-06-01 06:32:25] [INFO ] Flow matrix only has 570 transitions (discarded 594 similar events)
[2024-06-01 06:32:25] [INFO ] Invariant cache hit.
[2024-06-01 06:32:26] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-06-01 06:32:27] [INFO ] Implicit Places using invariants and state equation in 2048 ms returned []
Implicit Place search using SMT with State Equation took 3182 ms to find 0 implicit places.
Running 1158 sub problems to find dead transitions.
[2024-06-01 06:32:27] [INFO ] Flow matrix only has 570 transitions (discarded 594 similar events)
[2024-06-01 06:32:28] [INFO ] Invariant cache hit.
[2024-06-01 06:32:28] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 06:32:45] [INFO ] Deduced a trap composed of 34 places in 308 ms of which 44 ms to minimize.
[2024-06-01 06:32:45] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:32:45] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:32:46] [INFO ] Deduced a trap composed of 27 places in 444 ms of which 6 ms to minimize.
[2024-06-01 06:32:46] [INFO ] Deduced a trap composed of 32 places in 370 ms of which 7 ms to minimize.
[2024-06-01 06:32:46] [INFO ] Deduced a trap composed of 78 places in 329 ms of which 6 ms to minimize.
[2024-06-01 06:32:47] [INFO ] Deduced a trap composed of 59 places in 373 ms of which 5 ms to minimize.
[2024-06-01 06:32:47] [INFO ] Deduced a trap composed of 66 places in 404 ms of which 6 ms to minimize.
[2024-06-01 06:32:48] [INFO ] Deduced a trap composed of 59 places in 381 ms of which 4 ms to minimize.
[2024-06-01 06:32:48] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:32:48] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:32:48] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 5 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 81 places in 376 ms of which 7 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 69 places in 442 ms of which 6 ms to minimize.
[2024-06-01 06:32:51] [INFO ] Deduced a trap composed of 56 places in 288 ms of which 5 ms to minimize.
[2024-06-01 06:32:51] [INFO ] Deduced a trap composed of 63 places in 390 ms of which 6 ms to minimize.
[2024-06-01 06:32:52] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 5 ms to minimize.
[2024-06-01 06:32:52] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 5 ms to minimize.
[2024-06-01 06:32:52] [INFO ] Deduced a trap composed of 61 places in 361 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 06:32:53] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:32:53] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:32:54] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:32:55] [INFO ] Deduced a trap composed of 64 places in 326 ms of which 5 ms to minimize.
[2024-06-01 06:32:56] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:32:57] [INFO ] Deduced a trap composed of 83 places in 314 ms of which 5 ms to minimize.
[2024-06-01 06:32:57] [INFO ] Deduced a trap composed of 48 places in 345 ms of which 5 ms to minimize.
[2024-06-01 06:32:58] [INFO ] Deduced a trap composed of 66 places in 351 ms of which 5 ms to minimize.
[2024-06-01 06:32:58] [INFO ] Deduced a trap composed of 58 places in 310 ms of which 4 ms to minimize.
[2024-06-01 06:32:58] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:32:59] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/962 variables, and 50 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/392 constraints, ReadFeed: 0/204 constraints, PredecessorRefiner: 1158/1158 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 4 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:33:03] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 12 ms to minimize.
[2024-06-01 06:33:03] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:33:05] [INFO ] Deduced a trap composed of 61 places in 328 ms of which 5 ms to minimize.
[2024-06-01 06:33:05] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 5 ms to minimize.
[2024-06-01 06:33:06] [INFO ] Deduced a trap composed of 40 places in 316 ms of which 5 ms to minimize.
[2024-06-01 06:33:06] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:33:07] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:33:09] [INFO ] Deduced a trap composed of 41 places in 439 ms of which 5 ms to minimize.
[2024-06-01 06:33:09] [INFO ] Deduced a trap composed of 118 places in 430 ms of which 6 ms to minimize.
[2024-06-01 06:33:10] [INFO ] Deduced a trap composed of 43 places in 438 ms of which 6 ms to minimize.
[2024-06-01 06:33:10] [INFO ] Deduced a trap composed of 43 places in 420 ms of which 5 ms to minimize.
[2024-06-01 06:33:11] [INFO ] Deduced a trap composed of 111 places in 414 ms of which 6 ms to minimize.
[2024-06-01 06:33:11] [INFO ] Deduced a trap composed of 123 places in 410 ms of which 6 ms to minimize.
[2024-06-01 06:33:11] [INFO ] Deduced a trap composed of 107 places in 402 ms of which 5 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 98 places in 382 ms of which 6 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 92 places in 421 ms of which 5 ms to minimize.
[2024-06-01 06:33:13] [INFO ] Deduced a trap composed of 87 places in 412 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 83 places in 357 ms of which 5 ms to minimize.
[2024-06-01 06:33:18] [INFO ] Deduced a trap composed of 112 places in 448 ms of which 6 ms to minimize.
[2024-06-01 06:33:19] [INFO ] Deduced a trap composed of 106 places in 419 ms of which 5 ms to minimize.
[2024-06-01 06:33:19] [INFO ] Deduced a trap composed of 106 places in 414 ms of which 5 ms to minimize.
[2024-06-01 06:33:20] [INFO ] Deduced a trap composed of 113 places in 339 ms of which 6 ms to minimize.
[2024-06-01 06:33:20] [INFO ] Deduced a trap composed of 81 places in 425 ms of which 7 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 96 places in 374 ms of which 5 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 95 places in 405 ms of which 6 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 55 places in 420 ms of which 6 ms to minimize.
[2024-06-01 06:33:22] [INFO ] Deduced a trap composed of 77 places in 396 ms of which 6 ms to minimize.
[2024-06-01 06:33:23] [INFO ] Deduced a trap composed of 53 places in 447 ms of which 6 ms to minimize.
[2024-06-01 06:33:24] [INFO ] Deduced a trap composed of 45 places in 443 ms of which 6 ms to minimize.
[2024-06-01 06:33:24] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:33:25] [INFO ] Deduced a trap composed of 29 places in 485 ms of which 6 ms to minimize.
[2024-06-01 06:33:25] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 6 ms to minimize.
[2024-06-01 06:33:26] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:33:26] [INFO ] Deduced a trap composed of 127 places in 490 ms of which 6 ms to minimize.
[2024-06-01 06:33:26] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:33:27] [INFO ] Deduced a trap composed of 20 places in 476 ms of which 7 ms to minimize.
[2024-06-01 06:33:27] [INFO ] Deduced a trap composed of 17 places in 450 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/962 variables, and 90 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/392 constraints, ReadFeed: 0/204 constraints, PredecessorRefiner: 0/1158 constraints, Known Traps: 71/71 constraints]
After SMT, in 61414ms problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 61483ms
Starting structural reductions in LTL mode, iteration 1 : 392/414 places, 1164/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64908 ms. Remains : 392/414 places, 1164/1296 transitions.
Support contains 85 out of 392 places after structural reductions.
[2024-06-01 06:33:30] [INFO ] Flatten gal took : 230 ms
[2024-06-01 06:33:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:33:30] [INFO ] Flatten gal took : 145 ms
[2024-06-01 06:33:30] [INFO ] Input system was already deterministic with 1164 transitions.
Support contains 74 out of 392 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2143 ms. (18 steps per ms) remains 18/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
[2024-06-01 06:33:31] [INFO ] Flow matrix only has 570 transitions (discarded 594 similar events)
[2024-06-01 06:33:31] [INFO ] Invariant cache hit.
[2024-06-01 06:33:31] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 339/374 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 12/386 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 570/956 variables, 386/404 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/956 variables, 204/608 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/956 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 6/962 variables, 6/614 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/962 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 615 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2864 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 392/392 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 339/374 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 12/386 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 3 ms to minimize.
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 17 places in 361 ms of which 5 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 62 places in 371 ms of which 6 ms to minimize.
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 6 ms to minimize.
SMT process timed out in 8036ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 1164/1164 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 392 transition count 1159
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 387 transition count 1159
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 10 place count 387 transition count 1063
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 202 place count 291 transition count 1063
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 209 place count 284 transition count 1021
Iterating global reduction 2 with 7 rules applied. Total rules applied 216 place count 284 transition count 1021
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 262 place count 261 transition count 998
Applied a total of 262 rules in 278 ms. Remains 261 /392 variables (removed 131) and now considering 998/1164 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 261/392 places, 998/1164 transitions.
RANDOM walk for 40000 steps (8 resets) in 739 ms. (54 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 196287 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :13 out of 17
Probabilistic random walk after 196287 steps, saw 81885 distinct states, run finished after 3012 ms. (steps per millisecond=65 ) properties seen :13
[2024-06-01 06:33:43] [INFO ] Flow matrix only has 404 transitions (discarded 594 similar events)
// Phase 1: matrix 404 rows 261 cols
[2024-06-01 06:33:43] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 06:33:43] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 192/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/216 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 341/557 variables, 216/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 70/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/573 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 18/591 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 29/620 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/620 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/622 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/622 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 43/665 variables, 31/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/665 variables, 48/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/665 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/665 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 449 constraints, problems are : Problem set: 0 solved, 4 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 261/261 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 192/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/216 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 341/557 variables, 216/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 70/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/573 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/573 variables, 43/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/573 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/573 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 18/591 variables, 8/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/591 variables, 8/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/591 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 29/620 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/620 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/622 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:33:45] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/622 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/622 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 43/665 variables, 31/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/665 variables, 48/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/665 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/665 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 459 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2126 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 261/261 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 2911ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 1219 ms.
Support contains 9 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 998/998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 261 transition count 997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 260 transition count 997
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 2 place count 260 transition count 984
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 28 place count 247 transition count 984
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 242 transition count 979
Applied a total of 38 rules in 107 ms. Remains 242 /261 variables (removed 19) and now considering 979/998 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 242/261 places, 979/998 transitions.
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 552636 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :2 out of 3
Probabilistic random walk after 552636 steps, saw 168562 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :2
[2024-06-01 06:33:50] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
// Phase 1: matrix 385 rows 242 cols
[2024-06-01 06:33:50] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 06:33:50] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/160 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 261/421 variables, 160/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 44/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/447 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 35/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/483 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/483 variables, 14/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/483 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 56/539 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/539 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/543 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 84/627 variables, 60/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/627 variables, 76/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/627 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/627 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 242/242 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/160 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 261/421 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 44/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/447 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 35/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/483 variables, 16/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/483 variables, 14/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/483 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 56/539 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/543 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/543 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 84/627 variables, 60/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/627 variables, 76/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/627 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/627 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 242/242 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1262ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 7 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 979/979 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 242 transition count 978
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 978
Applied a total of 2 rules in 56 ms. Remains 241 /242 variables (removed 1) and now considering 978/979 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 241/242 places, 978/979 transitions.
RANDOM walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 614327 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 614327 steps, saw 181293 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-06-01 06:33:55] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
// Phase 1: matrix 384 rows 241 cols
[2024-06-01 06:33:55] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 06:33:55] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/159 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 260/419 variables, 159/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 44/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/445 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 35/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/481 variables, 16/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/481 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/481 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 56/537 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/541 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/541 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 84/625 variables, 60/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/625 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 241/241 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/159 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 260/419 variables, 159/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 44/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/445 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 35/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/481 variables, 16/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/481 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/481 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 56/537 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/541 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/541 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/541 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/541 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 84/625 variables, 60/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/625 variables, 76/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/625 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/625 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 431 constraints, problems are : Problem set: 0 solved, 1 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 241/241 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1077ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 978/978 transitions.
Applied a total of 0 rules in 39 ms. Remains 241 /241 variables (removed 0) and now considering 978/978 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 241/241 places, 978/978 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 978/978 transitions.
Applied a total of 0 rules in 39 ms. Remains 241 /241 variables (removed 0) and now considering 978/978 (removed 0) transitions.
[2024-06-01 06:33:56] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2024-06-01 06:33:56] [INFO ] Invariant cache hit.
[2024-06-01 06:33:56] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-06-01 06:33:56] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2024-06-01 06:33:56] [INFO ] Invariant cache hit.
[2024-06-01 06:33:57] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 06:33:58] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2024-06-01 06:33:58] [INFO ] Redundant transitions in 109 ms returned []
Running 972 sub problems to find dead transitions.
[2024-06-01 06:33:58] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2024-06-01 06:33:58] [INFO ] Invariant cache hit.
[2024-06-01 06:33:58] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 3 ms to minimize.
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:34:09] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:34:09] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:34:09] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:34:10] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:34:10] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 3 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 3 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:34:14] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 06:34:15] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:34:15] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 3 ms to minimize.
[2024-06-01 06:34:16] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 3 ms to minimize.
[2024-06-01 06:34:16] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:34:16] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:34:16] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:34:17] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 3 ms to minimize.
[2024-06-01 06:34:17] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:34:17] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 53 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 4 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 16 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 88 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 4 ms to minimize.
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/625 variables, and 59 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/241 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 972/972 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 68 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 3 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 3 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 57 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 4 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 80 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 4 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 4 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 57 places in 287 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 3 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 3 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 4 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 54 places in 294 ms of which 3 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 73 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:34:55] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 3 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-06-01 06:34:58] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 61071ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 61093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63048 ms. Remains : 241/241 places, 978/978 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 867 edges and 241 vertex of which 33 / 241 are part of one of the 6 SCC in 6 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 97 transitions
Ensure Unique test removed 582 transitions
Reduce isomorphic transitions removed 679 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 214 transition count 252
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 167 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 166 transition count 251
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 97 place count 166 transition count 242
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 117 place count 155 transition count 242
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 233 place count 97 transition count 184
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 263 place count 97 transition count 154
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 273 place count 92 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 275 place count 92 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 280 place count 92 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 284 place count 90 transition count 168
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 306 place count 90 transition count 146
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 328 place count 68 transition count 146
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 338 place count 68 transition count 146
Applied a total of 338 rules in 88 ms. Remains 68 /241 variables (removed 173) and now considering 146/978 (removed 832) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 68 cols
[2024-06-01 06:34:59] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 06:34:59] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:34:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 06:34:59] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 06:34:59] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:34:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:34:59] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:34:59] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:34:59] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 383 ms.
[2024-06-01 06:34:59] [INFO ] Flatten gal took : 94 ms
[2024-06-01 06:35:00] [INFO ] Flatten gal took : 84 ms
[2024-06-01 06:35:00] [INFO ] Input system was already deterministic with 1164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 384 transition count 1116
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 384 transition count 1116
Applied a total of 16 rules in 40 ms. Remains 384 /392 variables (removed 8) and now considering 1116/1164 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 384/392 places, 1116/1164 transitions.
[2024-06-01 06:35:00] [INFO ] Flatten gal took : 65 ms
[2024-06-01 06:35:00] [INFO ] Flatten gal took : 71 ms
[2024-06-01 06:35:00] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 384 transition count 1116
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 384 transition count 1116
Applied a total of 16 rules in 33 ms. Remains 384 /392 variables (removed 8) and now considering 1116/1164 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 384/392 places, 1116/1164 transitions.
[2024-06-01 06:35:00] [INFO ] Flatten gal took : 65 ms
[2024-06-01 06:35:00] [INFO ] Flatten gal took : 45 ms
[2024-06-01 06:35:00] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 386 transition count 1128
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 386 transition count 1128
Applied a total of 12 rules in 20 ms. Remains 386 /392 variables (removed 6) and now considering 1128/1164 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 386/392 places, 1128/1164 transitions.
[2024-06-01 06:35:00] [INFO ] Flatten gal took : 39 ms
[2024-06-01 06:35:00] [INFO ] Flatten gal took : 42 ms
[2024-06-01 06:35:01] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 385 transition count 1122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 385 transition count 1122
Applied a total of 14 rules in 18 ms. Remains 385 /392 variables (removed 7) and now considering 1122/1164 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 385/392 places, 1122/1164 transitions.
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 48 ms
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 37 ms
[2024-06-01 06:35:01] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 392 transition count 1158
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 386 transition count 1158
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 386 transition count 1045
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 273 transition count 1045
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 246 place count 265 transition count 997
Iterating global reduction 2 with 8 rules applied. Total rules applied 254 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 314 place count 235 transition count 967
Applied a total of 314 rules in 88 ms. Remains 235 /392 variables (removed 157) and now considering 967/1164 (removed 197) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 90 ms. Remains : 235/392 places, 967/1164 transitions.
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 30 ms
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 34 ms
[2024-06-01 06:35:01] [INFO ] Input system was already deterministic with 967 transitions.
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 439 steps, run visited all 1 properties in 7 ms. (steps per millisecond=62 )
Probabilistic random walk after 439 steps, saw 369 distinct states, run finished after 12 ms. (steps per millisecond=36 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 392 transition count 1158
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 386 transition count 1158
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 12 place count 386 transition count 1048
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 232 place count 276 transition count 1048
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 239 place count 269 transition count 1006
Iterating global reduction 2 with 7 rules applied. Total rules applied 246 place count 269 transition count 1006
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 302 place count 241 transition count 978
Applied a total of 302 rules in 89 ms. Remains 241 /392 variables (removed 151) and now considering 978/1164 (removed 186) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 90 ms. Remains : 241/392 places, 978/1164 transitions.
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 29 ms
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 33 ms
[2024-06-01 06:35:01] [INFO ] Input system was already deterministic with 978 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 384 transition count 1116
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 384 transition count 1116
Applied a total of 16 rules in 15 ms. Remains 384 /392 variables (removed 8) and now considering 1116/1164 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 384/392 places, 1116/1164 transitions.
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 34 ms
[2024-06-01 06:35:01] [INFO ] Flatten gal took : 39 ms
[2024-06-01 06:35:02] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 386 transition count 1128
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 386 transition count 1128
Applied a total of 12 rules in 16 ms. Remains 386 /392 variables (removed 6) and now considering 1128/1164 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 386/392 places, 1128/1164 transitions.
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 36 ms
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 38 ms
[2024-06-01 06:35:02] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 385 transition count 1122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 385 transition count 1122
Applied a total of 14 rules in 15 ms. Remains 385 /392 variables (removed 7) and now considering 1122/1164 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 385/392 places, 1122/1164 transitions.
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 32 ms
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 37 ms
[2024-06-01 06:35:02] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 392 transition count 1158
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 386 transition count 1158
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 386 transition count 1044
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 272 transition count 1044
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 264 transition count 996
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 316 place count 234 transition count 966
Applied a total of 316 rules in 66 ms. Remains 234 /392 variables (removed 158) and now considering 966/1164 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 234/392 places, 966/1164 transitions.
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 33 ms
[2024-06-01 06:35:02] [INFO ] Input system was already deterministic with 966 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 385 transition count 1122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 385 transition count 1122
Applied a total of 14 rules in 11 ms. Remains 385 /392 variables (removed 7) and now considering 1122/1164 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 385/392 places, 1122/1164 transitions.
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 32 ms
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 37 ms
[2024-06-01 06:35:02] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 385 transition count 1122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 385 transition count 1122
Applied a total of 14 rules in 12 ms. Remains 385 /392 variables (removed 7) and now considering 1122/1164 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 385/392 places, 1122/1164 transitions.
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:35:02] [INFO ] Flatten gal took : 36 ms
[2024-06-01 06:35:03] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 1164/1164 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 384 transition count 1116
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 384 transition count 1116
Applied a total of 16 rules in 11 ms. Remains 384 /392 variables (removed 8) and now considering 1116/1164 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 384/392 places, 1116/1164 transitions.
[2024-06-01 06:35:03] [INFO ] Flatten gal took : 32 ms
[2024-06-01 06:35:03] [INFO ] Flatten gal took : 35 ms
[2024-06-01 06:35:03] [INFO ] Input system was already deterministic with 1116 transitions.
[2024-06-01 06:35:03] [INFO ] Flatten gal took : 35 ms
[2024-06-01 06:35:03] [INFO ] Flatten gal took : 36 ms
[2024-06-01 06:35:03] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 06:35:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 392 places, 1164 transitions and 5448 arcs took 9 ms.
Total runtime 159863 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-06-CTLCardinality-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-01
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2024-11
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLCardinality-2023-15

BK_STOP 1717223703870

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1203/ctl_0_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1203/ctl_1_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1203/ctl_2_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1203/ctl_3_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1203/ctl_4_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1203/ctl_5_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1203/ctl_6_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1203/ctl_7_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1203/ctl_8_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1203/ctl_9_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1203/ctl_10_
ctl formula name EisenbergMcGuire-PT-06-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1203/ctl_11_
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-06"
export BK_EXAMINATION="CTLCardinality"
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-06, examination is CTLCardinality"
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-171636266300169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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