fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r098-smll-174860112300228
Last Updated
June 24, 2025

About the Execution of 2024-gold for FireWire-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15690.470 139832.00 329249.00 504.90 F normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 84K 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 1748683902171

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 09:31:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 09:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:31:45] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-05-31 09:31:45] [INFO ] Transformed 254 places.
[2025-05-31 09:31:45] [INFO ] Transformed 368 transitions.
[2025-05-31 09:31:45] [INFO ] Found NUPN structural information;
[2025-05-31 09:31:45] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 443 ms.
Graph (trivial) has 218 edges and 254 vertex of which 19 / 254 are part of one of the 3 SCC in 7 ms
Free SCC test removed 16 places
Structural test allowed to assert that 59 places are NOT stable. Took 47 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (1072 resets) in 4031 ms. (9 steps per ms) remains 131/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 21 ms. (18 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 34 ms. (11 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
[2025-05-31 09:31:47] [INFO ] Flow matrix only has 349 transitions (discarded 2 similar events)
// Phase 1: matrix 349 rows 238 cols
[2025-05-31 09:31:47] [INFO ] Computed 5 invariants in 32 ms
[2025-05-31 09:31:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 80/211 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 80/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 27/238 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 (/ 1.0 184.0))
(s5 (/ 1.0 184.0))
(s6 (/ 1.0 184.0))
(s7 0.0)
(s8 0.0)
(s9 (/ 1.0 184.0))
(s10 (/ 1.0 184.0))
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 (/ 1.0 184.0))
(s16 (/ 1.0 184.0))
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 (/ 1.0 184.0))
(s24 (/ 1.0 184.0))
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 (/ 1.0 184.0))
(s38 (/ 1.0 184.0))
(s39 (/ 1.0 184.0))
(s40 (/ 1.0 184.0))
(s41 (/ 1.0 184.0))
(s42 0.0)
(s43 (/ 1.0 184.0))
(s44 (/ 1.0 184.0))
(s45 (/ 1.0 184.0))
(s46 0.0)
(s47 0.0)
(s48 (/ 1.0 184.0))
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 (/ 1.0 184.0))
(s57 (/ 1.0 184.0))
(s58 (/ 1.0 184.0))
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 (/ 163.0 184.0))
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 (/ 1.0 184.0))
(s70 (/ 1.0 184.0))
(s71 (/ 1.0 184.0))
(s72 (/ 1.0 184.0))
(s73 (/ 1.0 184.0))
(s74 (/ 1.0 184.0))
(s75 (/ 1.0 184.0))
(s76 (/ 1.0 184.0))
(s77 (/ 1.0 184.0))
(s78 (/ 1.0 184.0))
(s79 (/ 1.0 184.0))
(s80 (/ 1.0 184.0))
(s81 (/ 1.0 184.0))
(s82 (/ 1.0 184.0))
(s83 (/ 1.0 184.0))
(s84 (/ 1.0 184.0))
(s85 (/ 1.0 184.0))
(s86 (/ 1.0 184.0))
(s87 (/ 1.0 184.0))
(s88 (/ 1.0 184.0))
(s89 (/ 1.0 184.0))
(s90 (/ 1.0 184.0))
(s91 (/ 1.0 184.0))
(s92 (/ 1.0 184.0))
(s93 (/ 1.0 184.0))
(s94 (/ 1.0 184.0))
(s95 (/ 1.0 184.0))
(s96 (/ 1.0 184.0))
(s97 (/ 1.0 184.0))
(s98 (/ 1.0 184.0))
(s99 (/ 1.0 184.0))
(s100 (/ 1.0 184.0))
(s101 (/ 1.0 184.0))
(s102 (/ 1.0 184.0))
(s103 (/ 1.0 184.0))
(s104 (/ 1.0 184.0))
(s105 (/ 1.0 184.0))
(s106 (/ 1.0 184.0))
(s107 (/ 1.0 184.0))
(s108 (/ 1.0 184.0))
(s109 (/ 1.0 184.0))
(s110 (/ 1.0 184.0))
(s111 (/ 1.0 184.0))
(s112 (/ 1.0 184.0))
(s113 (/ 1.0 184.0))
(s114 (/ 1.0 184.0))
(s115 (/ 1.0 184.0))
(s116 (/ 1.0 184.0))
(s117 (/ 1.0 184.0))
(s118 (/ 1.0 184.0))
(s119 (/ 1.0 184.0))
(s120 (/ 1.0 184.0))
(s121 (/ 1.0 184.0))
(s122 (/ 1.0 184.0))
(s123 (/ 1.0 184.0))
(s124 (/ 1.0 184.0))
(s125 (/ 1.0 184.0))
(s126 (/ 1.0 184.0))
(s127 0.0)
(s128 (/ 1.0 184.0))
(s129 (/ 1.0 184.0))
(s130 (/ 1.0 184.0))
(s131 (/ 1.0 184.0))
(s132 (/ 1.0 184.0))
(s133 (/ 1.0 184.0))
(s134 (/ 1.0 184.0))
(s135 (/ 1.0 184.0))
(s136 (/ 1.0 184.0))
(s137 (/ 1.0 184.0))
(s138 (/ 1.0 184.0))
(s139 (/ 1.0 184.0))
(s140 (/ 1.0 184.0))
(s141 (/ 1.0 184.0))
(s142 (/ 1.0 184.0))
(s143 (/ 1.0 184.0))
(s144 (/ 1.0 184.0))
(s145 (/ 1.0 184.0))
(s146 (/ 1.0 184.0))
(s147 (/ 1.0 184.0))
(s148 (/ 1.0 184.0))
(s149 (/ 1.0 184.0))
(s150 (/ 1.0 184.0))
(s151 (/ 1.0 184.0))
(s152 (/ 1.0 184.0))
(s153 (/ 1.0 184.0))
(s154 (/ 1.0 184.0))
(s155 (/ 1.0 184.0))
(s156 (/ 1.0 184.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 184.0))
(s159 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/587 variables, and 243 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5076 ms.
Refiners :[Domain max(s): 238/238 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/238 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 80/211 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 80/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 09:31:53] [INFO ] Deduced a trap composed of 89 places in 300 ms of which 47 ms to minimize.
[2025-05-31 09:31:54] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 4 ms to minimize.
[2025-05-31 09:31:54] [INFO ] Deduced a trap composed of 99 places in 196 ms of which 5 ms to minimize.
[2025-05-31 09:31:54] [INFO ] Deduced a trap composed of 113 places in 179 ms of which 4 ms to minimize.
[2025-05-31 09:31:54] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 4 ms to minimize.
[2025-05-31 09:31:55] [INFO ] Deduced a trap composed of 99 places in 186 ms of which 4 ms to minimize.
[2025-05-31 09:31:55] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 4 ms to minimize.
[2025-05-31 09:31:55] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 4 ms to minimize.
[2025-05-31 09:31:55] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 4 ms to minimize.
[2025-05-31 09:31:56] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 3 ms to minimize.
[2025-05-31 09:31:56] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 11/226 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 09:31:57] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2025-05-31 09:31:57] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 10284ms, After SMT, problems are : Problem set: 0 solved, 131 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 351/351 transitions.
Graph (complete) has 581 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 235 transition count 306
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 44 rules applied. Total rules applied 90 place count 194 transition count 303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 192 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 92 place count 192 transition count 300
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 189 transition count 300
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 185 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 185 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 185 transition count 295
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 135 place count 171 transition count 281
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 145 place count 166 transition count 283
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 166 transition count 275
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 161 place count 158 transition count 275
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 158 transition count 275
Applied a total of 162 rules in 133 ms. Remains 158 /238 variables (removed 80) and now considering 275/351 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 158/238 places, 275/351 transitions.
RANDOM walk for 4000000 steps (452654 resets) in 42392 ms. (94 steps per ms) remains 104/131 properties
BEST_FIRST walk for 40004 steps (1418 resets) in 158 ms. (251 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1412 resets) in 204 ms. (195 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (1420 resets) in 204 ms. (195 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (1430 resets) in 237 ms. (168 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1432 resets) in 266 ms. (149 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1427 resets) in 190 ms. (209 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1444 resets) in 185 ms. (215 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1441 resets) in 198 ms. (201 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40000 steps (1410 resets) in 187 ms. (212 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1429 resets) in 188 ms. (211 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (1423 resets) in 181 ms. (219 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1443 resets) in 182 ms. (218 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1437 resets) in 256 ms. (155 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1418 resets) in 126 ms. (314 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1420 resets) in 125 ms. (317 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1439 resets) in 120 ms. (330 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1428 resets) in 121 ms. (327 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1456 resets) in 125 ms. (317 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1431 resets) in 122 ms. (325 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1449 resets) in 139 ms. (285 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1424 resets) in 191 ms. (208 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (1440 resets) in 122 ms. (325 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (1423 resets) in 125 ms. (317 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (1430 resets) in 132 ms. (300 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1427 resets) in 158 ms. (251 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1419 resets) in 160 ms. (248 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (1447 resets) in 164 ms. (242 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1423 resets) in 218 ms. (182 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (1436 resets) in 166 ms. (239 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1424 resets) in 159 ms. (250 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (1439 resets) in 172 ms. (231 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1437 resets) in 163 ms. (243 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1427 resets) in 157 ms. (253 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1420 resets) in 163 ms. (243 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1426 resets) in 165 ms. (240 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (1404 resets) in 173 ms. (229 steps per ms) remains 100/104 properties
BEST_FIRST walk for 40003 steps (1433 resets) in 160 ms. (248 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1422 resets) in 171 ms. (232 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1443 resets) in 162 ms. (245 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1420 resets) in 164 ms. (242 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1442 resets) in 163 ms. (243 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1431 resets) in 162 ms. (245 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1411 resets) in 169 ms. (235 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40000 steps (1427 resets) in 173 ms. (229 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1412 resets) in 179 ms. (222 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1431 resets) in 198 ms. (201 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1448 resets) in 173 ms. (229 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1450 resets) in 181 ms. (219 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1431 resets) in 184 ms. (216 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1441 resets) in 194 ms. (205 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1423 resets) in 181 ms. (219 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1430 resets) in 170 ms. (233 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1405 resets) in 184 ms. (216 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1430 resets) in 164 ms. (242 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1423 resets) in 163 ms. (243 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1435 resets) in 161 ms. (246 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1434 resets) in 160 ms. (248 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1430 resets) in 172 ms. (231 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1408 resets) in 161 ms. (246 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1427 resets) in 160 ms. (248 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40001 steps (1401 resets) in 162 ms. (245 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1438 resets) in 168 ms. (236 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1421 resets) in 161 ms. (246 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1416 resets) in 154 ms. (258 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1444 resets) in 150 ms. (264 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1456 resets) in 160 ms. (248 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1437 resets) in 154 ms. (258 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1416 resets) in 150 ms. (264 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1402 resets) in 151 ms. (263 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1433 resets) in 159 ms. (250 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1405 resets) in 163 ms. (243 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1417 resets) in 151 ms. (263 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1434 resets) in 153 ms. (259 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1428 resets) in 150 ms. (264 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1414 resets) in 171 ms. (232 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1417 resets) in 181 ms. (219 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1438 resets) in 147 ms. (270 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1432 resets) in 142 ms. (279 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (1437 resets) in 145 ms. (273 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40001 steps (1423 resets) in 175 ms. (227 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1437 resets) in 153 ms. (259 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1446 resets) in 162 ms. (245 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1432 resets) in 149 ms. (266 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (1419 resets) in 250 ms. (159 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (1449 resets) in 135 ms. (294 steps per ms) remains 100/100 properties
// Phase 1: matrix 275 rows 158 cols
[2025-05-31 09:32:12] [INFO ] Computed 4 invariants in 4 ms
[2025-05-31 09:32:12] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 56/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 275/431 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 2/433 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/433 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 165 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7710 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 56/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 09:32:21] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 3 ms to minimize.
[2025-05-31 09:32:21] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2025-05-31 09:32:21] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2025-05-31 09:32:21] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2025-05-31 09:32:21] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
[2025-05-31 09:32:22] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 2 ms to minimize.
[2025-05-31 09:32:22] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2025-05-31 09:32:22] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 8 ms to minimize.
[2025-05-31 09:32:22] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 3 ms to minimize.
[2025-05-31 09:32:22] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2025-05-31 09:32:22] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 3 ms to minimize.
[2025-05-31 09:32:23] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 2 ms to minimize.
[2025-05-31 09:32:23] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 09:32:24] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 15 ms to minimize.
[2025-05-31 09:32:24] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2025-05-31 09:32:24] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2025-05-31 09:32:24] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 3 ms to minimize.
[2025-05-31 09:32:24] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 09:32:25] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2025-05-31 09:32:25] [INFO ] Deduced a trap composed of 104 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 09:32:26] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 09:32:27] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 275/431 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 100/285 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 09:32:30] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2025-05-31 09:32:31] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2025-05-31 09:32:31] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 2/433 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (OVERLAPS) 0/433 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 290 constraints, problems are : Problem set: 0 solved, 100 unsolved in 29215 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 25/25 constraints]
After SMT, in 36967ms problems are : Problem set: 0 solved, 100 unsolved
Parikh walk visited 43 properties in 24309 ms.
Support contains 57 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 275/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 158 transition count 257
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 140 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 140 transition count 256
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 139 transition count 256
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 133 transition count 250
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 133 transition count 250
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 70 place count 133 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 133 transition count 229
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 132 transition count 229
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 131 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 131 transition count 228
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 3 with 2 rules applied. Total rules applied 76 place count 131 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 130 transition count 226
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 91 place count 123 transition count 219
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 105 place count 116 transition count 244
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 109 place count 116 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 117 place count 116 transition count 232
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 124 place count 116 transition count 225
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 131 place count 109 transition count 225
Applied a total of 131 rules in 57 ms. Remains 109 /158 variables (removed 49) and now considering 225/275 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 109/158 places, 225/275 transitions.
RANDOM walk for 4000000 steps (452760 resets) in 24883 ms. (160 steps per ms) remains 55/57 properties
BEST_FIRST walk for 400003 steps (14264 resets) in 835 ms. (478 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (14257 resets) in 1480 ms. (270 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (14292 resets) in 825 ms. (484 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (14275 resets) in 829 ms. (481 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (14289 resets) in 841 ms. (475 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (14207 resets) in 827 ms. (483 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (14318 resets) in 814 ms. (490 steps per ms) remains 46/54 properties
BEST_FIRST walk for 400003 steps (14353 resets) in 771 ms. (518 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (14257 resets) in 808 ms. (494 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (14304 resets) in 761 ms. (524 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400001 steps (14315 resets) in 767 ms. (520 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (14389 resets) in 768 ms. (520 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400004 steps (14332 resets) in 768 ms. (520 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (14323 resets) in 818 ms. (488 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (14339 resets) in 753 ms. (530 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (14255 resets) in 769 ms. (519 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (14349 resets) in 766 ms. (521 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (14237 resets) in 785 ms. (508 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (14347 resets) in 768 ms. (520 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (14254 resets) in 770 ms. (518 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (14281 resets) in 892 ms. (447 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400002 steps (14271 resets) in 754 ms. (529 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14314 resets) in 757 ms. (527 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (14302 resets) in 742 ms. (538 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14278 resets) in 758 ms. (527 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (14288 resets) in 766 ms. (521 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14247 resets) in 793 ms. (503 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14272 resets) in 776 ms. (514 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (14323 resets) in 794 ms. (503 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14298 resets) in 1047 ms. (381 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14307 resets) in 982 ms. (406 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (14263 resets) in 748 ms. (534 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (14354 resets) in 903 ms. (442 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14331 resets) in 760 ms. (525 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14308 resets) in 750 ms. (532 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (14331 resets) in 751 ms. (531 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (14301 resets) in 766 ms. (521 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (14320 resets) in 764 ms. (522 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (14294 resets) in 763 ms. (523 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400001 steps (14250 resets) in 742 ms. (538 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (14301 resets) in 905 ms. (441 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (14262 resets) in 742 ms. (538 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (14321 resets) in 754 ms. (529 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (14258 resets) in 762 ms. (524 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (14262 resets) in 743 ms. (537 steps per ms) remains 43/43 properties
[2025-05-31 09:33:31] [INFO ] Flow matrix only has 213 transitions (discarded 12 similar events)
// Phase 1: matrix 213 rows 109 cols
[2025-05-31 09:33:31] [INFO ] Computed 4 invariants in 2 ms
[2025-05-31 09:33:31] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 60/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 213/320 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 18/129 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 2/322 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 131 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 60/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:34] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2025-05-31 09:33:34] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 4 ms to minimize.
[2025-05-31 09:33:34] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 4 ms to minimize.
[2025-05-31 09:33:34] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2025-05-31 09:33:34] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2025-05-31 09:33:35] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2025-05-31 09:33:35] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:35] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:35] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:36] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:36] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:37] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2025-05-31 09:33:37] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 213/320 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 18/142 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 43/185 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:38] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:39] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 09:33:40] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2025-05-31 09:33:40] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 18 (OVERLAPS) 2/322 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/322 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 20 (OVERLAPS) 0/322 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 191 constraints, problems are : Problem set: 0 solved, 43 unsolved in 9733 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 17/17 constraints]
After SMT, in 11946ms problems are : Problem set: 0 solved, 43 unsolved
Parikh walk visited 0 properties in 2365 ms.
Support contains 43 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 225/225 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 109 transition count 220
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 104 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 102 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 16 place count 101 transition count 221
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 101 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 101 transition count 217
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 101 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 100 transition count 216
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 100 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 99 transition count 217
Applied a total of 24 rules in 48 ms. Remains 99 /109 variables (removed 10) and now considering 217/225 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 99/109 places, 217/225 transitions.
RANDOM walk for 4000000 steps (444547 resets) in 21707 ms. (184 steps per ms) remains 41/43 properties
BEST_FIRST walk for 400002 steps (14719 resets) in 802 ms. (498 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14734 resets) in 799 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14749 resets) in 803 ms. (497 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (14656 resets) in 801 ms. (498 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14745 resets) in 794 ms. (503 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (14698 resets) in 793 ms. (503 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (14648 resets) in 770 ms. (518 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14681 resets) in 771 ms. (518 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (14723 resets) in 770 ms. (518 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14708 resets) in 760 ms. (525 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14715 resets) in 1626 ms. (245 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14805 resets) in 750 ms. (532 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14724 resets) in 764 ms. (522 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14686 resets) in 771 ms. (518 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14673 resets) in 750 ms. (532 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (14690 resets) in 936 ms. (426 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14732 resets) in 750 ms. (532 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14706 resets) in 753 ms. (530 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (14729 resets) in 749 ms. (533 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14689 resets) in 753 ms. (530 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14730 resets) in 933 ms. (428 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14728 resets) in 755 ms. (529 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14729 resets) in 747 ms. (534 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14776 resets) in 753 ms. (530 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14659 resets) in 761 ms. (524 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (14725 resets) in 779 ms. (512 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14742 resets) in 783 ms. (510 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14692 resets) in 755 ms. (529 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14625 resets) in 752 ms. (531 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14752 resets) in 948 ms. (421 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14678 resets) in 942 ms. (424 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14676 resets) in 754 ms. (529 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14745 resets) in 750 ms. (532 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14727 resets) in 754 ms. (529 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (14683 resets) in 757 ms. (527 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14693 resets) in 753 ms. (530 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14713 resets) in 760 ms. (525 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14698 resets) in 762 ms. (524 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (14714 resets) in 749 ms. (533 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14679 resets) in 757 ms. (527 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (14712 resets) in 756 ms. (528 steps per ms) remains 41/41 properties
Finished probabilistic random walk after 19852 steps, run visited all 41 properties in 149 ms. (steps per millisecond=133 )
Probabilistic random walk after 19852 steps, saw 6151 distinct states, run finished after 158 ms. (steps per millisecond=125 ) properties seen :41
Able to resolve query StableMarking after proving 197 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 137047 ms.
ITS solved all properties within timeout

BK_STOP 1748684042003

--------------------
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-16"
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-16, 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-174860112300228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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