Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266900362.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PolyORBNT-COL-S05J60, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266900362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 94K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748900769164

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:46:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:46:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:46:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 21:46:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 21:46:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 696 ms
[2025-06-02 21:46:11] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 20 ms.
[2025-06-02 21:46:11] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 61 ms.
[2025-06-02 21:46:11] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2025-06-02 21:46:11] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-02 21:46:11] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-02 21:46:11] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2754 resets) in 2347 ms. (17 steps per ms) remains 1/36 properties
BEST_FIRST walk for 40004 steps (456 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
[2025-06-02 21:46:12] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2025-06-02 21:46:12] [INFO ] Computed 142 invariants in 97 ms
[2025-06-02 21:46:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 449/450 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/574 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/879 variables, 61/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/895 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/907 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:46:13] [INFO ] Deduced a trap composed of 402 places in 447 ms of which 49 ms to minimize.
[2025-06-02 21:46:13] [INFO ] Deduced a trap composed of 312 places in 378 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/907 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/908 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/908 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1311/2219 variables, 908/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2219 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2219 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/2220 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2220 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2220 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 1054 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1992 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 449/450 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/574 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/879 variables, 61/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/895 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/907 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/907 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/908 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/908 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1311/2219 variables, 908/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2219 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2219 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/2220 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2220 variables, 1/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2220 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2220 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 1055 constraints, problems are : Problem set: 0 solved, 1 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 266 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2025-06-02 21:46:15] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2025-06-02 21:46:15] [INFO ] Computed 137 invariants in 39 ms
[2025-06-02 21:46:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2025-06-02 21:46:51] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 5 ms to minimize.
[2025-06-02 21:46:55] [INFO ] Deduced a trap composed of 285 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:46:55] [INFO ] Deduced a trap composed of 188 places in 288 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2025-06-02 21:46:58] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 136 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 4/4 constraints]
After SMT, in 43074ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43095ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43381 ms. Remains : 770/909 places, 1181/1315 transitions.
RANDOM walk for 4000000 steps (208422 resets) in 26569 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (13545 resets) in 7034 ms. (568 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2796845 steps, run timeout after 24001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 2796845 steps, saw 875045 distinct states, run finished after 24021 ms. (steps per millisecond=116 ) properties seen :0
[2025-06-02 21:47:31] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:47:31] [INFO ] Invariant cache hit.
[2025-06-02 21:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1947 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 44 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 57 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2025-06-02 21:47:33] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:47:33] [INFO ] Invariant cache hit.
[2025-06-02 21:47:34] [INFO ] Implicit Places using invariants in 965 ms returned []
[2025-06-02 21:47:34] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:47:34] [INFO ] Invariant cache hit.
[2025-06-02 21:47:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:47:40] [INFO ] Implicit Places using invariants and state equation in 6583 ms returned []
Implicit Place search using SMT with State Equation took 7570 ms to find 0 implicit places.
[2025-06-02 21:47:40] [INFO ] Redundant transitions in 58 ms returned []
Running 1175 sub problems to find dead transitions.
[2025-06-02 21:47:40] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:47:40] [INFO ] Invariant cache hit.
[2025-06-02 21:47:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1947 variables, and 136 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
[2025-06-02 21:48:16] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 78 solved, 1097 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 765/1947 variables, and 133 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 62830ms problems are : Problem set: 78 solved, 1097 unsolved
Search for dead transitions found 78 dead transitions in 62844ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1103/1181 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2025-06-02 21:48:43] [INFO ] Redundant transitions in 37 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70618 ms. Remains : 770/770 places, 1103/1181 transitions.
RANDOM walk for 4000000 steps (208066 resets) in 28380 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (13470 resets) in 7008 ms. (570 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3745908 steps, run timeout after 30001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 3745908 steps, saw 1160789 distinct states, run finished after 30002 ms. (steps per millisecond=124 ) properties seen :0
[2025-06-02 21:49:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2025-06-02 21:49:23] [INFO ] Computed 137 invariants in 28 ms
[2025-06-02 21:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1492ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2025-06-02 21:49:25] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:49:25] [INFO ] Invariant cache hit.
[2025-06-02 21:49:26] [INFO ] Implicit Places using invariants in 941 ms returned []
[2025-06-02 21:49:26] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:49:26] [INFO ] Invariant cache hit.
[2025-06-02 21:49:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:49:33] [INFO ] Implicit Places using invariants and state equation in 7394 ms returned []
Implicit Place search using SMT with State Equation took 8339 ms to find 0 implicit places.
[2025-06-02 21:49:33] [INFO ] Redundant transitions in 17 ms returned []
Running 1097 sub problems to find dead transitions.
[2025-06-02 21:49:33] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:49:33] [INFO ] Invariant cache hit.
[2025-06-02 21:49:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:49:48] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 5 ms to minimize.
[2025-06-02 21:49:48] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 5 ms to minimize.
[2025-06-02 21:49:49] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 4 ms to minimize.
[2025-06-02 21:49:49] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 5 ms to minimize.
[2025-06-02 21:49:49] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 5 ms to minimize.
[2025-06-02 21:49:50] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 5 ms to minimize.
[2025-06-02 21:49:50] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 5 ms to minimize.
[2025-06-02 21:49:50] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:49:51] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2025-06-02 21:49:51] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:49:51] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:49:52] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2025-06-02 21:49:52] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2025-06-02 21:49:52] [INFO ] Deduced a trap composed of 254 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:49:52] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 5 ms to minimize.
[2025-06-02 21:49:53] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2025-06-02 21:49:53] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 5 ms to minimize.
[2025-06-02 21:49:53] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2025-06-02 21:49:54] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2025-06-02 21:49:54] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:49:55] [INFO ] Deduced a trap composed of 254 places in 246 ms of which 4 ms to minimize.
[2025-06-02 21:49:55] [INFO ] Deduced a trap composed of 245 places in 255 ms of which 5 ms to minimize.
[2025-06-02 21:49:55] [INFO ] Deduced a trap composed of 248 places in 257 ms of which 4 ms to minimize.
[2025-06-02 21:49:56] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 5 ms to minimize.
[2025-06-02 21:49:56] [INFO ] Deduced a trap composed of 251 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:49:56] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 5 ms to minimize.
[2025-06-02 21:49:57] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 5 ms to minimize.
[2025-06-02 21:49:57] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 5 ms to minimize.
[2025-06-02 21:49:57] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 5 ms to minimize.
[2025-06-02 21:49:58] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 4 ms to minimize.
[2025-06-02 21:49:58] [INFO ] Deduced a trap composed of 260 places in 251 ms of which 4 ms to minimize.
[2025-06-02 21:49:58] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 5 ms to minimize.
[2025-06-02 21:49:58] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:49:59] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:49:59] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 5 ms to minimize.
[2025-06-02 21:49:59] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:50:00] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 5 ms to minimize.
[2025-06-02 21:50:00] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:50:00] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:50:00] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:50:11] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:50:11] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2025-06-02 21:50:12] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2025-06-02 21:50:12] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 5 ms to minimize.
[2025-06-02 21:50:12] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:50:12] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 4 ms to minimize.
[2025-06-02 21:50:13] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:50:13] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 5 ms to minimize.
[2025-06-02 21:50:13] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 6 ms to minimize.
[2025-06-02 21:50:14] [INFO ] Deduced a trap composed of 200 places in 282 ms of which 7 ms to minimize.
[2025-06-02 21:50:14] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2025-06-02 21:50:14] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 5 ms to minimize.
[2025-06-02 21:50:14] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2025-06-02 21:50:15] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 5 ms to minimize.
[2025-06-02 21:50:15] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:50:15] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:50:16] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 5 ms to minimize.
[2025-06-02 21:50:16] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:50:16] [INFO ] Deduced a trap composed of 200 places in 258 ms of which 5 ms to minimize.
[2025-06-02 21:50:16] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:50:20] [INFO ] Deduced a trap composed of 345 places in 248 ms of which 4 ms to minimize.
[2025-06-02 21:50:20] [INFO ] Deduced a trap composed of 335 places in 253 ms of which 4 ms to minimize.
[2025-06-02 21:50:20] [INFO ] Deduced a trap composed of 246 places in 268 ms of which 5 ms to minimize.
[2025-06-02 21:50:21] [INFO ] Deduced a trap composed of 239 places in 244 ms of which 4 ms to minimize.
[2025-06-02 21:50:21] [INFO ] Deduced a trap composed of 246 places in 249 ms of which 4 ms to minimize.
[2025-06-02 21:50:21] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 4 ms to minimize.
[2025-06-02 21:50:21] [INFO ] Deduced a trap composed of 248 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:50:22] [INFO ] Deduced a trap composed of 258 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:50:22] [INFO ] Deduced a trap composed of 239 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:50:22] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 4 ms to minimize.
[2025-06-02 21:50:23] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:50:23] [INFO ] Deduced a trap composed of 306 places in 262 ms of which 4 ms to minimize.
[2025-06-02 21:50:23] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 8 ms to minimize.
[2025-06-02 21:50:23] [INFO ] Deduced a trap composed of 242 places in 266 ms of which 5 ms to minimize.
[2025-06-02 21:50:24] [INFO ] Deduced a trap composed of 251 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:50:24] [INFO ] Deduced a trap composed of 248 places in 272 ms of which 5 ms to minimize.
[2025-06-02 21:50:24] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:50:25] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:50:25] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 4 ms to minimize.
[2025-06-02 21:50:25] [INFO ] Deduced a trap composed of 251 places in 266 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:50:31] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:50:31] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2025-06-02 21:50:31] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2025-06-02 21:50:32] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2025-06-02 21:50:32] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:50:32] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2025-06-02 21:50:33] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:50:33] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:50:33] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2025-06-02 21:50:33] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:50:34] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:50:34] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:50:34] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62460ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70864 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 400000 steps (20838 resets) in 4304 ms. (92 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-06-02 21:50:37] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:50:37] [INFO ] Invariant cache hit.
[2025-06-02 21:50:37] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2025-06-02 21:50:37] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 30 ms returned sat
[2025-06-02 21:50:37] [INFO ] After 382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 21:50:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:50:37] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 21:50:37] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 21:50:37] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 21:50:38] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2025-06-02 21:50:38] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2025-06-02 21:50:38] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 21:50:38] [INFO ] After 109ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 21:50:39] [INFO ] Deduced a trap composed of 156 places in 291 ms of which 4 ms to minimize.
[2025-06-02 21:50:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
TRAPS : Iteration 1
[2025-06-02 21:50:39] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 21:50:39] [INFO ] After 1271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (208201 resets) in 21853 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (13416 resets) in 5986 ms. (668 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2582364 steps, run timeout after 21001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 2582364 steps, saw 806301 distinct states, run finished after 21003 ms. (steps per millisecond=122 ) properties seen :0
[2025-06-02 21:51:07] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:51:07] [INFO ] Invariant cache hit.
[2025-06-02 21:51:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 24 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2025-06-02 21:51:08] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:51:08] [INFO ] Invariant cache hit.
[2025-06-02 21:51:09] [INFO ] Implicit Places using invariants in 924 ms returned []
[2025-06-02 21:51:09] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:51:09] [INFO ] Invariant cache hit.
[2025-06-02 21:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:51:17] [INFO ] Implicit Places using invariants and state equation in 7428 ms returned []
Implicit Place search using SMT with State Equation took 8356 ms to find 0 implicit places.
[2025-06-02 21:51:17] [INFO ] Redundant transitions in 11 ms returned []
Running 1097 sub problems to find dead transitions.
[2025-06-02 21:51:17] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:51:17] [INFO ] Invariant cache hit.
[2025-06-02 21:51:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:51:32] [INFO ] Deduced a trap composed of 245 places in 274 ms of which 4 ms to minimize.
[2025-06-02 21:51:32] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:51:32] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 4 ms to minimize.
[2025-06-02 21:51:32] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:51:33] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:51:33] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:51:33] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:51:34] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:51:34] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:51:34] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:51:35] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:51:35] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:51:35] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 5 ms to minimize.
[2025-06-02 21:51:36] [INFO ] Deduced a trap composed of 254 places in 250 ms of which 4 ms to minimize.
[2025-06-02 21:51:36] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:51:36] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 5 ms to minimize.
[2025-06-02 21:51:37] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:51:37] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:51:37] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2025-06-02 21:51:37] [INFO ] Deduced a trap composed of 242 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:51:38] [INFO ] Deduced a trap composed of 254 places in 247 ms of which 4 ms to minimize.
[2025-06-02 21:51:38] [INFO ] Deduced a trap composed of 245 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:51:39] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:51:39] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:51:40] [INFO ] Deduced a trap composed of 251 places in 377 ms of which 5 ms to minimize.
[2025-06-02 21:51:40] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 5 ms to minimize.
[2025-06-02 21:51:40] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 5 ms to minimize.
[2025-06-02 21:51:41] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:51:41] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:51:41] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:51:41] [INFO ] Deduced a trap composed of 260 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:51:42] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 5 ms to minimize.
[2025-06-02 21:51:42] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:51:42] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2025-06-02 21:51:43] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:51:43] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:51:43] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:51:43] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:51:44] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:51:44] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:51:54] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 5 ms to minimize.
[2025-06-02 21:51:55] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 5 ms to minimize.
[2025-06-02 21:51:55] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2025-06-02 21:51:55] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 5 ms to minimize.
[2025-06-02 21:51:56] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:51:56] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:51:56] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2025-06-02 21:51:56] [INFO ] Deduced a trap composed of 200 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:51:57] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 5 ms to minimize.
[2025-06-02 21:51:57] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 5 ms to minimize.
[2025-06-02 21:51:57] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 5 ms to minimize.
[2025-06-02 21:51:58] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 5 ms to minimize.
[2025-06-02 21:51:58] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 5 ms to minimize.
[2025-06-02 21:51:58] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 4 ms to minimize.
[2025-06-02 21:51:58] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:51:59] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:51:59] [INFO ] Deduced a trap composed of 200 places in 305 ms of which 4 ms to minimize.
[2025-06-02 21:51:59] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2025-06-02 21:52:00] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 4 ms to minimize.
[2025-06-02 21:52:00] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:52:03] [INFO ] Deduced a trap composed of 345 places in 243 ms of which 4 ms to minimize.
[2025-06-02 21:52:03] [INFO ] Deduced a trap composed of 335 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:52:04] [INFO ] Deduced a trap composed of 246 places in 247 ms of which 5 ms to minimize.
[2025-06-02 21:52:04] [INFO ] Deduced a trap composed of 239 places in 240 ms of which 4 ms to minimize.
[2025-06-02 21:52:04] [INFO ] Deduced a trap composed of 246 places in 226 ms of which 4 ms to minimize.
[2025-06-02 21:52:04] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 4 ms to minimize.
[2025-06-02 21:52:05] [INFO ] Deduced a trap composed of 248 places in 285 ms of which 4 ms to minimize.
[2025-06-02 21:52:05] [INFO ] Deduced a trap composed of 258 places in 282 ms of which 4 ms to minimize.
[2025-06-02 21:52:05] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 4 ms to minimize.
[2025-06-02 21:52:06] [INFO ] Deduced a trap composed of 242 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:52:06] [INFO ] Deduced a trap composed of 248 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:52:06] [INFO ] Deduced a trap composed of 306 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:52:06] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:52:07] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:52:07] [INFO ] Deduced a trap composed of 251 places in 251 ms of which 5 ms to minimize.
[2025-06-02 21:52:07] [INFO ] Deduced a trap composed of 248 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:52:08] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:52:08] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:52:08] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:52:09] [INFO ] Deduced a trap composed of 251 places in 259 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:52:14] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:52:14] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2025-06-02 21:52:14] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:52:15] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2025-06-02 21:52:15] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:52:15] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2025-06-02 21:52:16] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2025-06-02 21:52:16] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2025-06-02 21:52:16] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:52:17] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2025-06-02 21:52:17] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 5 ms to minimize.
[2025-06-02 21:52:17] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2025-06-02 21:52:17] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
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 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62215ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70637 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 400000 steps (20794 resets) in 2151 ms. (185 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-06-02 21:52:20] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:52:20] [INFO ] Invariant cache hit.
[2025-06-02 21:52:20] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 21:52:20] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2025-06-02 21:52:20] [INFO ] After 400ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 21:52:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:52:20] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 21:52:20] [INFO ] After 70ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 21:52:20] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 21:52:20] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2025-06-02 21:52:20] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2025-06-02 21:52:21] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 21:52:21] [INFO ] After 105ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 21:52:21] [INFO ] Deduced a trap composed of 156 places in 287 ms of which 4 ms to minimize.
[2025-06-02 21:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
TRAPS : Iteration 1
[2025-06-02 21:52:22] [INFO ] After 605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 21:52:22] [INFO ] After 1238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (2052 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (135 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 325514 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 325514 steps, saw 99005 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 21:52:25] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:52:25] [INFO ] Invariant cache hit.
[2025-06-02 21:52:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:52:26] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:52:26] [INFO ] Deduced a trap composed of 245 places in 264 ms of which 4 ms to minimize.
[2025-06-02 21:52:27] [INFO ] Deduced a trap composed of 233 places in 262 ms of which 4 ms to minimize.
[2025-06-02 21:52:27] [INFO ] Deduced a trap composed of 245 places in 269 ms of which 5 ms to minimize.
[2025-06-02 21:52:27] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 4 ms to minimize.
[2025-06-02 21:52:28] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:52:28] [INFO ] Deduced a trap composed of 251 places in 255 ms of which 5 ms to minimize.
[2025-06-02 21:52:28] [INFO ] Deduced a trap composed of 251 places in 253 ms of which 5 ms to minimize.
[2025-06-02 21:52:29] [INFO ] Deduced a trap composed of 237 places in 245 ms of which 4 ms to minimize.
[2025-06-02 21:52:29] [INFO ] Deduced a trap composed of 239 places in 243 ms of which 5 ms to minimize.
[2025-06-02 21:52:29] [INFO ] Deduced a trap composed of 263 places in 266 ms of which 5 ms to minimize.
[2025-06-02 21:52:30] [INFO ] Deduced a trap composed of 239 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:52:30] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:52:30] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 4 ms to minimize.
SMT process timed out in 5727ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2025-06-02 21:52:30] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:52:30] [INFO ] Invariant cache hit.
[2025-06-02 21:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:52:45] [INFO ] Deduced a trap composed of 245 places in 370 ms of which 4 ms to minimize.
[2025-06-02 21:52:46] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
[2025-06-02 21:52:46] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 4 ms to minimize.
[2025-06-02 21:52:46] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
[2025-06-02 21:52:47] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:52:47] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:52:47] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:52:48] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:52:48] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2025-06-02 21:52:48] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 5 ms to minimize.
[2025-06-02 21:52:49] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:52:49] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2025-06-02 21:52:49] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2025-06-02 21:52:49] [INFO ] Deduced a trap composed of 254 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:52:50] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2025-06-02 21:52:50] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2025-06-02 21:52:50] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:52:51] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:52:51] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2025-06-02 21:52:51] [INFO ] Deduced a trap composed of 242 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:52:52] [INFO ] Deduced a trap composed of 254 places in 239 ms of which 5 ms to minimize.
[2025-06-02 21:52:52] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:52:53] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 6 ms to minimize.
[2025-06-02 21:52:53] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
SMT process timed out in 22554ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22565ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22594 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40001 steps (2069 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (130 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 320256 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 320256 steps, saw 97410 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2025-06-02 21:52:56] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:52:56] [INFO ] Invariant cache hit.
[2025-06-02 21:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:52:58] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 4 ms to minimize.
[2025-06-02 21:52:58] [INFO ] Deduced a trap composed of 245 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:52:58] [INFO ] Deduced a trap composed of 233 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:52:59] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:52:59] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:52:59] [INFO ] Deduced a trap composed of 242 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:53:00] [INFO ] Deduced a trap composed of 251 places in 278 ms of which 5 ms to minimize.
[2025-06-02 21:53:00] [INFO ] Deduced a trap composed of 251 places in 253 ms of which 4 ms to minimize.
[2025-06-02 21:53:00] [INFO ] Deduced a trap composed of 237 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:53:01] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:53:01] [INFO ] Deduced a trap composed of 263 places in 246 ms of which 5 ms to minimize.
[2025-06-02 21:53:01] [INFO ] Deduced a trap composed of 239 places in 274 ms of which 4 ms to minimize.
[2025-06-02 21:53:02] [INFO ] Deduced a trap composed of 233 places in 267 ms of which 5 ms to minimize.
[2025-06-02 21:53:02] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:53:02] [INFO ] Deduced a trap composed of 224 places in 264 ms of which 5 ms to minimize.
[2025-06-02 21:53:03] [INFO ] Deduced a trap composed of 248 places in 247 ms of which 5 ms to minimize.
[2025-06-02 21:53:03] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 4 ms to minimize.
[2025-06-02 21:53:03] [INFO ] Deduced a trap composed of 239 places in 263 ms of which 5 ms to minimize.
[2025-06-02 21:53:04] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 5 ms to minimize.
[2025-06-02 21:53:04] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 20/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:53:04] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:53:05] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 4 ms to minimize.
[2025-06-02 21:53:05] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 5 ms to minimize.
[2025-06-02 21:53:06] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:53:06] [INFO ] Deduced a trap composed of 254 places in 255 ms of which 4 ms to minimize.
[2025-06-02 21:53:07] [INFO ] Deduced a trap composed of 246 places in 248 ms of which 5 ms to minimize.
[2025-06-02 21:53:07] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 5 ms to minimize.
[2025-06-02 21:53:07] [INFO ] Deduced a trap composed of 264 places in 255 ms of which 5 ms to minimize.
[2025-06-02 21:53:08] [INFO ] Deduced a trap composed of 239 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:53:08] [INFO ] Deduced a trap composed of 233 places in 245 ms of which 5 ms to minimize.
[2025-06-02 21:53:09] [INFO ] Deduced a trap composed of 245 places in 245 ms of which 4 ms to minimize.
[2025-06-02 21:53:09] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 4 ms to minimize.
[2025-06-02 21:53:11] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 5 ms to minimize.
[2025-06-02 21:53:11] [INFO ] Deduced a trap composed of 251 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:53:12] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:53:12] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 4 ms to minimize.
[2025-06-02 21:53:13] [INFO ] Deduced a trap composed of 239 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:53:13] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 4 ms to minimize.
[2025-06-02 21:53:13] [INFO ] Deduced a trap composed of 245 places in 245 ms of which 4 ms to minimize.
[2025-06-02 21:53:14] [INFO ] Deduced a trap composed of 246 places in 253 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1868 variables, 20/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:53:14] [INFO ] Deduced a trap composed of 239 places in 246 ms of which 5 ms to minimize.
[2025-06-02 21:53:15] [INFO ] Deduced a trap composed of 248 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:53:16] [INFO ] Deduced a trap composed of 233 places in 254 ms of which 5 ms to minimize.
[2025-06-02 21:53:16] [INFO ] Deduced a trap composed of 258 places in 259 ms of which 5 ms to minimize.
[2025-06-02 21:53:17] [INFO ] Deduced a trap composed of 263 places in 252 ms of which 5 ms to minimize.
[2025-06-02 21:53:17] [INFO ] Deduced a trap composed of 242 places in 279 ms of which 4 ms to minimize.
[2025-06-02 21:53:17] [INFO ] Deduced a trap composed of 239 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:53:18] [INFO ] Deduced a trap composed of 257 places in 263 ms of which 5 ms to minimize.
[2025-06-02 21:53:18] [INFO ] Deduced a trap composed of 239 places in 261 ms of which 4 ms to minimize.
[2025-06-02 21:53:18] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 5 ms to minimize.
[2025-06-02 21:53:21] [INFO ] Deduced a trap composed of 248 places in 255 ms of which 5 ms to minimize.
[2025-06-02 21:53:22] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 5 ms to minimize.
[2025-06-02 21:53:23] [INFO ] Deduced a trap composed of 254 places in 256 ms of which 5 ms to minimize.
[2025-06-02 21:53:23] [INFO ] Deduced a trap composed of 252 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:53:24] [INFO ] Deduced a trap composed of 251 places in 244 ms of which 4 ms to minimize.
[2025-06-02 21:53:24] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 5 ms to minimize.
[2025-06-02 21:53:25] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:53:25] [INFO ] Deduced a trap composed of 266 places in 264 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1868/1869 variables, and 965 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34449 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 769/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 58/58 constraints]
After SMT, in 35102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 27 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2025-06-02 21:53:31] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:53:31] [INFO ] Invariant cache hit.
[2025-06-02 21:53:32] [INFO ] Implicit Places using invariants in 900 ms returned []
[2025-06-02 21:53:32] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:53:32] [INFO ] Invariant cache hit.
[2025-06-02 21:53:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:53:40] [INFO ] Implicit Places using invariants and state equation in 7343 ms returned []
Implicit Place search using SMT with State Equation took 8244 ms to find 0 implicit places.
[2025-06-02 21:53:40] [INFO ] Redundant transitions in 17 ms returned []
Running 1097 sub problems to find dead transitions.
[2025-06-02 21:53:40] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 21:53:40] [INFO ] Invariant cache hit.
[2025-06-02 21:53:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:53:55] [INFO ] Deduced a trap composed of 245 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:53:55] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2025-06-02 21:53:56] [INFO ] Deduced a trap composed of 233 places in 280 ms of which 4 ms to minimize.
[2025-06-02 21:53:56] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2025-06-02 21:53:56] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 5 ms to minimize.
[2025-06-02 21:53:57] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2025-06-02 21:53:57] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2025-06-02 21:53:57] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 4 ms to minimize.
[2025-06-02 21:53:58] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:53:58] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:53:58] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 5 ms to minimize.
[2025-06-02 21:53:59] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:53:59] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2025-06-02 21:53:59] [INFO ] Deduced a trap composed of 254 places in 270 ms of which 5 ms to minimize.
[2025-06-02 21:54:00] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:54:00] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 5 ms to minimize.
[2025-06-02 21:54:00] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 5 ms to minimize.
[2025-06-02 21:54:01] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2025-06-02 21:54:01] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:54:01] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:54:02] [INFO ] Deduced a trap composed of 254 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:54:02] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 4 ms to minimize.
[2025-06-02 21:54:03] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:54:03] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:54:03] [INFO ] Deduced a trap composed of 251 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:54:04] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2025-06-02 21:54:04] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:54:04] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 4 ms to minimize.
[2025-06-02 21:54:04] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
[2025-06-02 21:54:05] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:54:05] [INFO ] Deduced a trap composed of 260 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:54:05] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:54:06] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:54:06] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2025-06-02 21:54:06] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 5 ms to minimize.
[2025-06-02 21:54:06] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2025-06-02 21:54:07] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 5 ms to minimize.
[2025-06-02 21:54:07] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:54:07] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:54:08] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:54:18] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 4 ms to minimize.
[2025-06-02 21:54:18] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
[2025-06-02 21:54:18] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:54:18] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2025-06-02 21:54:19] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 5 ms to minimize.
[2025-06-02 21:54:19] [INFO ] Deduced a trap composed of 200 places in 282 ms of which 4 ms to minimize.
[2025-06-02 21:54:19] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:54:20] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 5 ms to minimize.
[2025-06-02 21:54:20] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2025-06-02 21:54:20] [INFO ] Deduced a trap composed of 200 places in 285 ms of which 4 ms to minimize.
[2025-06-02 21:54:21] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2025-06-02 21:54:21] [INFO ] Deduced a trap composed of 200 places in 283 ms of which 4 ms to minimize.
[2025-06-02 21:54:21] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 5 ms to minimize.
[2025-06-02 21:54:21] [INFO ] Deduced a trap composed of 200 places in 276 ms of which 4 ms to minimize.
[2025-06-02 21:54:22] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 5 ms to minimize.
[2025-06-02 21:54:22] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2025-06-02 21:54:22] [INFO ] Deduced a trap composed of 200 places in 267 ms of which 5 ms to minimize.
[2025-06-02 21:54:23] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:54:23] [INFO ] Deduced a trap composed of 200 places in 266 ms of which 4 ms to minimize.
[2025-06-02 21:54:23] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:54:26] [INFO ] Deduced a trap composed of 345 places in 260 ms of which 4 ms to minimize.
[2025-06-02 21:54:27] [INFO ] Deduced a trap composed of 335 places in 255 ms of which 5 ms to minimize.
[2025-06-02 21:54:27] [INFO ] Deduced a trap composed of 246 places in 249 ms of which 4 ms to minimize.
[2025-06-02 21:54:27] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 4 ms to minimize.
[2025-06-02 21:54:28] [INFO ] Deduced a trap composed of 246 places in 251 ms of which 5 ms to minimize.
[2025-06-02 21:54:28] [INFO ] Deduced a trap composed of 245 places in 241 ms of which 4 ms to minimize.
[2025-06-02 21:54:28] [INFO ] Deduced a trap composed of 248 places in 287 ms of which 5 ms to minimize.
[2025-06-02 21:54:28] [INFO ] Deduced a trap composed of 258 places in 285 ms of which 5 ms to minimize.
[2025-06-02 21:54:29] [INFO ] Deduced a trap composed of 239 places in 281 ms of which 4 ms to minimize.
[2025-06-02 21:54:29] [INFO ] Deduced a trap composed of 242 places in 282 ms of which 5 ms to minimize.
[2025-06-02 21:54:29] [INFO ] Deduced a trap composed of 248 places in 283 ms of which 5 ms to minimize.
[2025-06-02 21:54:30] [INFO ] Deduced a trap composed of 306 places in 281 ms of which 4 ms to minimize.
[2025-06-02 21:54:30] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 4 ms to minimize.
[2025-06-02 21:54:30] [INFO ] Deduced a trap composed of 242 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:54:31] [INFO ] Deduced a trap composed of 251 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:54:31] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:54:31] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 4 ms to minimize.
[2025-06-02 21:54:32] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 4 ms to minimize.
[2025-06-02 21:54:32] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 5 ms to minimize.
[2025-06-02 21:54:32] [INFO ] Deduced a trap composed of 251 places in 279 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 5 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 5 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 5 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 5 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62515ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70827 ms. Remains : 770/770 places, 1103/1103 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1099
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1098
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1098
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1097
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1097
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 768 transition count 1093
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 764 transition count 1093
Applied a total of 16 rules in 94 ms. Remains 764 /770 variables (removed 6) and now considering 1093/1103 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1093 rows 764 cols
[2025-06-02 21:54:42] [INFO ] Computed 137 invariants in 26 ms
[2025-06-02 21:54:42] [INFO ] [Real]Absence check using 130 positive place invariants in 42 ms returned sat
[2025-06-02 21:54:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2025-06-02 21:54:42] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 21:54:43] [INFO ] [Nat]Absence check using 130 positive place invariants in 29 ms returned sat
[2025-06-02 21:54:43] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 21:54:43] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 21:54:43] [INFO ] Deduced a trap composed of 240 places in 267 ms of which 4 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 231 places in 254 ms of which 4 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 4 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 255 places in 274 ms of which 4 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 4 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 5 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 231 places in 253 ms of which 4 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 222 places in 255 ms of which 5 ms to minimize.
[2025-06-02 21:54:46] [INFO ] Deduced a trap composed of 231 places in 244 ms of which 4 ms to minimize.
[2025-06-02 21:54:46] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 5 ms to minimize.
[2025-06-02 21:54:46] [INFO ] Deduced a trap composed of 231 places in 277 ms of which 4 ms to minimize.
[2025-06-02 21:54:47] [INFO ] Deduced a trap composed of 240 places in 268 ms of which 5 ms to minimize.
[2025-06-02 21:54:47] [INFO ] Deduced a trap composed of 222 places in 250 ms of which 5 ms to minimize.
[2025-06-02 21:54:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5083 ms
TRAPS : Iteration 1
[2025-06-02 21:54:48] [INFO ] After 5600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 21:54:48] [INFO ] After 5806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 6128 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 3 ms.
Working with output stream class java.io.PrintStream
Total runtime 518299 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S05J60

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.187

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 969
TRANSITIONS: 2030
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 12704
UNFOLDING TIME: 0.365

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.088
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.889
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1874
MODEL NAME: /home/mcc/execution/model
969 places, 2030 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML

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="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBNT-COL-S05J60, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266900362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;