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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 110K Apr 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 458K Apr 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 12 02:41 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 47K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 173K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 733K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 289K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 535K 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-5-CTLCardinality-2024-00
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-01
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-02
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-03
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-04
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-05
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-06
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-07
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-08
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-09
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-10
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-11
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-12
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-13
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-14
FORMULA_NAME Peterson-PT-5-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717272233381

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-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:03:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:03:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:03:55] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-06-01 20:03:55] [INFO ] Transformed 834 places.
[2024-06-01 20:03:55] [INFO ] Transformed 1242 transitions.
[2024-06-01 20:03:55] [INFO ] Found NUPN structural information;
[2024-06-01 20:03:55] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 52 ms.
Support contains 795 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 35 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:03:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:03:55] [INFO ] Computed 23 invariants in 32 ms
[2024-06-01 20:03:56] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-06-01 20:03:56] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:03:56] [INFO ] Invariant cache hit.
[2024-06-01 20:03:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:03:58] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-06-01 20:03:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:03:58] [INFO ] Invariant cache hit.
[2024-06-01 20:03:58] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 20:04:19] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 27 ms to minimize.
[2024-06-01 20:04:20] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1956 variables, and 839 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30070 ms.
Refiners :[Domain max(s): 828/834 constraints, Positive P Invariants (semi-flows): 7/17 constraints, Generalized P Invariants (flows): 2/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 20:04:44] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 3 ms to minimize.
[2024-06-01 20:04:46] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 3 ms to minimize.
[2024-06-01 20:04:46] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:04:47] [INFO ] Deduced a trap composed of 126 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:04:48] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 4 ms to minimize.
[2024-06-01 20:04:49] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 7 ms to minimize.
[2024-06-01 20:04:51] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 7/846 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1956 variables, and 846 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30038 ms.
Refiners :[Domain max(s): 828/834 constraints, Positive P Invariants (semi-flows): 7/17 constraints, Generalized P Invariants (flows): 2/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 9/9 constraints]
After SMT, in 60760ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60807ms
Finished structural reductions in LTL mode , in 1 iterations and 63203 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 795 out of 834 places after structural reductions.
[2024-06-01 20:04:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 20:04:59] [INFO ] Flatten gal took : 134 ms
FORMULA Peterson-PT-5-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:04:59] [INFO ] Flatten gal took : 87 ms
[2024-06-01 20:04:59] [INFO ] Input system was already deterministic with 1242 transitions.
Support contains 793 out of 834 places (down from 795) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4338 ms. (9 steps per ms) remains 35/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
[2024-06-01 20:05:01] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:05:01] [INFO ] Invariant cache hit.
[2024-06-01 20:05:01] [INFO ] State equation strengthened by 205 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp21 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/792 variables, 792/792 constraints. Problems are: Problem set: 8 solved, 22 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/792 variables, 6/798 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/798 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/804 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 6/810 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 0/810 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 6/804 variables, 6/816 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 6/822 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 0/822 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1122/1926 variables, 804/1626 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1926 variables, 205/1831 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1926 variables, 0/1831 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 30/1956 variables, 30/1861 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1956 variables, 30/1891 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1956 variables, 5/1896 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1956 variables, 0/1896 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1956 variables, 0/1896 constraints. Problems are: Problem set: 20 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1896 constraints, problems are : Problem set: 20 solved, 10 unsolved in 3996 ms.
Refiners :[Domain max(s): 834/834 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/195 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 599/794 variables, 8/203 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/794 variables, 599/802 constraints. Problems are: Problem set: 20 solved, 10 unsolved
[2024-06-01 20:05:07] [INFO ] Deduced a trap composed of 139 places in 504 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 1/803 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 0/803 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/798 variables, 4/807 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 4/811 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/811 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 6/804 variables, 6/817 constraints. Problems are: Problem set: 20 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/804 variables, 6/823 constraints. Problems are: Problem set: 20 solved, 10 unsolved
[2024-06-01 20:05:08] [INFO ] Deduced a trap composed of 99 places in 692 ms of which 9 ms to minimize.
[2024-06-01 20:05:08] [INFO ] Deduced a trap composed of 119 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:05:09] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:05:09] [INFO ] Deduced a trap composed of 139 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:05:09] [INFO ] Deduced a trap composed of 79 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:05:10] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/804 variables, 6/829 constraints. Problems are: Problem set: 20 solved, 10 unsolved
[2024-06-01 20:05:10] [INFO ] Deduced a trap composed of 179 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:05:10] [INFO ] Deduced a trap composed of 199 places in 178 ms of which 2 ms to minimize.
[2024-06-01 20:05:10] [INFO ] Deduced a trap composed of 119 places in 273 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/804 variables, 3/832 constraints. Problems are: Problem set: 20 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/1956 variables, and 832 constraints, problems are : Problem set: 20 solved, 10 unsolved in 5019 ms.
Refiners :[Domain max(s): 804/834 constraints, Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/30 constraints, Known Traps: 10/10 constraints]
After SMT, in 9536ms problems are : Problem set: 20 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 195 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 834 transition count 1103
Reduce places removed 139 places and 0 transitions.
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Iterating post reduction 1 with 286 rules applied. Total rules applied 425 place count 695 transition count 956
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 2 with 147 rules applied. Total rules applied 572 place count 548 transition count 956
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 572 place count 548 transition count 899
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 686 place count 491 transition count 899
Applied a total of 686 rules in 177 ms. Remains 491 /834 variables (removed 343) and now considering 899/1242 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 491/834 places, 899/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 727 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 395157 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :1 out of 10
Probabilistic random walk after 395157 steps, saw 58859 distinct states, run finished after 3006 ms. (steps per millisecond=131 ) properties seen :1
[2024-06-01 20:05:15] [INFO ] Flow matrix only has 779 transitions (discarded 120 similar events)
// Phase 1: matrix 779 rows 491 cols
[2024-06-01 20:05:15] [INFO ] Computed 23 invariants in 9 ms
[2024-06-01 20:05:15] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 431/449 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 431/455 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6/455 variables, 6/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 6/461 variables, 6/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:15] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:05:15] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 779/1240 variables, 461/942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 205/1147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1240 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 30/1270 variables, 30/1177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1270 variables, 30/1207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1270 variables, 5/1212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1270 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1270 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1270/1270 variables, and 1212 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2079 ms.
Refiners :[Domain max(s): 491/491 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 491/491 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 431/449 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 431/455 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6/455 variables, 6/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 6/461 variables, 6/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:17] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:05:17] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:05:18] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:05:18] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:05:18] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:18] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:05:18] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 779/1240 variables, 461/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1240 variables, 205/1154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1240 variables, 7/1161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1240 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 30/1270 variables, 30/1191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1270 variables, 30/1221 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1270 variables, 5/1226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1270 variables, 2/1228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:20] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 5 ms to minimize.
[2024-06-01 20:05:20] [INFO ] Deduced a trap composed of 46 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 45 places in 291 ms of which 4 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 54 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:05:21] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 3 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 5 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 7 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:05:22] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 4 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
[2024-06-01 20:05:23] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:05:24] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:05:25] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:05:25] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:05:25] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1270 variables, 20/1248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:26] [INFO ] Deduced a trap composed of 19 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:05:26] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:05:26] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1270 variables, 3/1251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:27] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 4 ms to minimize.
[2024-06-01 20:05:27] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1270 variables, 2/1253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:28] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:05:29] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:05:29] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:05:29] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1270 variables, 4/1257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:05:30] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1270 variables, 1/1258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1270 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 0/1270 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1270/1270 variables, and 1258 constraints, problems are : Problem set: 0 solved, 9 unsolved in 14107 ms.
Refiners :[Domain max(s): 491/491 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 491/491 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 39/39 constraints]
After SMT, in 16212ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 3 properties in 6347 ms.
Support contains 10 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 899/899 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 491 transition count 836
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 428 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 427 transition count 835
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 128 place count 427 transition count 713
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 372 place count 305 transition count 713
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 430 place count 276 transition count 684
Applied a total of 430 rules in 82 ms. Remains 276 /491 variables (removed 215) and now considering 684/899 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 276/491 places, 684/899 transitions.
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 552027 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 6
Probabilistic random walk after 552027 steps, saw 81438 distinct states, run finished after 3007 ms. (steps per millisecond=183 ) properties seen :0
[2024-06-01 20:05:41] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2024-06-01 20:05:41] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 20:05:41] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 187/197 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 187/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/202 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/207 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:41] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:05:41] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:05:41] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 472/679 variables, 207/432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/679 variables, 140/572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/679 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 55/734 variables, 30/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/734 variables, 30/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/734 variables, 5/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/734 variables, 5/642 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/734 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 55/789 variables, 10/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/789 variables, 10/662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/789 variables, 60/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/789 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 27/816 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/816 variables, 27/750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/816 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 1/817 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/817 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/817 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 1/818 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/818 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/818 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 22/840 variables, 29/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/840 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 0/840 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 783 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1648 ms.
Refiners :[Domain max(s): 276/276 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 276/276 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 187/197 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 187/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/202 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/207 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:42] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 472/679 variables, 207/433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/679 variables, 140/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/679 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 55/734 variables, 30/606 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/734 variables, 30/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/734 variables, 5/641 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 5/646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/734 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:43] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 3 ms to minimize.
[2024-06-01 20:05:43] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:05:43] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:05:43] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:05:44] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:05:44] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:05:44] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:05:44] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:05:44] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:05:44] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:05:45] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:05:45] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:05:45] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:05:45] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-06-01 20:05:45] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:05:45] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:05:45] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:05:46] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-06-01 20:05:46] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:05:46] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/734 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:46] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:05:46] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:05:46] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:05:46] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:05:47] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:05:47] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:05:47] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:05:47] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:05:47] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:05:47] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:05:47] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:05:48] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:05:48] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:05:48] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:05:48] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:05:48] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:05:48] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:05:48] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:05:49] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:05:49] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/734 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:49] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:05:49] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:05:49] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:05:49] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:05:50] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/734 variables, 5/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:50] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/734 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:50] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/734 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/734 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 55/789 variables, 10/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/789 variables, 10/714 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/789 variables, 60/774 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/789 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 27/816 variables, 1/775 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/816 variables, 27/802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/816 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/817 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/817 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/817 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:51] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:05:51] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:05:51] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:05:52] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:05:52] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:05:52] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:05:52] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:05:52] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:05:52] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:05:53] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:05:53] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-06-01 20:05:53] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:05:53] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:05:53] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/817 variables, 14/819 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:54] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:05:54] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:05:54] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:05:54] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-06-01 20:05:54] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:05:54] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:05:55] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:05:55] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:05:55] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:05:55] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:05:55] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:05:55] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:05:55] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:05:56] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:05:56] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:05:56] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 3 ms to minimize.
[2024-06-01 20:05:56] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:05:56] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:05:56] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:05:57] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 4 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/817 variables, 20/839 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:57] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:05:57] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:05:57] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:05:57] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:05:57] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:05:57] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:05:58] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:05:58] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/817 variables, 8/847 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:58] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-06-01 20:05:58] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:05:58] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:05:59] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/817 variables, 4/851 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:59] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:05:59] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/817 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:05:59] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:05:59] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:06:00] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/817 variables, 3/856 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:00] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/817 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/817 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 1/818 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/818 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/818 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:01] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:06:01] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:06:01] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/818 variables, 3/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:01] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/818 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/818 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (OVERLAPS) 22/840 variables, 29/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/840 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (OVERLAPS) 0/840 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 893 constraints, problems are : Problem set: 0 solved, 6 unsolved in 19939 ms.
Refiners :[Domain max(s): 276/276 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 276/276 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 107/107 constraints]
After SMT, in 21612ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1886 ms.
Support contains 10 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 684/684 transitions.
Applied a total of 0 rules in 22 ms. Remains 276 /276 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 276/276 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 684/684 transitions.
Applied a total of 0 rules in 19 ms. Remains 276 /276 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2024-06-01 20:06:04] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
[2024-06-01 20:06:04] [INFO ] Invariant cache hit.
[2024-06-01 20:06:05] [INFO ] Implicit Places using invariants in 777 ms returned [240, 252, 253, 254, 255, 256]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 781 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/276 places, 684/684 transitions.
Applied a total of 0 rules in 17 ms. Remains 270 /270 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 818 ms. Remains : 270/276 places, 684/684 transitions.
RANDOM walk for 40000 steps (8 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 534226 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 6
Probabilistic random walk after 534226 steps, saw 78857 distinct states, run finished after 3008 ms. (steps per millisecond=177 ) properties seen :0
[2024-06-01 20:06:08] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 270 cols
[2024-06-01 20:06:08] [INFO ] Computed 17 invariants in 8 ms
[2024-06-01 20:06:08] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 187/197 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 187/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:09] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:06:09] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5/202 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 472/674 variables, 202/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 140/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 55/729 variables, 30/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/729 variables, 30/616 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/729 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/729 variables, 5/626 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/729 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 55/784 variables, 10/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/784 variables, 10/646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/784 variables, 60/706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/784 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 27/811 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/811 variables, 27/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/811 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 1/812 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/812 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 22/834 variables, 28/764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/834 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 0/834 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 764 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1340 ms.
Refiners :[Domain max(s): 270/270 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 270/270 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 187/197 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 187/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:10] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:06:10] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 5/202 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 472/674 variables, 202/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 140/558 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 55/729 variables, 30/591 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/729 variables, 30/621 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/729 variables, 5/626 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/729 variables, 5/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/729 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:11] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:06:11] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:06:11] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:06:11] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:06:11] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:06:11] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:06:12] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:06:12] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:06:12] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:06:12] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:06:12] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:06:12] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:06:12] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:06:13] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/729 variables, 14/646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:13] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:06:13] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:06:13] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:06:13] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:06:13] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:06:13] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/729 variables, 6/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/729 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 55/784 variables, 10/662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/784 variables, 10/672 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/784 variables, 60/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/784 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 27/811 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/811 variables, 27/760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:14] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:06:14] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:06:14] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:06:14] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:06:15] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:06:15] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:06:15] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:06:15] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:06:15] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-06-01 20:06:15] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/811 variables, 10/770 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:16] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:06:16] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:06:16] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:06:16] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/811 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:16] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:06:17] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/811 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 20:06:17] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:06:17] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/811 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/811 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 1/812 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/812 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/812 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/812 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 22/834 variables, 28/810 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/834 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 0/834 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 810 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8457 ms.
Refiners :[Domain max(s): 270/270 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 270/270 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 42/42 constraints]
After SMT, in 9823ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 1891 ms.
Support contains 9 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 684/684 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 270 transition count 683
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 683
Applied a total of 2 rules in 21 ms. Remains 269 /270 variables (removed 1) and now considering 683/684 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 269/270 places, 683/684 transitions.
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 554561 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 5
Probabilistic random walk after 554561 steps, saw 81693 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-06-01 20:06:23] [INFO ] Flow matrix only has 563 transitions (discarded 120 similar events)
// Phase 1: matrix 563 rows 269 cols
[2024-06-01 20:06:23] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 20:06:23] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 187/196 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:24] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:06:24] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 20:06:24] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:24] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/201 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 471/672 variables, 201/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/672 variables, 140/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/672 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 55/727 variables, 30/586 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/727 variables, 30/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/727 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/727 variables, 5/626 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/727 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 55/782 variables, 10/636 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/782 variables, 10/646 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/782 variables, 60/706 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/782 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 27/809 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 27/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 1/810 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/810 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 22/832 variables, 28/764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/832 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/832 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 832/832 variables, and 764 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1379 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 269/269 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 187/196 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 5/201 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 471/672 variables, 201/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 140/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/672 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/672 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 55/727 variables, 30/589 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/727 variables, 30/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/727 variables, 5/624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/727 variables, 5/629 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/727 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:25] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:06:25] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:06:26] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:06:27] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:06:27] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/727 variables, 12/642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:27] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:06:27] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:06:27] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:06:27] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:06:27] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:06:28] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/727 variables, 6/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/727 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 55/782 variables, 10/658 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/782 variables, 10/668 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/782 variables, 60/728 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/782 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 27/809 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/809 variables, 27/756 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:28] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:06:28] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 4 ms to minimize.
[2024-06-01 20:06:28] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:06:28] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:06:29] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:06:29] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:06:29] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:06:29] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:06:29] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:06:29] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:06:30] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/809 variables, 11/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:30] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:06:30] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:06:30] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-06-01 20:06:30] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:06:30] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/809 variables, 5/772 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:31] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/809 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:31] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:06:31] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/809 variables, 8/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/809 variables, 3/784 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/809 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/809 variables, 2/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/809 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 1/810 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/810 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/810 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/810 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 22/832 variables, 28/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/832 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 0/832 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 832/832 variables, and 818 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9996 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 269/269 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 53/53 constraints]
After SMT, in 11389ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 2039 ms.
Support contains 7 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 683/683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 268 transition count 682
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 268 transition count 680
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 266 transition count 680
Applied a total of 6 rules in 24 ms. Remains 266 /269 variables (removed 3) and now considering 680/683 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 266/269 places, 680/683 transitions.
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 558740 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 4
Probabilistic random walk after 558740 steps, saw 82262 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-06-01 20:06:40] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2024-06-01 20:06:40] [INFO ] Computed 17 invariants in 11 ms
[2024-06-01 20:06:40] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 149/156 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:40] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:06:40] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:40] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/160 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 376/536 variables, 160/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 90/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 80/616 variables, 30/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 30/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/616 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 5/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/616 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 110/726 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/726 variables, 20/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 110/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/726 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 54/780 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/780 variables, 54/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/780 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/782 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/782 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/782 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 44/826 variables, 56/757 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/826 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/826 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 757 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1047 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 149/156 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/160 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 376/536 variables, 160/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 90/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/536 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 80/616 variables, 30/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/616 variables, 30/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/616 variables, 5/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/616 variables, 13/508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/616 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/616 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/616 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 110/726 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/726 variables, 20/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/726 variables, 110/664 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/726 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/726 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 54/780 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/780 variables, 54/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/780 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/780 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/780 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 2/782 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/782 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/782 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/782 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 44/826 variables, 56/786 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/826 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 0/826 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 826/826 variables, and 786 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4251 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 28/28 constraints]
After SMT, in 5323ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 914 ms.
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 27 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 266/266 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-06-01 20:06:46] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:06:46] [INFO ] Invariant cache hit.
[2024-06-01 20:06:47] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-01 20:06:47] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:06:47] [INFO ] Invariant cache hit.
[2024-06-01 20:06:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:06:47] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2024-06-01 20:06:48] [INFO ] Redundant transitions in 44 ms returned []
Running 674 sub problems to find dead transitions.
[2024-06-01 20:06:48] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:06:48] [INFO ] Invariant cache hit.
[2024-06-01 20:06:48] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 2 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 2 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 2 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:06:56] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:06:56] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-06-01 20:06:56] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:06:59] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 3 ms to minimize.
[2024-06-01 20:06:59] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:07:03] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:07:03] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:07:06] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:07:06] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:07:06] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:07:10] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:07:14] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/826 variables, and 383 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30021 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/266 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 100/383 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 6 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:07:24] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:07:29] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:07:29] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-06-01 20:07:29] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:07:32] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:07:32] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:07:32] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:07:41] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:07:42] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:07:42] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:07:42] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:07:42] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:07:43] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:07:43] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:07:43] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:07:43] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:07:43] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:07:44] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:07:44] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:07:44] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:07:44] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:07:45] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:07:45] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:07:45] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:07:45] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:07:45] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:07:46] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/826 variables, and 463 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30029 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/266 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/674 constraints, Known Traps: 180/180 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61607 ms. Remains : 266/266 places, 680/680 transitions.
Successfully simplified 20 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-5-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:07:48] [INFO ] Flatten gal took : 63 ms
[2024-06-01 20:07:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-5-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:07:48] [INFO ] Flatten gal took : 65 ms
[2024-06-01 20:07:48] [INFO ] Input system was already deterministic with 1242 transitions.
Support contains 758 out of 834 places (down from 763) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 5 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:48] [INFO ] Flatten gal took : 45 ms
[2024-06-01 20:07:48] [INFO ] Flatten gal took : 47 ms
[2024-06-01 20:07:48] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:48] [INFO ] Flatten gal took : 40 ms
[2024-06-01 20:07:48] [INFO ] Flatten gal took : 43 ms
[2024-06-01 20:07:49] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 36 ms
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 37 ms
[2024-06-01 20:07:49] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 34 ms
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 33 ms
[2024-06-01 20:07:49] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 834 transition count 884
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 476 transition count 884
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 716 place count 476 transition count 704
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1136 place count 266 transition count 674
Applied a total of 1136 rules in 62 ms. Remains 266 /834 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 266/834 places, 674/1242 transitions.
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 18 ms
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 21 ms
[2024-06-01 20:07:49] [INFO ] Input system was already deterministic with 674 transitions.
RANDOM walk for 33867 steps (7 resets) in 171 ms. (196 steps per ms) remains 0/1 properties
FORMULA Peterson-PT-5-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 834 transition count 884
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 476 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 177 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 177 Pre rules applied. Total rules applied 718 place count 475 transition count 706
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 1072 place count 298 transition count 706
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1130 place count 269 transition count 677
Applied a total of 1130 rules in 48 ms. Remains 269 /834 variables (removed 565) and now considering 677/1242 (removed 565) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 269/834 places, 677/1242 transitions.
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 18 ms
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 20 ms
[2024-06-01 20:07:49] [INFO ] Input system was already deterministic with 677 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 32 ms
[2024-06-01 20:07:49] [INFO ] Flatten gal took : 35 ms
[2024-06-01 20:07:50] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 31 ms
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 35 ms
[2024-06-01 20:07:50] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 30 ms
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 33 ms
[2024-06-01 20:07:50] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 834/834 places, 1242/1242 transitions.
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 31 ms
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 33 ms
[2024-06-01 20:07:50] [INFO ] Input system was already deterministic with 1242 transitions.
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 32 ms
[2024-06-01 20:07:50] [INFO ] Flatten gal took : 35 ms
[2024-06-01 20:07:50] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 20:07:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 9 ms.
Total runtime 235574 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-00
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-04
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-08
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-09
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-11
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-12
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-13
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-14
Could not compute solution for formula : Peterson-PT-5-CTLCardinality-2024-15

BK_STOP 1717272471169

--------------------
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-5-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/2045/ctl_0_
ctl formula name Peterson-PT-5-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/2045/ctl_1_
ctl formula name Peterson-PT-5-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/2045/ctl_2_
ctl formula name Peterson-PT-5-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/2045/ctl_3_
ctl formula name Peterson-PT-5-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/2045/ctl_4_
ctl formula name Peterson-PT-5-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/2045/ctl_5_
ctl formula name Peterson-PT-5-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/2045/ctl_6_
ctl formula name Peterson-PT-5-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/2045/ctl_7_
ctl formula name Peterson-PT-5-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/2045/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-5"
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-5, 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-171654407300273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;