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.r084-tall-174860080300298.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 DoubleExponent-PT-003, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080300298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K 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 3.7K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 50K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748736261806

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 00:04:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 00:04:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:04:23] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-01 00:04:23] [INFO ] Transformed 163 places.
[2025-06-01 00:04:23] [INFO ] Transformed 148 transitions.
[2025-06-01 00:04:23] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 329 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 9 ms.
RANDOM walk for 40000 steps (1321 resets) in 3019 ms. (13 steps per ms) remains 108/152 properties
BEST_FIRST walk for 400 steps (11 resets) in 22 ms. (17 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 16 ms. (23 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 24 ms. (16 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 27 ms. (14 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 26 ms. (14 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (11 resets) in 20 ms. (19 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 19 ms. (20 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 17 ms. (22 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (12 resets) in 27 ms. (14 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 18 ms. (21 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 23 ms. (16 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 19 ms. (20 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 31 ms. (12 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
// Phase 1: matrix 148 rows 163 cols
[2025-06-01 00:04:25] [INFO ] Computed 19 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 50/158 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 5/163 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 148/311 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 182 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 50/158 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 00:04:29] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 23 ms to minimize.
[2025-06-01 00:04:29] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2025-06-01 00:04:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:04:29] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 2 ms to minimize.
[2025-06-01 00:04:30] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 00:04:30] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:04:30] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:04:31] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 3 ms to minimize.
[2025-06-01 00:04:31] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 00:04:31] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:04:31] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:04:31] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:04:32] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2025-06-01 00:04:32] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 00:04:32] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 5/163 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 2 ms to minimize.
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:04:33] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/311 variables, and 42 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 0/108 constraints, Known Traps: 23/23 constraints]
After SMT, in 8967ms problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 163 transition count 139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 154 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 154 transition count 137
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 152 transition count 137
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 138 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 136 transition count 123
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 136 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 135 transition count 122
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 135 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 134 transition count 121
Applied a total of 60 rules in 102 ms. Remains 134 /163 variables (removed 29) and now considering 121/148 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 134/163 places, 121/148 transitions.
RANDOM walk for 4000000 steps (510100 resets) in 40588 ms. (98 steps per ms) remains 70/108 properties
BEST_FIRST walk for 400003 steps (33708 resets) in 1748 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33868 resets) in 1886 ms. (211 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33673 resets) in 1788 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33578 resets) in 1752 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33770 resets) in 1764 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33671 resets) in 1766 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33899 resets) in 1758 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33592 resets) in 1781 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33672 resets) in 1760 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33757 resets) in 1767 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33593 resets) in 1768 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33799 resets) in 1755 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33994 resets) in 1764 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34035 resets) in 1761 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33832 resets) in 1762 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33748 resets) in 1761 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33830 resets) in 1771 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33706 resets) in 1762 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33679 resets) in 1781 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33959 resets) in 1782 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33810 resets) in 1791 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33763 resets) in 1783 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33824 resets) in 1771 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33773 resets) in 1749 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33813 resets) in 1752 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33889 resets) in 1753 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33623 resets) in 1748 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33885 resets) in 1750 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33726 resets) in 1794 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33853 resets) in 1760 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33662 resets) in 1740 ms. (229 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33752 resets) in 1771 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33715 resets) in 1777 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33846 resets) in 1756 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33738 resets) in 1770 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33736 resets) in 1774 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33784 resets) in 1752 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33959 resets) in 1762 ms. (226 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33680 resets) in 1786 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33866 resets) in 1753 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33706 resets) in 1753 ms. (228 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33663 resets) in 1756 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33688 resets) in 1756 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34100 resets) in 1728 ms. (231 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33812 resets) in 1743 ms. (229 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33586 resets) in 1760 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33672 resets) in 1783 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33916 resets) in 1769 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33758 resets) in 1783 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33730 resets) in 2456 ms. (162 steps per ms) remains 70/70 properties
// Phase 1: matrix 121 rows 134 cols
[2025-06-01 00:05:11] [INFO ] Computed 19 invariants in 4 ms
[2025-06-01 00:05:11] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 46/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 14/134 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 121/255 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1896 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 46/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 14/134 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 2 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:05:15] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2025-06-01 00:05:16] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:05:16] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 121/255 variables, 134/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 70/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 15 (OVERLAPS) 0/255 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 250 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4988 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 25/25 constraints]
After SMT, in 6908ms problems are : Problem set: 0 solved, 70 unsolved
Fused 70 Parikh solutions to 67 different solutions.
Parikh walk visited 0 properties in 6391 ms.
Support contains 70 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 121/121 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 134 transition count 113
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 126 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 126 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 125 transition count 112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 117 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 116 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 116 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 115 transition count 103
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 115 transition count 103
Applied a total of 42 rules in 20 ms. Remains 115 /134 variables (removed 19) and now considering 103/121 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 115/134 places, 103/121 transitions.
RANDOM walk for 4000000 steps (512841 resets) in 40142 ms. (99 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33923 resets) in 2215 ms. (180 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33920 resets) in 2244 ms. (178 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33904 resets) in 1901 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (34146 resets) in 1852 ms. (215 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33869 resets) in 1835 ms. (217 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33948 resets) in 1846 ms. (216 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33855 resets) in 1809 ms. (220 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33883 resets) in 1819 ms. (219 steps per ms) remains 61/70 properties
BEST_FIRST walk for 400001 steps (33985 resets) in 1719 ms. (232 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33733 resets) in 1739 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33852 resets) in 1723 ms. (232 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33869 resets) in 1719 ms. (232 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (34033 resets) in 1719 ms. (232 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33883 resets) in 1752 ms. (228 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33910 resets) in 1742 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33738 resets) in 1738 ms. (230 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (34016 resets) in 1717 ms. (232 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33767 resets) in 1774 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33837 resets) in 1775 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33770 resets) in 1770 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33864 resets) in 1793 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33904 resets) in 1795 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33864 resets) in 1774 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33840 resets) in 1781 ms. (224 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33885 resets) in 1761 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33822 resets) in 1745 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33914 resets) in 1743 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33822 resets) in 1703 ms. (234 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33989 resets) in 1736 ms. (230 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33896 resets) in 1707 ms. (234 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33818 resets) in 1725 ms. (231 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33797 resets) in 1726 ms. (231 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33920 resets) in 1694 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33924 resets) in 1702 ms. (234 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (34140 resets) in 1690 ms. (236 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33838 resets) in 1680 ms. (237 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33736 resets) in 1708 ms. (234 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33936 resets) in 1706 ms. (234 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33702 resets) in 1690 ms. (236 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33826 resets) in 2133 ms. (187 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33706 resets) in 2380 ms. (167 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33851 resets) in 1730 ms. (231 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33832 resets) in 1706 ms. (234 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33780 resets) in 1699 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33926 resets) in 1692 ms. (236 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33855 resets) in 1668 ms. (239 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33806 resets) in 1697 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33773 resets) in 1689 ms. (236 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33923 resets) in 1838 ms. (217 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33693 resets) in 2248 ms. (177 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33886 resets) in 1728 ms. (231 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33963 resets) in 1701 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33898 resets) in 1688 ms. (236 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33701 resets) in 2430 ms. (164 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33997 resets) in 2432 ms. (164 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33820 resets) in 2498 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33893 resets) in 2262 ms. (176 steps per ms) remains 61/61 properties
// Phase 1: matrix 103 rows 115 cols
[2025-06-01 00:06:08] [INFO ] Computed 19 invariants in 3 ms
[2025-06-01 00:06:08] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 13/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 36/110 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 103/214 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 4/218 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 115/115 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 13/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 36/110 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 2 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:06:10] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 9 ms to minimize.
[2025-06-01 00:06:11] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 103/214 variables, 111/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 61/203 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 00:06:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:06:11] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2025-06-01 00:06:11] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:06:11] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:06:12] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2025-06-01 00:06:12] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:06:12] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:06:12] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 15 (OVERLAPS) 4/218 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 18 (OVERLAPS) 0/218 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 217 constraints, problems are : Problem set: 0 solved, 61 unsolved in 6325 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 115/115 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 18/18 constraints]
After SMT, in 8002ms problems are : Problem set: 0 solved, 61 unsolved
Fused 61 Parikh solutions to 53 different solutions.
Parikh walk visited 0 properties in 1652 ms.
Support contains 61 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 103/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 113 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 113 transition count 100
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 112 transition count 100
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 112 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 111 transition count 99
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 11 place count 111 transition count 96
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 14 place count 108 transition count 96
Applied a total of 14 rules in 13 ms. Remains 108 /115 variables (removed 7) and now considering 96/103 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 108/115 places, 96/103 transitions.
RANDOM walk for 4000000 steps (512398 resets) in 37322 ms. (107 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33816 resets) in 1775 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33831 resets) in 1766 ms. (226 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (34141 resets) in 1777 ms. (224 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33943 resets) in 1793 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33976 resets) in 1770 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33613 resets) in 2052 ms. (194 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33726 resets) in 1757 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33883 resets) in 1734 ms. (230 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33734 resets) in 1705 ms. (234 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33854 resets) in 1734 ms. (230 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33961 resets) in 1719 ms. (232 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (34004 resets) in 1737 ms. (230 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33996 resets) in 1811 ms. (220 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33735 resets) in 1812 ms. (220 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (34026 resets) in 1781 ms. (224 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33798 resets) in 1759 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (34044 resets) in 1770 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33868 resets) in 1757 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33881 resets) in 1740 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33746 resets) in 1755 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33848 resets) in 1764 ms. (226 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33731 resets) in 1787 ms. (223 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (34020 resets) in 1736 ms. (230 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33793 resets) in 1750 ms. (228 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33788 resets) in 1760 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (34030 resets) in 1766 ms. (226 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33896 resets) in 1764 ms. (226 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33889 resets) in 1753 ms. (228 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33933 resets) in 1740 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33882 resets) in 1745 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33930 resets) in 1741 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33988 resets) in 1777 ms. (224 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33791 resets) in 1744 ms. (229 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33684 resets) in 1764 ms. (226 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33857 resets) in 1759 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33784 resets) in 1770 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33967 resets) in 1792 ms. (223 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (34011 resets) in 1796 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33823 resets) in 1747 ms. (228 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33961 resets) in 1780 ms. (224 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (33948 resets) in 2064 ms. (193 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33897 resets) in 1791 ms. (223 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33784 resets) in 1774 ms. (225 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33938 resets) in 1808 ms. (221 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33760 resets) in 1768 ms. (226 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (33871 resets) in 1750 ms. (228 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33966 resets) in 1761 ms. (227 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33911 resets) in 2177 ms. (183 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (33780 resets) in 1787 ms. (223 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400000 steps (33861 resets) in 1774 ms. (225 steps per ms) remains 61/61 properties
Probably explored full state space saw : 767900 states, properties seen :59
Probabilistic random walk after 1535861 steps, saw 767900 distinct states, run finished after 8740 ms. (steps per millisecond=175 ) properties seen :59
Finished exhaustive random walk after 1959329 steps, run visited all 2 properties in 10738 ms. (steps per millisecond=182 )
Exhaustive walk after 1959329 steps, saw 979880 distinct states, run finished after 10748 ms. (steps per millisecond=182 ) properties seen :2
Able to resolve query StableMarking after proving 153 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK EXHAUSTIVE_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 173749 ms.
ITS solved all properties within timeout

BK_STOP 1748736437421

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 StableMarking -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="DoubleExponent-PT-003"
export BK_EXAMINATION="StableMarking"
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 DoubleExponent-PT-003, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080300298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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