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.r014-tall-174853743500188.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 ASLink-PT-02a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743500188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K 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.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 279K 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 1748544780089

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:53:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:53:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:53:01] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-05-29 18:53:01] [INFO ] Transformed 626 places.
[2025-05-29 18:53:01] [INFO ] Transformed 1008 transitions.
[2025-05-29 18:53:01] [INFO ] Found NUPN structural information;
[2025-05-29 18:53:01] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 216 ms.
Structural test allowed to assert that 68 places are NOT stable. Took 9 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (452 resets) in 2350 ms. (17 steps per ms) remains 93/558 properties
BEST_FIRST walk for 4002 steps (13 resets) in 41 ms. (95 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 58 ms. (67 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (13 resets) in 42 ms. (93 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (12 resets) in 85 ms. (46 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (13 resets) in 25 ms. (153 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (14 resets) in 26 ms. (148 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (13 resets) in 27 ms. (143 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (10 resets) in 30 ms. (129 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (12 resets) in 31 ms. (125 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (14 resets) in 27 ms. (142 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (12 resets) in 47 ms. (83 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (13 resets) in 22 ms. (174 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (10 resets) in 20 ms. (190 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 35 ms. (111 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (13 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
// Phase 1: matrix 998 rows 626 cols
[2025-05-29 18:53:03] [INFO ] Computed 118 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 27/120 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 27/137 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 85/205 variables, 17/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 85/240 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 410/615 variables, 77/317 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 410/727 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 11/626 variables, 6/733 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 11/744 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 998/1624 variables, 626/1370 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1624/1624 variables, and 1370 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5052 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 27/120 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 27/137 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 85/205 variables, 17/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 85/240 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 410/615 variables, 77/317 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 410/727 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-05-29 18:53:09] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 32 ms to minimize.
[2025-05-29 18:53:09] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1624 variables, and 729 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5025 ms.
Refiners :[Domain max(s): 615/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 84/90 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/93 constraints, Known Traps: 2/2 constraints]
After SMT, in 10234ms problems are : Problem set: 0 solved, 93 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 618 transition count 954
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 96 place count 574 transition count 954
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 96 place count 574 transition count 908
Deduced a syphon composed of 46 places in 4 ms
Ensure Unique test removed 17 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 109 rules applied. Total rules applied 205 place count 511 transition count 908
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 511 transition count 907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 207 place count 510 transition count 907
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 210 place count 507 transition count 891
Iterating global reduction 4 with 3 rules applied. Total rules applied 213 place count 507 transition count 891
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 4 rules applied. Total rules applied 217 place count 506 transition count 888
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 219 place count 504 transition count 888
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 220 place count 503 transition count 880
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 503 transition count 880
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 222 place count 502 transition count 872
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 502 transition count 872
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 501 transition count 864
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 501 transition count 864
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 226 place count 500 transition count 856
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 500 transition count 856
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 499 transition count 848
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 499 transition count 848
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 230 place count 498 transition count 840
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 498 transition count 840
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 232 place count 497 transition count 832
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 497 transition count 832
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 234 place count 496 transition count 824
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 496 transition count 824
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 236 place count 495 transition count 816
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 495 transition count 816
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 238 place count 494 transition count 808
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 494 transition count 808
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 240 place count 493 transition count 800
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 493 transition count 800
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 242 place count 492 transition count 792
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 492 transition count 792
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 244 place count 491 transition count 784
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 491 transition count 784
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 246 place count 490 transition count 776
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 490 transition count 776
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 248 place count 489 transition count 768
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 489 transition count 768
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 250 place count 488 transition count 760
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 488 transition count 760
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 275 place count 476 transition count 748
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 276 place count 476 transition count 748
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 475 transition count 747
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 279 place count 473 transition count 747
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 279 place count 473 transition count 743
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 287 place count 469 transition count 743
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 288 place count 468 transition count 743
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 290 place count 467 transition count 742
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 291 place count 466 transition count 741
Iterating global reduction 8 with 1 rules applied. Total rules applied 292 place count 466 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 293 place count 466 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 294 place count 465 transition count 740
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 295 place count 465 transition count 740
Applied a total of 295 rules in 549 ms. Remains 465 /626 variables (removed 161) and now considering 740/998 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 465/626 places, 740/998 transitions.
RANDOM walk for 4000000 steps (68806 resets) in 34710 ms. (115 steps per ms) remains 89/93 properties
BEST_FIRST walk for 400002 steps (2361 resets) in 1489 ms. (268 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (2317 resets) in 1505 ms. (265 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (2364 resets) in 1654 ms. (241 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (2313 resets) in 1533 ms. (260 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (2285 resets) in 1684 ms. (237 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (2343 resets) in 1381 ms. (289 steps per ms) remains 43/89 properties
BEST_FIRST walk for 400002 steps (2325 resets) in 1140 ms. (350 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (2336 resets) in 1096 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (2344 resets) in 940 ms. (425 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (2319 resets) in 951 ms. (420 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400001 steps (2357 resets) in 869 ms. (459 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (2331 resets) in 1059 ms. (377 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2347 resets) in 881 ms. (453 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (2301 resets) in 898 ms. (444 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (2362 resets) in 876 ms. (456 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (2362 resets) in 891 ms. (448 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2358 resets) in 907 ms. (440 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (2334 resets) in 900 ms. (443 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (2342 resets) in 887 ms. (450 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2326 resets) in 903 ms. (442 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (2344 resets) in 894 ms. (446 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (2397 resets) in 922 ms. (433 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400001 steps (2334 resets) in 932 ms. (428 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400001 steps (2322 resets) in 915 ms. (436 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (2352 resets) in 907 ms. (440 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400001 steps (2325 resets) in 917 ms. (435 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (2338 resets) in 891 ms. (448 steps per ms) remains 41/43 properties
BEST_FIRST walk for 400002 steps (2347 resets) in 898 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2340 resets) in 880 ms. (454 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2276 resets) in 893 ms. (447 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2324 resets) in 886 ms. (450 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2345 resets) in 875 ms. (456 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2334 resets) in 890 ms. (448 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2356 resets) in 862 ms. (463 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2308 resets) in 873 ms. (457 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2340 resets) in 879 ms. (454 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2330 resets) in 864 ms. (462 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2330 resets) in 865 ms. (461 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2347 resets) in 870 ms. (459 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2332 resets) in 853 ms. (468 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2387 resets) in 854 ms. (467 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2347 resets) in 862 ms. (463 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2335 resets) in 862 ms. (463 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2335 resets) in 895 ms. (446 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2368 resets) in 857 ms. (466 steps per ms) remains 41/41 properties
// Phase 1: matrix 740 rows 465 cols
[2025-05-29 18:53:35] [INFO ] Computed 89 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 122/174 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 5/179 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 108/287 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 66/353 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 1/354 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 17 (OVERLAPS) 108/462 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 19 (OVERLAPS) 1/463 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/463 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 21 (OVERLAPS) 2/465 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/465 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 23 (OVERLAPS) 740/1205 variables, 465/554 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1205 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 25 (OVERLAPS) 0/1205 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 554 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3782 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 122/174 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 5/179 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 108/287 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-29 18:53:40] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (OVERLAPS) 66/353 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 16 (OVERLAPS) 1/354 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 18 (OVERLAPS) 108/462 variables, 29/87 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 20 (OVERLAPS) 1/463 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 22 (OVERLAPS) 2/465 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/465 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 24 (OVERLAPS) 740/1205 variables, 465/555 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1205 variables, 41/596 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1205 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 27 (OVERLAPS) 0/1205 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 596 constraints, problems are : Problem set: 0 solved, 41 unsolved in 7865 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
After SMT, in 11694ms problems are : Problem set: 0 solved, 41 unsolved
Fused 41 Parikh solutions to 37 different solutions.
Parikh walk visited 0 properties in 7893 ms.
Support contains 41 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 740/740 transitions.
Ensure Unique test removed 2 places
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 4 rules applied. Total rules applied 4 place count 463 transition count 738
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 460 transition count 738
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 460 transition count 737
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 9 place count 459 transition count 737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 458 transition count 731
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 458 transition count 731
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 457 transition count 731
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 455 transition count 729
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 454 transition count 728
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 454 transition count 728
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 454 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 453 transition count 727
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 453 transition count 727
Applied a total of 21 rules in 84 ms. Remains 453 /465 variables (removed 12) and now considering 727/740 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 453/465 places, 727/740 transitions.
RANDOM walk for 4000000 steps (64694 resets) in 24342 ms. (164 steps per ms) remains 34/41 properties
BEST_FIRST walk for 400003 steps (2235 resets) in 1013 ms. (394 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2231 resets) in 850 ms. (470 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400003 steps (2252 resets) in 807 ms. (495 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2204 resets) in 1017 ms. (392 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (2232 resets) in 817 ms. (489 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (2243 resets) in 803 ms. (497 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (2196 resets) in 813 ms. (491 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2257 resets) in 831 ms. (480 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2228 resets) in 830 ms. (481 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (2211 resets) in 810 ms. (493 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2215 resets) in 809 ms. (493 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (2210 resets) in 822 ms. (486 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2213 resets) in 841 ms. (475 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (2207 resets) in 822 ms. (486 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2245 resets) in 799 ms. (500 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2245 resets) in 824 ms. (484 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400003 steps (2224 resets) in 832 ms. (480 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2238 resets) in 806 ms. (495 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2209 resets) in 806 ms. (495 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2205 resets) in 814 ms. (490 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2250 resets) in 819 ms. (487 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2226 resets) in 804 ms. (496 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2187 resets) in 824 ms. (484 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2249 resets) in 811 ms. (492 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2221 resets) in 821 ms. (486 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2246 resets) in 796 ms. (501 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2184 resets) in 792 ms. (504 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (2252 resets) in 812 ms. (492 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2236 resets) in 821 ms. (486 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2210 resets) in 810 ms. (493 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2254 resets) in 787 ms. (507 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2175 resets) in 795 ms. (502 steps per ms) remains 31/31 properties
// Phase 1: matrix 727 rows 453 cols
[2025-05-29 18:54:09] [INFO ] Computed 85 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 56/87 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 12/99 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 84/183 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 3/186 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 72/258 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 80/338 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 1/339 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 111/450 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (OVERLAPS) 1/451 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/451 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (OVERLAPS) 2/453 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/453 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (OVERLAPS) 727/1180 variables, 453/538 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1180 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (OVERLAPS) 0/1180 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1180/1180 variables, and 538 constraints, problems are : Problem set: 0 solved, 31 unsolved in 2722 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 56/87 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 12/99 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 84/183 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 3/186 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 72/258 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 80/338 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 1/339 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 111/450 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (OVERLAPS) 1/451 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/451 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (OVERLAPS) 2/453 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/453 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (OVERLAPS) 727/1180 variables, 453/538 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1180 variables, 31/569 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1180 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 25 (OVERLAPS) 0/1180 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1180/1180 variables, and 569 constraints, problems are : Problem set: 0 solved, 31 unsolved in 4576 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 7327ms problems are : Problem set: 0 solved, 31 unsolved
Fused 31 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 4811 ms.
Support contains 31 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 727/727 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 452 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 451 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 450 transition count 725
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 449 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 449 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 448 transition count 723
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 10 place count 448 transition count 723
Applied a total of 10 rules in 36 ms. Remains 448 /453 variables (removed 5) and now considering 723/727 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 448/453 places, 723/727 transitions.
RANDOM walk for 4000000 steps (64852 resets) in 19914 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2225 resets) in 825 ms. (484 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2246 resets) in 805 ms. (496 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2238 resets) in 790 ms. (505 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2287 resets) in 789 ms. (506 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2234 resets) in 807 ms. (495 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2174 resets) in 797 ms. (501 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2193 resets) in 791 ms. (505 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2219 resets) in 789 ms. (506 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2216 resets) in 794 ms. (503 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2233 resets) in 810 ms. (493 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2221 resets) in 807 ms. (495 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2180 resets) in 801 ms. (498 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (2209 resets) in 794 ms. (503 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2233 resets) in 812 ms. (492 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2195 resets) in 807 ms. (495 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2195 resets) in 792 ms. (504 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2209 resets) in 778 ms. (513 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (2205 resets) in 792 ms. (504 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2205 resets) in 816 ms. (489 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (2189 resets) in 786 ms. (508 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2254 resets) in 781 ms. (511 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (2243 resets) in 793 ms. (503 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2212 resets) in 812 ms. (492 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2214 resets) in 797 ms. (501 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2206 resets) in 791 ms. (505 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2204 resets) in 806 ms. (495 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2249 resets) in 805 ms. (496 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2197 resets) in 822 ms. (486 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2224 resets) in 796 ms. (501 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2234 resets) in 801 ms. (498 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2191 resets) in 802 ms. (498 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 3616002 steps, run timeout after 39001 ms. (steps per millisecond=92 ) properties seen :14 out of 31
Probabilistic random walk after 3616002 steps, saw 1104348 distinct states, run finished after 39005 ms. (steps per millisecond=92 ) properties seen :14
// Phase 1: matrix 723 rows 448 cols
[2025-05-29 18:55:14] [INFO ] Computed 83 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 95/156 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 30/186 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 145/331 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 47/378 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/446 variables, 23/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/446 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/447 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 1/448 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/448 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 723/1171 variables, 448/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1171 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 0/1171 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1171/1171 variables, and 531 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 95/156 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 30/186 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 145/331 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 47/378 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/446 variables, 23/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/446 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/447 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 1/448 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/448 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 723/1171 variables, 448/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1171 variables, 17/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1171 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 0/1171 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1171/1171 variables, and 548 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 3839ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1147 ms.
Support contains 17 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 723/723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 448 transition count 720
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 445 transition count 720
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 445 transition count 717
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 440 transition count 717
Applied a total of 14 rules in 19 ms. Remains 440 /448 variables (removed 8) and now considering 717/723 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 440/448 places, 717/723 transitions.
RANDOM walk for 4000000 steps (64714 resets) in 19824 ms. (201 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2214 resets) in 900 ms. (443 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2209 resets) in 795 ms. (502 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2240 resets) in 753 ms. (530 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2202 resets) in 767 ms. (520 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2260 resets) in 767 ms. (520 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2202 resets) in 771 ms. (518 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2217 resets) in 779 ms. (512 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2169 resets) in 761 ms. (524 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2185 resets) in 775 ms. (515 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2261 resets) in 775 ms. (515 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2207 resets) in 774 ms. (516 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2220 resets) in 772 ms. (517 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2271 resets) in 767 ms. (520 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2219 resets) in 755 ms. (529 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2236 resets) in 784 ms. (509 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2230 resets) in 785 ms. (508 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2254 resets) in 774 ms. (516 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 3111506 steps, run timeout after 33001 ms. (steps per millisecond=94 ) properties seen :0 out of 17
Probabilistic random walk after 3111506 steps, saw 972088 distinct states, run finished after 33001 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 717 rows 440 cols
[2025-05-29 18:56:03] [INFO ] Computed 81 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 100/161 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 21/182 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 141/323 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 46/369 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/437 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/438 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 2/440 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 717/1157 variables, 440/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1157 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 0/1157 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1157/1157 variables, and 521 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 100/161 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 21/182 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 141/323 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 46/369 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/437 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/438 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 2/440 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 717/1157 variables, 440/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1157 variables, 17/538 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-05-29 18:56:06] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 5 ms to minimize.
[2025-05-29 18:56:06] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1157 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1157 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 0/1157 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1157/1157 variables, and 540 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3201 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 4686ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 764 ms.
Support contains 17 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 717/717 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 440/440 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 717/717 transitions.
Applied a total of 0 rules in 11 ms. Remains 440 /440 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2025-05-29 18:56:08] [INFO ] Invariant cache hit.
[2025-05-29 18:56:09] [INFO ] Implicit Places using invariants in 375 ms returned [0, 19, 31, 49, 67, 142, 160, 161, 162, 180, 198, 267, 271, 272, 275, 286, 287, 288, 306, 308, 311, 329, 330, 331, 332, 344, 350, 356, 362, 368, 374, 380, 386, 392, 398, 404]
[2025-05-29 18:56:09] [INFO ] Actually due to overlaps returned [306, 288, 31, 49, 162, 180, 311, 161, 287, 330, 160, 286, 308, 329, 0, 271, 272, 19, 67, 198, 332, 374, 392, 404, 142, 275, 331, 344, 350, 356, 362, 368, 380, 386, 398]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 385 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 405/440 places, 717/717 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 404 transition count 659
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 346 transition count 659
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 117 place count 346 transition count 645
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 146 place count 331 transition count 645
Discarding 4 places :
Implicit places reduction removed 4 places
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 2 with 12 rules applied. Total rules applied 158 place count 327 transition count 637
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 166 place count 319 transition count 637
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 181 place count 304 transition count 622
Iterating global reduction 4 with 15 rules applied. Total rules applied 196 place count 304 transition count 622
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 199 place count 304 transition count 619
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 199 place count 304 transition count 618
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 201 place count 303 transition count 618
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 300 transition count 615
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 300 transition count 615
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 299 transition count 614
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 299 transition count 614
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 298 transition count 613
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 298 transition count 613
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 261 place count 273 transition count 588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 273 transition count 587
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 263 place count 272 transition count 586
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 272 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 265 place count 272 transition count 585
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 271 place count 272 transition count 579
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 278 place count 265 transition count 579
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 279 place count 265 transition count 578
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 285 place count 265 transition count 578
Applied a total of 285 rules in 82 ms. Remains 265 /405 variables (removed 140) and now considering 578/717 (removed 139) transitions.
// Phase 1: matrix 578 rows 265 cols
[2025-05-29 18:56:09] [INFO ] Computed 39 invariants in 3 ms
[2025-05-29 18:56:09] [INFO ] Implicit Places using invariants in 441 ms returned [95, 101, 104, 106, 109, 119, 120, 174, 191, 197, 200, 202]
[2025-05-29 18:56:09] [INFO ] Actually due to overlaps returned [119, 120, 95, 101, 106, 191, 197, 202, 109, 174]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 444 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/440 places, 578/717 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 246 transition count 569
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 246 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 244 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 244 transition count 567
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 241 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 241 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 241 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 235 transition count 557
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 235 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 234 transition count 556
Applied a total of 43 rules in 34 ms. Remains 234 /255 variables (removed 21) and now considering 556/578 (removed 22) transitions.
// Phase 1: matrix 556 rows 234 cols
[2025-05-29 18:56:09] [INFO ] Computed 29 invariants in 3 ms
[2025-05-29 18:56:10] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-29 18:56:10] [INFO ] Invariant cache hit.
[2025-05-29 18:56:10] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 234/440 places, 556/717 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1495 ms. Remains : 234/440 places, 556/717 transitions.
RANDOM walk for 4000000 steps (95753 resets) in 18336 ms. (218 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (4118 resets) in 825 ms. (484 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (3978 resets) in 828 ms. (482 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (4008 resets) in 845 ms. (472 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (4028 resets) in 829 ms. (481 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (4038 resets) in 830 ms. (481 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (4061 resets) in 835 ms. (478 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (4033 resets) in 821 ms. (486 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (4091 resets) in 830 ms. (481 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (3974 resets) in 836 ms. (477 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4065 resets) in 828 ms. (482 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3982 resets) in 837 ms. (477 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4026 resets) in 838 ms. (476 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4060 resets) in 833 ms. (479 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3974 resets) in 1107 ms. (361 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3930 resets) in 789 ms. (506 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4032 resets) in 756 ms. (528 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4025 resets) in 763 ms. (523 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 1518719 steps, run visited all 17 properties in 5321 ms. (steps per millisecond=285 )
Probabilistic random walk after 1518719 steps, saw 610223 distinct states, run finished after 5325 ms. (steps per millisecond=285 ) properties seen :17
Able to resolve query StableMarking after proving 559 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 206836 ms.
ITS solved all properties within timeout

BK_STOP 1748544988236

--------------------
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 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="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r014-tall-174853743500188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;