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.r098-smll-174860112300238.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 FireWire-PT-18, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112300238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 168K 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 1748684294884

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 09:38:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 09:38:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:38:18] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2025-05-31 09:38:18] [INFO ] Transformed 437 places.
[2025-05-31 09:38:18] [INFO ] Transformed 707 transitions.
[2025-05-31 09:38:18] [INFO ] Found NUPN structural information;
[2025-05-31 09:38:18] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 753 ms.
Graph (trivial) has 325 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 14 ms
Free SCC test removed 9 places
Structural test allowed to assert that 66 places are NOT stable. Took 45 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (644 resets) in 3409 ms. (11 steps per ms) remains 260/371 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 401 steps (8 resets) in 17 ms. (22 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
[2025-05-31 09:38:19] [INFO ] Flow matrix only has 695 transitions (discarded 2 similar events)
// Phase 1: matrix 695 rows 428 cols
[2025-05-31 09:38:19] [INFO ] Computed 9 invariants in 20 ms
[2025-05-31 09:38:19] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: ((s4 (/ 1.0 2.0))
(s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s86 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s88 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s139 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s145 (/ 1.0 2.0))
(s146 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s154 (/ 1.0 2.0))
(s155 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s188 (/ 1.0 2.0))
(s189 (/ 1.0 2.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 260/1123 variables, and 260 constraints, problems are : Problem set: 0 solved, 260 unsolved in 5104 ms.
Refiners :[Domain max(s): 260/428 constraints, Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/428 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 168/428 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 168/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-31 09:38:28] [INFO ] Deduced a trap composed of 244 places in 564 ms of which 68 ms to minimize.
[2025-05-31 09:38:28] [INFO ] Deduced a trap composed of 53 places in 357 ms of which 7 ms to minimize.
[2025-05-31 09:38:29] [INFO ] Deduced a trap composed of 132 places in 294 ms of which 5 ms to minimize.
[2025-05-31 09:38:29] [INFO ] Deduced a trap composed of 127 places in 271 ms of which 5 ms to minimize.
[2025-05-31 09:38:29] [INFO ] Deduced a trap composed of 89 places in 258 ms of which 5 ms to minimize.
[2025-05-31 09:38:30] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 4 ms to minimize.
[2025-05-31 09:38:30] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 4 ms to minimize.
SMT process timed out in 10477ms, After SMT, problems are : Problem set: 0 solved, 260 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 260 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 697/697 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 424 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 424 transition count 652
Reduce places removed 42 places and 0 transitions.
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 1 with 44 rules applied. Total rules applied 90 place count 382 transition count 650
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 381 transition count 650
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 91 place count 381 transition count 643
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 105 place count 374 transition count 643
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 115 place count 364 transition count 633
Iterating global reduction 3 with 10 rules applied. Total rules applied 125 place count 364 transition count 633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 364 transition count 631
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 363 transition count 611
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 363 transition count 611
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 169 place count 343 transition count 591
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 185 place count 335 transition count 610
Free-agglomeration rule applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 202 place count 335 transition count 593
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 221 place count 318 transition count 591
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 318 transition count 589
Applied a total of 223 rules in 230 ms. Remains 318 /428 variables (removed 110) and now considering 589/697 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 318/428 places, 589/697 transitions.
RANDOM walk for 4000000 steps (232849 resets) in 59877 ms. (66 steps per ms) remains 123/260 properties
BEST_FIRST walk for 40003 steps (537 resets) in 141 ms. (281 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (523 resets) in 119 ms. (333 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (518 resets) in 123 ms. (322 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (521 resets) in 119 ms. (333 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (523 resets) in 116 ms. (341 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (529 resets) in 118 ms. (336 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (517 resets) in 125 ms. (317 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (534 resets) in 120 ms. (330 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (547 resets) in 119 ms. (333 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (520 resets) in 119 ms. (333 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (514 resets) in 124 ms. (320 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (498 resets) in 120 ms. (330 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (508 resets) in 119 ms. (333 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (515 resets) in 117 ms. (339 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (509 resets) in 126 ms. (314 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (523 resets) in 126 ms. (314 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (506 resets) in 115 ms. (344 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (534 resets) in 117 ms. (338 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (512 resets) in 123 ms. (322 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (490 resets) in 117 ms. (339 steps per ms) remains 121/123 properties
BEST_FIRST walk for 40003 steps (509 resets) in 252 ms. (158 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (532 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (519 resets) in 122 ms. (325 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (515 resets) in 115 ms. (344 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (525 resets) in 113 ms. (350 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (516 resets) in 113 ms. (350 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (524 resets) in 127 ms. (312 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (546 resets) in 122 ms. (325 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (532 resets) in 136 ms. (291 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (537 resets) in 167 ms. (238 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (519 resets) in 167 ms. (238 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (529 resets) in 174 ms. (228 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (517 resets) in 169 ms. (235 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (513 resets) in 169 ms. (235 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (519 resets) in 168 ms. (236 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (517 resets) in 177 ms. (224 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (530 resets) in 170 ms. (233 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (478 resets) in 169 ms. (235 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (530 resets) in 169 ms. (235 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (527 resets) in 173 ms. (229 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (513 resets) in 131 ms. (303 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (543 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (532 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (514 resets) in 123 ms. (322 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (504 resets) in 118 ms. (336 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (531 resets) in 115 ms. (344 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (543 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (525 resets) in 123 ms. (322 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (509 resets) in 117 ms. (338 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (529 resets) in 119 ms. (333 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (527 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (536 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (521 resets) in 121 ms. (327 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (537 resets) in 118 ms. (336 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (523 resets) in 118 ms. (336 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (528 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (536 resets) in 127 ms. (312 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (522 resets) in 118 ms. (336 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (535 resets) in 117 ms. (338 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (525 resets) in 121 ms. (327 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (506 resets) in 123 ms. (322 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (522 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (508 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (514 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (502 resets) in 121 ms. (327 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (536 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (537 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (525 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (536 resets) in 121 ms. (327 steps per ms) remains 121/121 properties
[2025-05-31 09:38:48] [INFO ] Flow matrix only has 586 transitions (discarded 3 similar events)
// Phase 1: matrix 586 rows 318 cols
[2025-05-31 09:38:48] [INFO ] Computed 7 invariants in 5 ms
[2025-05-31 09:38:48] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 167/288 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 22/310 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 585/895 variables, 310/317 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/895 variables, 28/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/895 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 9/904 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/904 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/904 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 904/904 variables, and 353 constraints, problems are : Problem set: 0 solved, 121 unsolved in 19015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 318/318 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 167/288 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 09:39:08] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 4 ms to minimize.
[2025-05-31 09:39:08] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2025-05-31 09:39:08] [INFO ] Deduced a trap composed of 104 places in 71 ms of which 2 ms to minimize.
[2025-05-31 09:39:08] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2025-05-31 09:39:08] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2025-05-31 09:39:09] [INFO ] Deduced a trap composed of 103 places in 83 ms of which 2 ms to minimize.
[2025-05-31 09:39:09] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 2 ms to minimize.
[2025-05-31 09:39:09] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 3 ms to minimize.
[2025-05-31 09:39:09] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2025-05-31 09:39:09] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 2 ms to minimize.
[2025-05-31 09:39:09] [INFO ] Deduced a trap composed of 105 places in 77 ms of which 2 ms to minimize.
[2025-05-31 09:39:10] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 09:39:10] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2025-05-31 09:39:10] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 2 ms to minimize.
[2025-05-31 09:39:11] [INFO ] Deduced a trap composed of 123 places in 83 ms of which 3 ms to minimize.
[2025-05-31 09:39:11] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 1 ms to minimize.
[2025-05-31 09:39:11] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 22/310 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 09:39:13] [INFO ] Deduced a trap composed of 24 places in 342 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 585/895 variables, 310/335 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 28/363 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 121/484 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 09:39:20] [INFO ] Deduced a trap composed of 145 places in 278 ms of which 5 ms to minimize.
[2025-05-31 09:39:21] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
[2025-05-31 09:39:21] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2025-05-31 09:39:21] [INFO ] Deduced a trap composed of 62 places in 354 ms of which 8 ms to minimize.
[2025-05-31 09:39:24] [INFO ] Deduced a trap composed of 199 places in 340 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/895 variables, 5/489 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 09:39:30] [INFO ] Deduced a trap composed of 100 places in 268 ms of which 4 ms to minimize.
[2025-05-31 09:39:31] [INFO ] Deduced a trap composed of 85 places in 228 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/895 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 09:39:38] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/895 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/895 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 9/904 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/904 variables, and 500 constraints, problems are : Problem set: 0 solved, 121 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 318/318 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 26/26 constraints]
After SMT, in 64093ms problems are : Problem set: 0 solved, 121 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 589/589 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 318 transition count 553
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 282 transition count 553
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 72 place count 282 transition count 551
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 76 place count 280 transition count 551
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 87 place count 269 transition count 537
Iterating global reduction 2 with 11 rules applied. Total rules applied 98 place count 269 transition count 537
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 123 place count 269 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 267 transition count 508
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 267 transition count 508
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 265 transition count 506
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 265 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 4 rules applied. Total rules applied 135 place count 265 transition count 502
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 263 transition count 502
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 175 place count 244 transition count 483
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 177 place count 244 transition count 481
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 207 place count 229 transition count 538
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 211 place count 229 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 7 with 74 rules applied. Total rules applied 285 place count 229 transition count 460
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 289 place count 229 transition count 456
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 293 place count 225 transition count 456
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 296 place count 225 transition count 590
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 299 place count 222 transition count 590
Applied a total of 299 rules in 150 ms. Remains 222 /318 variables (removed 96) and now considering 590/589 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 222/318 places, 590/589 transitions.
RANDOM walk for 4000000 steps (165721 resets) in 38505 ms. (103 steps per ms) remains 54/121 properties
BEST_FIRST walk for 400004 steps (4365 resets) in 877 ms. (455 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4356 resets) in 872 ms. (458 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4418 resets) in 857 ms. (466 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4340 resets) in 870 ms. (459 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4391 resets) in 874 ms. (457 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4385 resets) in 873 ms. (457 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4391 resets) in 891 ms. (448 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4397 resets) in 865 ms. (461 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4373 resets) in 920 ms. (434 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4399 resets) in 881 ms. (453 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4362 resets) in 878 ms. (455 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4362 resets) in 870 ms. (459 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4384 resets) in 868 ms. (460 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4370 resets) in 905 ms. (441 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4369 resets) in 918 ms. (435 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4386 resets) in 904 ms. (441 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4401 resets) in 901 ms. (443 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4389 resets) in 904 ms. (441 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4412 resets) in 914 ms. (437 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4385 resets) in 907 ms. (440 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4357 resets) in 907 ms. (440 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4349 resets) in 883 ms. (452 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4389 resets) in 895 ms. (446 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4360 resets) in 907 ms. (440 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4360 resets) in 899 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4381 resets) in 898 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4374 resets) in 914 ms. (437 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (4377 resets) in 900 ms. (443 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4373 resets) in 898 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4371 resets) in 876 ms. (456 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4356 resets) in 888 ms. (449 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4336 resets) in 886 ms. (450 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (4360 resets) in 879 ms. (454 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4381 resets) in 879 ms. (454 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (4380 resets) in 886 ms. (450 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4382 resets) in 880 ms. (454 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4371 resets) in 985 ms. (405 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (4395 resets) in 883 ms. (452 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400002 steps (4426 resets) in 877 ms. (455 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4349 resets) in 892 ms. (447 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4406 resets) in 880 ms. (454 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (4387 resets) in 879 ms. (454 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4359 resets) in 882 ms. (453 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (4366 resets) in 887 ms. (450 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (4378 resets) in 872 ms. (458 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (4360 resets) in 880 ms. (454 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4388 resets) in 956 ms. (417 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4386 resets) in 888 ms. (449 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (4390 resets) in 876 ms. (456 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4373 resets) in 985 ms. (405 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400001 steps (4379 resets) in 893 ms. (447 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (4400 resets) in 890 ms. (448 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (4354 resets) in 876 ms. (456 steps per ms) remains 53/53 properties
[2025-05-31 09:40:15] [INFO ] Flow matrix only has 561 transitions (discarded 29 similar events)
// Phase 1: matrix 561 rows 222 cols
[2025-05-31 09:40:15] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:40:15] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 123/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 33/209 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 556/765 variables, 209/216 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 71/287 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 16/781 variables, 11/298 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/781 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 2/783 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/783 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 783/783 variables, and 300 constraints, problems are : Problem set: 0 solved, 53 unsolved in 6725 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 222/222 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 123/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 33/209 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-31 09:40:23] [INFO ] Deduced a trap composed of 126 places in 305 ms of which 4 ms to minimize.
[2025-05-31 09:40:23] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 4 ms to minimize.
[2025-05-31 09:40:23] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2025-05-31 09:40:23] [INFO ] Deduced a trap composed of 124 places in 233 ms of which 4 ms to minimize.
[2025-05-31 09:40:24] [INFO ] Deduced a trap composed of 127 places in 267 ms of which 4 ms to minimize.
[2025-05-31 09:40:24] [INFO ] Deduced a trap composed of 84 places in 274 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 556/765 variables, 209/222 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 71/293 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 53/346 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-31 09:40:26] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 3 ms to minimize.
[2025-05-31 09:40:27] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 4 ms to minimize.
[2025-05-31 09:40:27] [INFO ] Deduced a trap composed of 29 places in 257 ms of which 3 ms to minimize.
[2025-05-31 09:40:27] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/765 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-31 09:40:30] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/765 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/765 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 16/781 variables, 11/362 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/781 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 2/783 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/783 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (OVERLAPS) 0/783 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 783/783 variables, and 364 constraints, problems are : Problem set: 0 solved, 53 unsolved in 19963 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 222/222 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 11/11 constraints]
After SMT, in 26727ms problems are : Problem set: 0 solved, 53 unsolved
Parikh walk visited 0 properties in 6671 ms.
Support contains 53 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 590/590 transitions.
Graph (complete) has 950 edges and 222 vertex of which 220 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 220 transition count 584
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 216 transition count 584
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 25 place count 202 transition count 570
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 202 transition count 570
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 47 place count 194 transition count 562
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 194 transition count 562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 193 transition count 560
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 193 transition count 560
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 179 transition count 546
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 176 transition count 543
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 176 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 176 transition count 542
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 172 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 172 transition count 534
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 172 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 169 transition count 531
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 169 transition count 531
Applied a total of 120 rules in 112 ms. Remains 169 /222 variables (removed 53) and now considering 531/590 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 169/222 places, 531/590 transitions.
RANDOM walk for 4000000 steps (165647 resets) in 30028 ms. (133 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (4391 resets) in 856 ms. (466 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4401 resets) in 854 ms. (467 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4344 resets) in 860 ms. (464 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4367 resets) in 855 ms. (467 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4397 resets) in 911 ms. (438 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4392 resets) in 882 ms. (453 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4384 resets) in 882 ms. (453 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4363 resets) in 891 ms. (448 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4418 resets) in 888 ms. (449 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4388 resets) in 860 ms. (464 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4402 resets) in 856 ms. (466 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4421 resets) in 849 ms. (470 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4374 resets) in 842 ms. (474 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4395 resets) in 844 ms. (473 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4348 resets) in 851 ms. (469 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (4379 resets) in 942 ms. (424 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4415 resets) in 866 ms. (461 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400004 steps (4364 resets) in 882 ms. (453 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (4379 resets) in 888 ms. (449 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (4374 resets) in 875 ms. (456 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (4381 resets) in 885 ms. (451 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (4401 resets) in 876 ms. (456 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (4355 resets) in 883 ms. (452 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (4410 resets) in 879 ms. (454 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (4390 resets) in 877 ms. (455 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (4389 resets) in 879 ms. (454 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (4330 resets) in 880 ms. (454 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (4328 resets) in 885 ms. (451 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (4358 resets) in 882 ms. (453 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (4401 resets) in 882 ms. (453 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (4395 resets) in 840 ms. (475 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (4416 resets) in 850 ms. (470 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (4428 resets) in 842 ms. (474 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (4372 resets) in 850 ms. (470 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (4416 resets) in 848 ms. (471 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (4423 resets) in 856 ms. (466 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (4400 resets) in 856 ms. (466 steps per ms) remains 48/51 properties
BEST_FIRST walk for 400003 steps (4446 resets) in 827 ms. (483 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4394 resets) in 831 ms. (480 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4363 resets) in 908 ms. (440 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4364 resets) in 819 ms. (487 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400001 steps (4396 resets) in 825 ms. (484 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4398 resets) in 823 ms. (485 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400000 steps (4365 resets) in 817 ms. (488 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4349 resets) in 1211 ms. (330 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4427 resets) in 1165 ms. (343 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4394 resets) in 1332 ms. (300 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4396 resets) in 1299 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4397 resets) in 1356 ms. (294 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4416 resets) in 1250 ms. (319 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (4350 resets) in 1310 ms. (305 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4404 resets) in 1240 ms. (322 steps per ms) remains 48/48 properties
[2025-05-31 09:41:11] [INFO ] Flow matrix only has 502 transitions (discarded 29 similar events)
// Phase 1: matrix 502 rows 169 cols
[2025-05-31 09:41:11] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:41:11] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 82/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 29/159 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 502/661 variables, 159/166 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 71/237 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 10/671 variables, 10/247 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/671 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 247 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2859 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 169/169 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 82/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 29/159 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2025-05-31 09:41:15] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2025-05-31 09:41:15] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2025-05-31 09:41:15] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2025-05-31 09:41:15] [INFO ] Deduced a trap composed of 88 places in 238 ms of which 3 ms to minimize.
[2025-05-31 09:41:15] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 3 ms to minimize.
[2025-05-31 09:41:16] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2025-05-31 09:41:16] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 502/661 variables, 159/173 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 71/244 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 48/292 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2025-05-31 09:41:18] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 3 ms to minimize.
[2025-05-31 09:41:18] [INFO ] Deduced a trap composed of 89 places in 225 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2025-05-31 09:41:19] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 10/671 variables, 10/305 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/671 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (OVERLAPS) 0/671 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 305 constraints, problems are : Problem set: 0 solved, 48 unsolved in 10545 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 169/169 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 10/10 constraints]
After SMT, in 13427ms problems are : Problem set: 0 solved, 48 unsolved
Parikh walk visited 0 properties in 7835 ms.
Support contains 48 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 531/531 transitions.
Graph (complete) has 857 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 166 transition count 529
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 164 transition count 521
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 164 transition count 521
Applied a total of 9 rules in 23 ms. Remains 164 /169 variables (removed 5) and now considering 521/531 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 164/169 places, 521/531 transitions.
RANDOM walk for 4000000 steps (165590 resets) in 38523 ms. (103 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4366 resets) in 1445 ms. (276 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4382 resets) in 1304 ms. (306 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4372 resets) in 1483 ms. (269 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4362 resets) in 1526 ms. (261 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4428 resets) in 1375 ms. (290 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (4387 resets) in 1257 ms. (317 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (4399 resets) in 1325 ms. (301 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4405 resets) in 1292 ms. (309 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4394 resets) in 1378 ms. (290 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4432 resets) in 1297 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (4402 resets) in 1291 ms. (309 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4383 resets) in 1511 ms. (264 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4361 resets) in 1501 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4384 resets) in 1240 ms. (322 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4377 resets) in 1454 ms. (274 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4362 resets) in 1315 ms. (303 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (4375 resets) in 1330 ms. (300 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (4351 resets) in 1603 ms. (249 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4402 resets) in 1279 ms. (312 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4389 resets) in 1492 ms. (267 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4392 resets) in 1317 ms. (303 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (4378 resets) in 1268 ms. (315 steps per ms) remains 46/48 properties
BEST_FIRST walk for 400001 steps (4400 resets) in 1373 ms. (291 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (4400 resets) in 1175 ms. (340 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4403 resets) in 1324 ms. (301 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4370 resets) in 1259 ms. (317 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4385 resets) in 1383 ms. (289 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (4382 resets) in 1225 ms. (326 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4384 resets) in 1332 ms. (300 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (4392 resets) in 1320 ms. (302 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (4410 resets) in 1531 ms. (261 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (4383 resets) in 1322 ms. (302 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4397 resets) in 1355 ms. (294 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (4366 resets) in 1523 ms. (262 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (4365 resets) in 1214 ms. (329 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4351 resets) in 1310 ms. (305 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4364 resets) in 1525 ms. (262 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (4387 resets) in 1435 ms. (278 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4395 resets) in 1106 ms. (361 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (4399 resets) in 1198 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400001 steps (4398 resets) in 1232 ms. (324 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400001 steps (4386 resets) in 1208 ms. (330 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4408 resets) in 1446 ms. (276 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4356 resets) in 1133 ms. (352 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4382 resets) in 1329 ms. (300 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (4401 resets) in 1319 ms. (303 steps per ms) remains 46/46 properties
Finished probabilistic random walk after 4103979 steps, run visited all 46 properties in 41154 ms. (steps per millisecond=99 )
Probabilistic random walk after 4103979 steps, saw 1134817 distinct states, run finished after 41161 ms. (steps per millisecond=99 ) properties seen :46
Able to resolve query StableMarking after proving 373 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 277638 ms.
ITS solved all properties within timeout

BK_STOP 1748684575300

--------------------
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="FireWire-PT-18"
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 FireWire-PT-18, 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 r098-smll-174860112300238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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