About the Execution of LTSMin+red for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2305.363 | 318142.00 | 435331.00 | 685.00 | FT?FF?FT??T????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407300281.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Peterson-PT-6, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300281
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 150K Apr 12 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 608K Apr 12 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 12 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 633K Apr 12 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 294K Apr 12 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 432K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 877K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-00
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-01
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-02
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-03
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-04
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-05
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-06
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-07
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-08
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-09
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-10
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-11
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-12
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-13
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-14
FORMULA_NAME Peterson-PT-6-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717273883792
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:31:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:31:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:31:26] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-06-01 20:31:26] [INFO ] Transformed 1330 places.
[2024-06-01 20:31:26] [INFO ] Transformed 2030 transitions.
[2024-06-01 20:31:26] [INFO ] Found NUPN structural information;
[2024-06-01 20:31:26] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 643 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 60 ms.
Support contains 1276 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 78 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:31:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:31:27] [INFO ] Computed 27 invariants in 48 ms
[2024-06-01 20:31:28] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2024-06-01 20:31:28] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:31:28] [INFO ] Invariant cache hit.
[2024-06-01 20:31:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:31:31] [INFO ] Implicit Places using invariants and state equation in 3195 ms returned []
Implicit Place search using SMT with State Equation took 4779 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:31:32] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:31:32] [INFO ] Invariant cache hit.
[2024-06-01 20:31:32] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31295ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31367ms
Finished structural reductions in LTL mode , in 1 iterations and 36283 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1276 out of 1330 places after structural reductions.
[2024-06-01 20:32:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 20:32:04] [INFO ] Flatten gal took : 279 ms
FORMULA Peterson-PT-6-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:32:04] [INFO ] Flatten gal took : 158 ms
[2024-06-01 20:32:04] [INFO ] Input system was already deterministic with 2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 5082 ms. (7 steps per ms) remains 45/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 41/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 254 ms. (15 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 40/40 properties
[2024-06-01 20:32:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:32:07] [INFO ] Invariant cache hit.
[2024-06-01 20:32:07] [INFO ] State equation strengthened by 330 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1276/1276 constraints. Problems are: Problem set: 10 solved, 30 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 7/1283 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1276 variables, 0/1283 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 19/1295 variables, 9/1292 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1295 variables, 19/1311 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1295 variables, 0/1311 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 7/1302 variables, 7/1318 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1302 variables, 7/1325 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1302 variables, 0/1325 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1820/3122 variables, 1302/2627 constraints. Problems are: Problem set: 24 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3122/3150 variables, and 2957 constraints, problems are : Problem set: 24 solved, 16 unsolved in 5014 ms.
Refiners :[Domain max(s): 1302/1330 constraints, Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1302/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1225/1290 variables, 11/76 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1290 variables, 1225/1301 constraints. Problems are: Problem set: 24 solved, 16 unsolved
[2024-06-01 20:32:17] [INFO ] Deduced a trap composed of 223 places in 1246 ms of which 143 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 1/1302 constraints. Problems are: Problem set: 24 solved, 16 unsolved
[2024-06-01 20:32:18] [INFO ] Deduced a trap composed of 132 places in 735 ms of which 12 ms to minimize.
[2024-06-01 20:32:18] [INFO ] Deduced a trap composed of 163 places in 701 ms of which 11 ms to minimize.
SMT process timed out in 11563ms, After SMT, problems are : Problem set: 24 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 1330 transition count 1478
Reduce places removed 552 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 566 rules applied. Total rules applied 1118 place count 778 transition count 1464
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1132 place count 764 transition count 1464
Performed 246 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 246 Pre rules applied. Total rules applied 1132 place count 764 transition count 1218
Deduced a syphon composed of 246 places in 2 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 3 with 492 rules applied. Total rules applied 1624 place count 518 transition count 1218
Applied a total of 1624 rules in 344 ms. Remains 518 /1330 variables (removed 812) and now considering 1218/2030 (removed 812) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 518/1330 places, 1218/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 1065 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 297752 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 16
Probabilistic random walk after 297752 steps, saw 46944 distinct states, run finished after 3006 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-01 20:32:22] [INFO ] Flow matrix only has 1008 transitions (discarded 210 similar events)
// Phase 1: matrix 1008 rows 518 cols
[2024-06-01 20:32:22] [INFO ] Computed 27 invariants in 8 ms
[2024-06-01 20:32:22] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 417/482 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 417/497 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 7/490 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 7/513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 1008/1498 variables, 490/1003 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1498 variables, 330/1333 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:24] [INFO ] Deduced a trap composed of 58 places in 324 ms of which 8 ms to minimize.
[2024-06-01 20:32:25] [INFO ] Deduced a trap composed of 96 places in 566 ms of which 7 ms to minimize.
[2024-06-01 20:32:26] [INFO ] Deduced a trap composed of 102 places in 429 ms of which 5 ms to minimize.
[2024-06-01 20:32:26] [INFO ] Deduced a trap composed of 52 places in 329 ms of which 4 ms to minimize.
[2024-06-01 20:32:26] [INFO ] Deduced a trap composed of 52 places in 396 ms of which 6 ms to minimize.
[2024-06-01 20:32:27] [INFO ] Deduced a trap composed of 51 places in 415 ms of which 6 ms to minimize.
[2024-06-01 20:32:27] [INFO ] Deduced a trap composed of 55 places in 456 ms of which 6 ms to minimize.
[2024-06-01 20:32:28] [INFO ] Deduced a trap composed of 89 places in 458 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 8/1341 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 28/1526 variables, 28/1369 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1526 variables, 28/1397 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1526 variables, 4/1401 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1526 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 0/1526 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1526/1526 variables, and 1401 constraints, problems are : Problem set: 0 solved, 16 unsolved in 8247 ms.
Refiners :[Domain max(s): 518/518 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 518/518 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 417/482 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 417/497 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 5/502 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:31] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 4 ms to minimize.
[2024-06-01 20:32:32] [INFO ] Deduced a trap composed of 64 places in 363 ms of which 8 ms to minimize.
[2024-06-01 20:32:32] [INFO ] Deduced a trap composed of 90 places in 343 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:33] [INFO ] Deduced a trap composed of 60 places in 262 ms of which 3 ms to minimize.
[2024-06-01 20:32:33] [INFO ] Deduced a trap composed of 96 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:32:33] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:34] [INFO ] Deduced a trap composed of 62 places in 424 ms of which 5 ms to minimize.
[2024-06-01 20:32:34] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:32:35] [INFO ] Deduced a trap composed of 55 places in 439 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:35] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 5 ms to minimize.
[2024-06-01 20:32:36] [INFO ] Deduced a trap composed of 56 places in 502 ms of which 6 ms to minimize.
[2024-06-01 20:32:37] [INFO ] Deduced a trap composed of 51 places in 463 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:37] [INFO ] Deduced a trap composed of 54 places in 368 ms of which 4 ms to minimize.
[2024-06-01 20:32:38] [INFO ] Deduced a trap composed of 97 places in 501 ms of which 6 ms to minimize.
[2024-06-01 20:32:38] [INFO ] Deduced a trap composed of 64 places in 504 ms of which 7 ms to minimize.
[2024-06-01 20:32:39] [INFO ] Deduced a trap composed of 62 places in 551 ms of which 7 ms to minimize.
[2024-06-01 20:32:40] [INFO ] Deduced a trap composed of 71 places in 544 ms of which 6 ms to minimize.
[2024-06-01 20:32:40] [INFO ] Deduced a trap composed of 52 places in 564 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:41] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 5 ms to minimize.
[2024-06-01 20:32:41] [INFO ] Deduced a trap composed of 52 places in 370 ms of which 5 ms to minimize.
[2024-06-01 20:32:42] [INFO ] Deduced a trap composed of 52 places in 307 ms of which 4 ms to minimize.
[2024-06-01 20:32:42] [INFO ] Deduced a trap composed of 70 places in 324 ms of which 5 ms to minimize.
[2024-06-01 20:32:42] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 5 ms to minimize.
[2024-06-01 20:32:43] [INFO ] Deduced a trap composed of 48 places in 395 ms of which 13 ms to minimize.
[2024-06-01 20:32:43] [INFO ] Deduced a trap composed of 48 places in 406 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:44] [INFO ] Deduced a trap composed of 64 places in 317 ms of which 5 ms to minimize.
[2024-06-01 20:32:44] [INFO ] Deduced a trap composed of 60 places in 307 ms of which 5 ms to minimize.
[2024-06-01 20:32:45] [INFO ] Deduced a trap composed of 56 places in 359 ms of which 5 ms to minimize.
[2024-06-01 20:32:45] [INFO ] Deduced a trap composed of 80 places in 509 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:46] [INFO ] Deduced a trap composed of 64 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:32:46] [INFO ] Deduced a trap composed of 66 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:32:47] [INFO ] Deduced a trap composed of 63 places in 313 ms of which 4 ms to minimize.
[2024-06-01 20:32:47] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 5 ms to minimize.
[2024-06-01 20:32:47] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:32:48] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 6/537 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 1/483 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/483 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:49] [INFO ] Deduced a trap composed of 65 places in 355 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/483 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:50] [INFO ] Deduced a trap composed of 77 places in 268 ms of which 3 ms to minimize.
[2024-06-01 20:32:50] [INFO ] Deduced a trap composed of 95 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:32:51] [INFO ] Deduced a trap composed of 52 places in 416 ms of which 5 ms to minimize.
[2024-06-01 20:32:51] [INFO ] Deduced a trap composed of 138 places in 328 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/483 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/483 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 7/490 variables, 7/551 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 7/558 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 20:32:52] [INFO ] Deduced a trap composed of 59 places in 352 ms of which 5 ms to minimize.
[2024-06-01 20:32:53] [INFO ] Deduced a trap composed of 55 places in 491 ms of which 6 ms to minimize.
[2024-06-01 20:32:53] [INFO ] Deduced a trap composed of 80 places in 356 ms of which 5 ms to minimize.
[2024-06-01 20:32:54] [INFO ] Deduced a trap composed of 52 places in 368 ms of which 5 ms to minimize.
[2024-06-01 20:32:54] [INFO ] Deduced a trap composed of 80 places in 368 ms of which 6 ms to minimize.
[2024-06-01 20:32:55] [INFO ] Deduced a trap composed of 73 places in 370 ms of which 20 ms to minimize.
[2024-06-01 20:32:55] [INFO ] Deduced a trap composed of 72 places in 361 ms of which 6 ms to minimize.
Problem AtomicPropp53 is UNSAT
[2024-06-01 20:32:55] [INFO ] Deduced a trap composed of 67 places in 358 ms of which 6 ms to minimize.
[2024-06-01 20:32:56] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 3 ms to minimize.
[2024-06-01 20:32:56] [INFO ] Deduced a trap composed of 68 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:32:56] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/490 variables, 11/572 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 20:32:57] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:32:57] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 4 ms to minimize.
[2024-06-01 20:32:57] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/490 variables, 3/575 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 20:32:58] [INFO ] Deduced a trap composed of 135 places in 337 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/490 variables, 1/576 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 20:32:59] [INFO ] Deduced a trap composed of 74 places in 379 ms of which 5 ms to minimize.
[2024-06-01 20:32:59] [INFO ] Deduced a trap composed of 55 places in 375 ms of which 5 ms to minimize.
[2024-06-01 20:33:00] [INFO ] Deduced a trap composed of 52 places in 392 ms of which 5 ms to minimize.
[2024-06-01 20:33:00] [INFO ] Deduced a trap composed of 44 places in 373 ms of which 5 ms to minimize.
[2024-06-01 20:33:00] [INFO ] Deduced a trap composed of 54 places in 350 ms of which 5 ms to minimize.
[2024-06-01 20:33:01] [INFO ] Deduced a trap composed of 52 places in 396 ms of which 5 ms to minimize.
[2024-06-01 20:33:01] [INFO ] Deduced a trap composed of 54 places in 377 ms of which 5 ms to minimize.
[2024-06-01 20:33:01] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:33:02] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 4 ms to minimize.
[2024-06-01 20:33:02] [INFO ] Deduced a trap composed of 98 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:33:03] [INFO ] Deduced a trap composed of 63 places in 449 ms of which 6 ms to minimize.
[2024-06-01 20:33:03] [INFO ] Deduced a trap composed of 58 places in 555 ms of which 7 ms to minimize.
[2024-06-01 20:33:04] [INFO ] Deduced a trap composed of 89 places in 560 ms of which 6 ms to minimize.
[2024-06-01 20:33:05] [INFO ] Deduced a trap composed of 84 places in 508 ms of which 6 ms to minimize.
[2024-06-01 20:33:05] [INFO ] Deduced a trap composed of 56 places in 427 ms of which 6 ms to minimize.
[2024-06-01 20:33:05] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:33:06] [INFO ] Deduced a trap composed of 68 places in 344 ms of which 5 ms to minimize.
[2024-06-01 20:33:06] [INFO ] Deduced a trap composed of 100 places in 331 ms of which 4 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/490 variables, 18/594 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/490 variables, 0/594 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 1008/1498 variables, 490/1084 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1498 variables, 330/1414 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1498 variables, 13/1427 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 20:33:10] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 6 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1498 variables, 1/1428 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1498 variables, 0/1428 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 32 (OVERLAPS) 28/1526 variables, 28/1456 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1526 variables, 28/1484 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1526 variables, 4/1488 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1526 variables, 2/1490 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 20:33:14] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 5 ms to minimize.
[2024-06-01 20:33:15] [INFO ] Deduced a trap composed of 11 places in 444 ms of which 8 ms to minimize.
[2024-06-01 20:33:16] [INFO ] Deduced a trap composed of 12 places in 603 ms of which 7 ms to minimize.
[2024-06-01 20:33:16] [INFO ] Deduced a trap composed of 11 places in 636 ms of which 7 ms to minimize.
SMT process timed out in 53934ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 6 properties in 11971 ms.
Support contains 51 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1218/1218 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 518 transition count 1211
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 511 transition count 1211
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 511 transition count 1200
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 500 transition count 1200
Applied a total of 36 rules in 70 ms. Remains 500 /518 variables (removed 18) and now considering 1200/1218 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 500/518 places, 1200/1218 transitions.
RANDOM walk for 40000 steps (8 resets) in 414 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 401544 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 9
Probabilistic random walk after 401544 steps, saw 55769 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-06-01 20:33:32] [INFO ] Flow matrix only has 990 transitions (discarded 210 similar events)
// Phase 1: matrix 990 rows 500 cols
[2024-06-01 20:33:32] [INFO ] Computed 27 invariants in 8 ms
[2024-06-01 20:33:32] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 406/457 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 406/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 7/465 variables, 7/480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 990/1455 variables, 465/952 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1455 variables, 330/1282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1455 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 35/1490 variables, 35/1317 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1490 variables, 35/1352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1490 variables, 5/1357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1490 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/1490 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 1357 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2871 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 500/500 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 406/457 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 406/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:33:35] [INFO ] Deduced a trap composed of 67 places in 291 ms of which 4 ms to minimize.
[2024-06-01 20:33:36] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 5 ms to minimize.
[2024-06-01 20:33:36] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 4 ms to minimize.
[2024-06-01 20:33:36] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:33:37] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:33:37] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:33:37] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 7/478 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:33:37] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 5 ms to minimize.
[2024-06-01 20:33:38] [INFO ] Deduced a trap composed of 62 places in 394 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/458 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 7/465 variables, 7/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 7/496 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:33:39] [INFO ] Deduced a trap composed of 87 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:33:39] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 3 ms to minimize.
[2024-06-01 20:33:39] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 990/1455 variables, 465/964 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1455 variables, 330/1294 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1455 variables, 7/1301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:33:41] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:33:42] [INFO ] Deduced a trap composed of 90 places in 259 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1455 variables, 2/1303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:33:42] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:33:43] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 4 ms to minimize.
[2024-06-01 20:33:43] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1455 variables, 3/1306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:33:44] [INFO ] Deduced a trap composed of 62 places in 313 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1455 variables, 1/1307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1455 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 35/1490 variables, 35/1342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 35/1377 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1490 variables, 5/1382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1490 variables, 2/1384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:33:47] [INFO ] Deduced a trap composed of 109 places in 519 ms of which 7 ms to minimize.
[2024-06-01 20:33:47] [INFO ] Deduced a trap composed of 13 places in 578 ms of which 7 ms to minimize.
[2024-06-01 20:33:48] [INFO ] Deduced a trap composed of 10 places in 602 ms of which 7 ms to minimize.
[2024-06-01 20:33:49] [INFO ] Deduced a trap composed of 20 places in 555 ms of which 7 ms to minimize.
[2024-06-01 20:33:49] [INFO ] Deduced a trap composed of 23 places in 604 ms of which 7 ms to minimize.
[2024-06-01 20:33:50] [INFO ] Deduced a trap composed of 106 places in 588 ms of which 7 ms to minimize.
[2024-06-01 20:33:51] [INFO ] Deduced a trap composed of 35 places in 476 ms of which 7 ms to minimize.
[2024-06-01 20:33:51] [INFO ] Deduced a trap composed of 12 places in 620 ms of which 7 ms to minimize.
[2024-06-01 20:33:52] [INFO ] Deduced a trap composed of 33 places in 599 ms of which 7 ms to minimize.
[2024-06-01 20:33:53] [INFO ] Deduced a trap composed of 13 places in 485 ms of which 7 ms to minimize.
[2024-06-01 20:33:53] [INFO ] Deduced a trap composed of 13 places in 659 ms of which 7 ms to minimize.
[2024-06-01 20:33:54] [INFO ] Deduced a trap composed of 31 places in 621 ms of which 7 ms to minimize.
[2024-06-01 20:33:55] [INFO ] Deduced a trap composed of 126 places in 497 ms of which 6 ms to minimize.
[2024-06-01 20:33:55] [INFO ] Deduced a trap composed of 130 places in 491 ms of which 7 ms to minimize.
[2024-06-01 20:33:56] [INFO ] Deduced a trap composed of 33 places in 496 ms of which 7 ms to minimize.
[2024-06-01 20:33:56] [INFO ] Deduced a trap composed of 33 places in 532 ms of which 8 ms to minimize.
[2024-06-01 20:33:57] [INFO ] Deduced a trap composed of 10 places in 521 ms of which 7 ms to minimize.
[2024-06-01 20:33:58] [INFO ] Deduced a trap composed of 10 places in 459 ms of which 6 ms to minimize.
Problem AtomicPropp17 is UNSAT
[2024-06-01 20:33:58] [INFO ] Deduced a trap composed of 21 places in 622 ms of which 7 ms to minimize.
[2024-06-01 20:33:59] [INFO ] Deduced a trap composed of 63 places in 517 ms of which 8 ms to minimize.
Problem AtomicPropp17 is UNSAT
At refinement iteration 25 (INCLUDED_ONLY) 0/1490 variables, 20/1404 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 20:34:00] [INFO ] Deduced a trap composed of 22 places in 476 ms of which 7 ms to minimize.
[2024-06-01 20:34:01] [INFO ] Deduced a trap composed of 14 places in 531 ms of which 8 ms to minimize.
[2024-06-01 20:34:02] [INFO ] Deduced a trap composed of 66 places in 534 ms of which 7 ms to minimize.
[2024-06-01 20:34:02] [INFO ] Deduced a trap composed of 69 places in 546 ms of which 6 ms to minimize.
[2024-06-01 20:34:03] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 5 ms to minimize.
[2024-06-01 20:34:03] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 5 ms to minimize.
[2024-06-01 20:34:03] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 3 ms to minimize.
[2024-06-01 20:34:04] [INFO ] Deduced a trap composed of 53 places in 439 ms of which 6 ms to minimize.
[2024-06-01 20:34:05] [INFO ] Deduced a trap composed of 56 places in 456 ms of which 6 ms to minimize.
[2024-06-01 20:34:05] [INFO ] Deduced a trap composed of 44 places in 412 ms of which 6 ms to minimize.
[2024-06-01 20:34:05] [INFO ] Deduced a trap composed of 99 places in 434 ms of which 5 ms to minimize.
[2024-06-01 20:34:06] [INFO ] Deduced a trap composed of 70 places in 453 ms of which 6 ms to minimize.
[2024-06-01 20:34:06] [INFO ] Deduced a trap composed of 48 places in 381 ms of which 6 ms to minimize.
[2024-06-01 20:34:07] [INFO ] Deduced a trap composed of 73 places in 499 ms of which 7 ms to minimize.
[2024-06-01 20:34:08] [INFO ] Deduced a trap composed of 35 places in 504 ms of which 6 ms to minimize.
[2024-06-01 20:34:08] [INFO ] Deduced a trap composed of 64 places in 490 ms of which 7 ms to minimize.
[2024-06-01 20:34:09] [INFO ] Deduced a trap composed of 115 places in 492 ms of which 6 ms to minimize.
[2024-06-01 20:34:09] [INFO ] Deduced a trap composed of 81 places in 484 ms of which 7 ms to minimize.
[2024-06-01 20:34:10] [INFO ] Deduced a trap composed of 37 places in 491 ms of which 6 ms to minimize.
[2024-06-01 20:34:10] [INFO ] Deduced a trap composed of 74 places in 487 ms of which 7 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1490 variables, 20/1424 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 20:34:12] [INFO ] Deduced a trap composed of 45 places in 486 ms of which 6 ms to minimize.
[2024-06-01 20:34:12] [INFO ] Deduced a trap composed of 27 places in 482 ms of which 6 ms to minimize.
[2024-06-01 20:34:13] [INFO ] Deduced a trap composed of 34 places in 509 ms of which 7 ms to minimize.
[2024-06-01 20:34:13] [INFO ] Deduced a trap composed of 44 places in 407 ms of which 6 ms to minimize.
[2024-06-01 20:34:14] [INFO ] Deduced a trap composed of 11 places in 599 ms of which 7 ms to minimize.
[2024-06-01 20:34:15] [INFO ] Deduced a trap composed of 32 places in 497 ms of which 9 ms to minimize.
[2024-06-01 20:34:15] [INFO ] Deduced a trap composed of 82 places in 376 ms of which 14 ms to minimize.
[2024-06-01 20:34:16] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 5 ms to minimize.
[2024-06-01 20:34:16] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 5 ms to minimize.
[2024-06-01 20:34:17] [INFO ] Deduced a trap composed of 79 places in 359 ms of which 5 ms to minimize.
[2024-06-01 20:34:17] [INFO ] Deduced a trap composed of 75 places in 362 ms of which 5 ms to minimize.
[2024-06-01 20:34:17] [INFO ] Deduced a trap composed of 54 places in 281 ms of which 5 ms to minimize.
[2024-06-01 20:34:18] [INFO ] Deduced a trap composed of 55 places in 312 ms of which 4 ms to minimize.
[2024-06-01 20:34:18] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:34:19] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 5 ms to minimize.
[2024-06-01 20:34:19] [INFO ] Deduced a trap composed of 44 places in 410 ms of which 6 ms to minimize.
[2024-06-01 20:34:20] [INFO ] Deduced a trap composed of 36 places in 493 ms of which 7 ms to minimize.
[2024-06-01 20:34:20] [INFO ] Deduced a trap composed of 74 places in 475 ms of which 6 ms to minimize.
[2024-06-01 20:34:21] [INFO ] Deduced a trap composed of 55 places in 468 ms of which 6 ms to minimize.
[2024-06-01 20:34:22] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 6 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1490 variables, 20/1444 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 20:34:23] [INFO ] Deduced a trap composed of 37 places in 395 ms of which 6 ms to minimize.
[2024-06-01 20:34:24] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 6 ms to minimize.
[2024-06-01 20:34:24] [INFO ] Deduced a trap composed of 22 places in 402 ms of which 6 ms to minimize.
[2024-06-01 20:34:25] [INFO ] Deduced a trap composed of 34 places in 463 ms of which 6 ms to minimize.
[2024-06-01 20:34:26] [INFO ] Deduced a trap composed of 21 places in 430 ms of which 6 ms to minimize.
[2024-06-01 20:34:27] [INFO ] Deduced a trap composed of 74 places in 561 ms of which 7 ms to minimize.
[2024-06-01 20:34:27] [INFO ] Deduced a trap composed of 10 places in 533 ms of which 6 ms to minimize.
[2024-06-01 20:34:28] [INFO ] Deduced a trap composed of 32 places in 536 ms of which 6 ms to minimize.
[2024-06-01 20:34:29] [INFO ] Deduced a trap composed of 30 places in 428 ms of which 6 ms to minimize.
[2024-06-01 20:34:29] [INFO ] Deduced a trap composed of 34 places in 441 ms of which 6 ms to minimize.
[2024-06-01 20:34:30] [INFO ] Deduced a trap composed of 23 places in 423 ms of which 6 ms to minimize.
[2024-06-01 20:34:30] [INFO ] Deduced a trap composed of 37 places in 457 ms of which 5 ms to minimize.
[2024-06-01 20:34:31] [INFO ] Deduced a trap composed of 57 places in 472 ms of which 6 ms to minimize.
[2024-06-01 20:34:32] [INFO ] Deduced a trap composed of 20 places in 594 ms of which 7 ms to minimize.
[2024-06-01 20:34:33] [INFO ] Deduced a trap composed of 62 places in 419 ms of which 5 ms to minimize.
[2024-06-01 20:34:33] [INFO ] Deduced a trap composed of 88 places in 423 ms of which 5 ms to minimize.
[2024-06-01 20:34:34] [INFO ] Deduced a trap composed of 115 places in 502 ms of which 7 ms to minimize.
[2024-06-01 20:34:35] [INFO ] Deduced a trap composed of 70 places in 448 ms of which 6 ms to minimize.
[2024-06-01 20:34:35] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 6 ms to minimize.
[2024-06-01 20:34:36] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 6 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1490 variables, 20/1464 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 20:34:38] [INFO ] Deduced a trap composed of 58 places in 479 ms of which 7 ms to minimize.
[2024-06-01 20:34:39] [INFO ] Deduced a trap composed of 21 places in 521 ms of which 7 ms to minimize.
[2024-06-01 20:34:40] [INFO ] Deduced a trap composed of 36 places in 543 ms of which 7 ms to minimize.
[2024-06-01 20:34:40] [INFO ] Deduced a trap composed of 36 places in 512 ms of which 6 ms to minimize.
[2024-06-01 20:34:41] [INFO ] Deduced a trap composed of 45 places in 450 ms of which 6 ms to minimize.
[2024-06-01 20:34:41] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 5 ms to minimize.
[2024-06-01 20:34:42] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 5 ms to minimize.
[2024-06-01 20:34:43] [INFO ] Deduced a trap composed of 20 places in 513 ms of which 7 ms to minimize.
[2024-06-01 20:34:44] [INFO ] Deduced a trap composed of 45 places in 434 ms of which 6 ms to minimize.
[2024-06-01 20:34:44] [INFO ] Deduced a trap composed of 60 places in 490 ms of which 6 ms to minimize.
[2024-06-01 20:34:45] [INFO ] Deduced a trap composed of 63 places in 581 ms of which 7 ms to minimize.
[2024-06-01 20:34:46] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 6 ms to minimize.
[2024-06-01 20:34:46] [INFO ] Deduced a trap composed of 10 places in 632 ms of which 7 ms to minimize.
[2024-06-01 20:34:47] [INFO ] Deduced a trap composed of 44 places in 398 ms of which 5 ms to minimize.
[2024-06-01 20:34:47] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 6 ms to minimize.
[2024-06-01 20:34:48] [INFO ] Deduced a trap composed of 45 places in 307 ms of which 6 ms to minimize.
[2024-06-01 20:34:48] [INFO ] Deduced a trap composed of 32 places in 514 ms of which 7 ms to minimize.
[2024-06-01 20:34:49] [INFO ] Deduced a trap composed of 71 places in 406 ms of which 6 ms to minimize.
[2024-06-01 20:34:49] [INFO ] Deduced a trap composed of 95 places in 398 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 1483 constraints, problems are : Problem set: 1 solved, 8 unsolved in 75013 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 500/500 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 117/117 constraints]
After SMT, in 77922ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1200/1200 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 0 place count 500 transition count 1159
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 459 transition count 1159
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 418 transition count 1118
Applied a total of 164 rules in 105 ms. Remains 418 /500 variables (removed 82) and now considering 1118/1200 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 418/500 places, 1118/1200 transitions.
Successfully simplified 26 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-6-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:34:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 20:34:50] [INFO ] Flatten gal took : 128 ms
[2024-06-01 20:34:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Peterson-PT-6-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:34:50] [INFO ] Flatten gal took : 140 ms
[2024-06-01 20:34:50] [INFO ] Input system was already deterministic with 2030 transitions.
Support contains 658 out of 1330 places (down from 746) after GAL structural reductions.
FORMULA Peterson-PT-6-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 25 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-06-01 20:34:51] [INFO ] Flatten gal took : 68 ms
[2024-06-01 20:34:51] [INFO ] Flatten gal took : 66 ms
[2024-06-01 20:34:51] [INFO ] Input system was already deterministic with 2030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 43 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-06-01 20:34:51] [INFO ] Flatten gal took : 57 ms
[2024-06-01 20:34:51] [INFO ] Flatten gal took : 63 ms
[2024-06-01 20:34:51] [INFO ] Input system was already deterministic with 2030 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 578 transitions
Trivial Post-agglo rules discarded 578 transitions
Performed 578 trivial Post agglomeration. Transition count delta: 578
Iterating post reduction 0 with 578 rules applied. Total rules applied 578 place count 1330 transition count 1452
Reduce places removed 578 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 580 rules applied. Total rules applied 1158 place count 752 transition count 1450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1160 place count 750 transition count 1450
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1160 place count 750 transition count 1158
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1744 place count 458 transition count 1158
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1828 place count 416 transition count 1116
Applied a total of 1828 rules in 113 ms. Remains 416 /1330 variables (removed 914) and now considering 1116/2030 (removed 914) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 416/1330 places, 1116/2030 transitions.
[2024-06-01 20:34:51] [INFO ] Flatten gal took : 33 ms
[2024-06-01 20:34:51] [INFO ] Flatten gal took : 39 ms
[2024-06-01 20:34:51] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1330 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 743 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 743 transition count 1149
Deduced a syphon composed of 294 places in 2 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 449 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 407 transition count 1107
Applied a total of 1846 rules in 87 ms. Remains 407 /1330 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 407/1330 places, 1107/2030 transitions.
[2024-06-01 20:34:52] [INFO ] Flatten gal took : 32 ms
[2024-06-01 20:34:52] [INFO ] Flatten gal took : 38 ms
[2024-06-01 20:34:52] [INFO ] Input system was already deterministic with 1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 660464 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 660464 steps, saw 88499 distinct states, run finished after 3007 ms. (steps per millisecond=219 ) properties seen :0
[2024-06-01 20:34:55] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 407 cols
[2024-06-01 20:34:55] [INFO ] Computed 27 invariants in 6 ms
[2024-06-01 20:34:55] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 129/182 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 258/440 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 42/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 432/872 variables, 72/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/872 variables, 72/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/872 variables, 318/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/872 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 228/1100 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1100 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1100 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1106 variables, 6/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1106 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1106 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1112 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1112 variables, 6/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1112 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 192/1304 variables, 240/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1304 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1304 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 1171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 826 ms.
Refiners :[Domain max(s): 407/407 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 407/407 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 129/182 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 258/440 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 42/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 432/872 variables, 72/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/872 variables, 72/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/872 variables, 318/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/872 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 228/1100 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1100 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1100 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1106 variables, 6/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1106 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1106 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1112 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1112 variables, 6/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1112 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:34:57] [INFO ] Deduced a trap composed of 15 places in 453 ms of which 7 ms to minimize.
[2024-06-01 20:34:57] [INFO ] Deduced a trap composed of 49 places in 468 ms of which 6 ms to minimize.
[2024-06-01 20:34:58] [INFO ] Deduced a trap composed of 19 places in 492 ms of which 6 ms to minimize.
[2024-06-01 20:34:58] [INFO ] Deduced a trap composed of 22 places in 506 ms of which 6 ms to minimize.
[2024-06-01 20:34:59] [INFO ] Deduced a trap composed of 12 places in 508 ms of which 6 ms to minimize.
[2024-06-01 20:34:59] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:34:59] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:35:00] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 3 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1112 variables, 8/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1112 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 192/1304 variables, 240/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:00] [INFO ] Deduced a trap composed of 10 places in 441 ms of which 5 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1304 variables, 1/1181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1304 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/1304 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4781 ms.
Refiners :[Domain max(s): 407/407 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 407/407 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 5642ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 1107/1107 transitions.
Applied a total of 0 rules in 36 ms. Remains 407 /407 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 407/407 places, 1107/1107 transitions.
RANDOM walk for 400000 steps (8 resets) in 3816 ms. (104 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 20:35:02] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:35:02] [INFO ] Invariant cache hit.
[2024-06-01 20:35:02] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2024-06-01 20:35:02] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2024-06-01 20:35:02] [INFO ] After 366ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 20:35:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:35:02] [INFO ] After 64ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:35:02] [INFO ] After 151ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:35:02] [INFO ] After 698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:35:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-06-01 20:35:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 20:35:03] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 20:35:03] [INFO ] After 87ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:35:03] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:35:03] [INFO ] After 831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 12034 ms. (332 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3317 ms. (1205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2212528 steps, run timeout after 9001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 2212528 steps, saw 285042 distinct states, run finished after 9001 ms. (steps per millisecond=245 ) properties seen :0
[2024-06-01 20:35:16] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:35:16] [INFO ] Invariant cache hit.
[2024-06-01 20:35:16] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 129/182 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 258/440 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 42/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 432/872 variables, 72/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/872 variables, 72/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/872 variables, 318/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/872 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 228/1100 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1100 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1100 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1106 variables, 6/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1106 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1106 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1112 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1112 variables, 6/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1112 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 192/1304 variables, 240/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1304 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1304 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1304/1304 variables, and 1171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 832 ms.
Refiners :[Domain max(s): 407/407 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 407/407 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 129/182 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 258/440 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 42/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 432/872 variables, 72/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/872 variables, 72/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/872 variables, 318/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/872 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 228/1100 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1100 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1100 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1106 variables, 6/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1106 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1106 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1112 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1112 variables, 6/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1112 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:18] [INFO ] Deduced a trap composed of 13 places in 492 ms of which 7 ms to minimize.
[2024-06-01 20:35:18] [INFO ] Deduced a trap composed of 12 places in 485 ms of which 6 ms to minimize.
[2024-06-01 20:35:19] [INFO ] Deduced a trap composed of 19 places in 421 ms of which 5 ms to minimize.
[2024-06-01 20:35:19] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 5 ms to minimize.
[2024-06-01 20:35:20] [INFO ] Deduced a trap composed of 30 places in 437 ms of which 5 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1112 variables, 5/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1112 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 192/1304 variables, 240/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1304 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1304 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3273 ms.
Refiners :[Domain max(s): 407/407 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 407/407 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 4122ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 1107/1107 transitions.
Applied a total of 0 rules in 35 ms. Remains 407 /407 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 407/407 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 1107/1107 transitions.
Applied a total of 0 rules in 34 ms. Remains 407 /407 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 20:35:20] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:35:20] [INFO ] Invariant cache hit.
[2024-06-01 20:35:21] [INFO ] Implicit Places using invariants in 821 ms returned [388, 389, 391, 399, 400, 401, 402]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 825 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/407 places, 1107/1107 transitions.
Applied a total of 0 rules in 30 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 889 ms. Remains : 400/407 places, 1107/1107 transitions.
RANDOM walk for 4000000 steps (8 resets) in 12531 ms. (319 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3291 ms. (1215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3062048 steps, run timeout after 12001 ms. (steps per millisecond=255 ) properties seen :0 out of 1
Probabilistic random walk after 3062048 steps, saw 391837 distinct states, run finished after 12001 ms. (steps per millisecond=255 ) properties seen :0
[2024-06-01 20:35:37] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-06-01 20:35:37] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 20:35:37] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1105 variables, 6/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1297 variables, 234/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 719 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:39] [INFO ] Deduced a trap composed of 10 places in 565 ms of which 7 ms to minimize.
[2024-06-01 20:35:40] [INFO ] Deduced a trap composed of 13 places in 554 ms of which 7 ms to minimize.
[2024-06-01 20:35:40] [INFO ] Deduced a trap composed of 33 places in 490 ms of which 6 ms to minimize.
[2024-06-01 20:35:41] [INFO ] Deduced a trap composed of 12 places in 517 ms of which 6 ms to minimize.
[2024-06-01 20:35:41] [INFO ] Deduced a trap composed of 64 places in 528 ms of which 6 ms to minimize.
[2024-06-01 20:35:42] [INFO ] Deduced a trap composed of 15 places in 497 ms of which 6 ms to minimize.
[2024-06-01 20:35:42] [INFO ] Deduced a trap composed of 11 places in 471 ms of which 6 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 30 places in 473 ms of which 6 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 9/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1099 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1105 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1105 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1297 variables, 234/1160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1297 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1297 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5807 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 6558ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 29 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 28 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 20:35:44] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:35:44] [INFO ] Invariant cache hit.
[2024-06-01 20:35:45] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-06-01 20:35:45] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:35:45] [INFO ] Invariant cache hit.
[2024-06-01 20:35:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:35:47] [INFO ] Implicit Places using invariants and state equation in 2445 ms returned []
Implicit Place search using SMT with State Equation took 3358 ms to find 0 implicit places.
[2024-06-01 20:35:47] [INFO ] Redundant transitions in 85 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 20:35:47] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:35:47] [INFO ] Invariant cache hit.
[2024-06-01 20:35:47] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:36:02] [INFO ] Deduced a trap composed of 10 places in 496 ms of which 6 ms to minimize.
[2024-06-01 20:36:03] [INFO ] Deduced a trap composed of 10 places in 506 ms of which 6 ms to minimize.
[2024-06-01 20:36:03] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 7 ms to minimize.
[2024-06-01 20:36:04] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 5 ms to minimize.
[2024-06-01 20:36:04] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 6 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 41 places in 394 ms of which 5 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 6 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 4 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 6 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 6 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 49 places in 400 ms of which 5 ms to minimize.
[2024-06-01 20:36:07] [INFO ] Deduced a trap composed of 20 places in 321 ms of which 5 ms to minimize.
[2024-06-01 20:36:07] [INFO ] Deduced a trap composed of 21 places in 374 ms of which 5 ms to minimize.
[2024-06-01 20:36:08] [INFO ] Deduced a trap composed of 23 places in 554 ms of which 7 ms to minimize.
[2024-06-01 20:36:08] [INFO ] Deduced a trap composed of 11 places in 525 ms of which 6 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 23 places in 537 ms of which 6 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 10 places in 519 ms of which 7 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 40 places in 467 ms of which 5 ms to minimize.
[2024-06-01 20:36:11] [INFO ] Deduced a trap composed of 39 places in 373 ms of which 5 ms to minimize.
[2024-06-01 20:36:11] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:36:13] [INFO ] Deduced a trap composed of 10 places in 528 ms of which 6 ms to minimize.
[2024-06-01 20:36:13] [INFO ] Deduced a trap composed of 51 places in 526 ms of which 7 ms to minimize.
[2024-06-01 20:36:14] [INFO ] Deduced a trap composed of 21 places in 509 ms of which 6 ms to minimize.
[2024-06-01 20:36:14] [INFO ] Deduced a trap composed of 12 places in 526 ms of which 6 ms to minimize.
[2024-06-01 20:36:15] [INFO ] Deduced a trap composed of 30 places in 483 ms of which 6 ms to minimize.
[2024-06-01 20:36:15] [INFO ] Deduced a trap composed of 37 places in 466 ms of which 6 ms to minimize.
[2024-06-01 20:36:16] [INFO ] Deduced a trap composed of 20 places in 460 ms of which 8 ms to minimize.
[2024-06-01 20:36:16] [INFO ] Deduced a trap composed of 47 places in 468 ms of which 5 ms to minimize.
[2024-06-01 20:36:17] [INFO ] Deduced a trap composed of 45 places in 459 ms of which 6 ms to minimize.
[2024-06-01 20:36:17] [INFO ] Deduced a trap composed of 18 places in 410 ms of which 6 ms to minimize.
[2024-06-01 20:36:18] [INFO ] Deduced a trap composed of 19 places in 473 ms of which 6 ms to minimize.
[2024-06-01 20:36:18] [INFO ] Deduced a trap composed of 18 places in 504 ms of which 6 ms to minimize.
SMT process timed out in 30816ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30830ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34314 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 400000 steps (8 resets) in 1572 ms. (254 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 20:36:19] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:36:19] [INFO ] Invariant cache hit.
[2024-06-01 20:36:19] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2024-06-01 20:36:19] [INFO ] After 411ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 20:36:19] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:36:19] [INFO ] After 66ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:36:19] [INFO ] After 151ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:36:19] [INFO ] After 752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:36:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2024-06-01 20:36:20] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 20:36:20] [INFO ] After 73ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:36:20] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:36:20] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675816 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 675816 steps, saw 90037 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-06-01 20:36:23] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:36:23] [INFO ] Invariant cache hit.
[2024-06-01 20:36:23] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1105 variables, 6/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1297 variables, 234/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 727 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:25] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 4 ms to minimize.
[2024-06-01 20:36:25] [INFO ] Deduced a trap composed of 30 places in 433 ms of which 6 ms to minimize.
[2024-06-01 20:36:26] [INFO ] Deduced a trap composed of 13 places in 457 ms of which 6 ms to minimize.
[2024-06-01 20:36:26] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 6 ms to minimize.
[2024-06-01 20:36:27] [INFO ] Deduced a trap composed of 12 places in 455 ms of which 6 ms to minimize.
[2024-06-01 20:36:27] [INFO ] Deduced a trap composed of 15 places in 431 ms of which 5 ms to minimize.
[2024-06-01 20:36:28] [INFO ] Deduced a trap composed of 10 places in 430 ms of which 5 ms to minimize.
[2024-06-01 20:36:28] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 6 ms to minimize.
[2024-06-01 20:36:28] [INFO ] Deduced a trap composed of 14 places in 460 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 9/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1099 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1105 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:29] [INFO ] Deduced a trap composed of 31 places in 493 ms of which 5 ms to minimize.
SMT process timed out in 5813ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 26 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 662368 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 662368 steps, saw 88694 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
[2024-06-01 20:36:32] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:36:32] [INFO ] Invariant cache hit.
[2024-06-01 20:36:32] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1105 variables, 6/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1297 variables, 234/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 670 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:34] [INFO ] Deduced a trap composed of 30 places in 605 ms of which 6 ms to minimize.
[2024-06-01 20:36:35] [INFO ] Deduced a trap composed of 30 places in 576 ms of which 7 ms to minimize.
[2024-06-01 20:36:35] [INFO ] Deduced a trap composed of 13 places in 543 ms of which 7 ms to minimize.
[2024-06-01 20:36:36] [INFO ] Deduced a trap composed of 46 places in 418 ms of which 4 ms to minimize.
[2024-06-01 20:36:36] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:36:36] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 5 ms to minimize.
[2024-06-01 20:36:37] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 4 ms to minimize.
[2024-06-01 20:36:37] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:36:37] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 9/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1099 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1105 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:38] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 5 ms to minimize.
[2024-06-01 20:36:38] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1105 variables, 2/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1105 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 192/1297 variables, 234/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:39] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6180 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 6866ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 12 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 290 / 400 are part of one of the 42 SCC in 6 ms
Free SCC test removed 248 places
Drop transitions (Empty/Sink Transition effects.) removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 152 transition count 319
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 111 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 108 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 108 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 115 place count 93 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 50 edges and 93 vertex of which 49 / 93 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 117 place count 51 transition count 311
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 268 edges and 45 vertex of which 10 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 180 output transitions
Drop transitions (Output transitions of discarded places.) removed 180 transitions
Graph (trivial) has 67 edges and 10 vertex of which 6 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 2 with 57 rules applied. Total rules applied 174 place count 5 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 249 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 3 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 257 place count 2 transition count 2
Applied a total of 257 rules in 61 ms. Remains 2 /400 variables (removed 398) and now considering 2/1107 (removed 1105) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 20:36:39] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 20:36:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 20:36:39] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:36:39] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-01 20:36:39] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 100 ms.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 71 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-06-01 20:36:39] [INFO ] Flatten gal took : 84 ms
[2024-06-01 20:36:39] [INFO ] Flatten gal took : 89 ms
[2024-06-01 20:36:40] [INFO ] Input system was already deterministic with 2030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 61 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-06-01 20:36:40] [INFO ] Flatten gal took : 73 ms
[2024-06-01 20:36:40] [INFO ] Flatten gal took : 82 ms
[2024-06-01 20:36:40] [INFO ] Input system was already deterministic with 2030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-06-01 20:36:40] [INFO ] Flatten gal took : 52 ms
[2024-06-01 20:36:40] [INFO ] Flatten gal took : 57 ms
[2024-06-01 20:36:40] [INFO ] Input system was already deterministic with 2030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-06-01 20:36:40] [INFO ] Flatten gal took : 51 ms
[2024-06-01 20:36:40] [INFO ] Flatten gal took : 51 ms
[2024-06-01 20:36:40] [INFO ] Input system was already deterministic with 2030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1330/1330 places, 2030/2030 transitions.
[2024-06-01 20:36:41] [INFO ] Flatten gal took : 48 ms
[2024-06-01 20:36:41] [INFO ] Flatten gal took : 54 ms
[2024-06-01 20:36:41] [INFO ] Input system was already deterministic with 2030 transitions.
[2024-06-01 20:36:41] [INFO ] Flatten gal took : 51 ms
[2024-06-01 20:36:41] [INFO ] Flatten gal took : 53 ms
[2024-06-01 20:36:41] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 20:36:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 15 ms.
Total runtime 315305 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-02
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-05
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-08
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-09
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-11
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-12
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-13
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-14
Could not compute solution for formula : Peterson-PT-6-CTLCardinality-2024-15
BK_STOP 1717274201934
--------------------
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 Peterson-PT-6-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1478/ctl_0_
ctl formula name Peterson-PT-6-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1478/ctl_1_
ctl formula name Peterson-PT-6-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1478/ctl_2_
ctl formula name Peterson-PT-6-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1478/ctl_3_
ctl formula name Peterson-PT-6-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1478/ctl_4_
ctl formula name Peterson-PT-6-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1478/ctl_5_
ctl formula name Peterson-PT-6-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1478/ctl_6_
ctl formula name Peterson-PT-6-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1478/ctl_7_
ctl formula name Peterson-PT-6-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1478/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-6"
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 Peterson-PT-6, 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 r512-smll-171654407300281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 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 '
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 ;