Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r014-tall-174853743400133.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 Anderson-PT-12, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.1M 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 1748544277200

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:44:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:44:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:44:38] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2025-05-29 18:44:38] [INFO ] Transformed 889 places.
[2025-05-29 18:44:38] [INFO ] Transformed 4152 transitions.
[2025-05-29 18:44:38] [INFO ] Found NUPN structural information;
[2025-05-29 18:44:38] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 318 ms.
RANDOM walk for 40000 steps (8 resets) in 3090 ms. (12 steps per ms) remains 124/889 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
// Phase 1: matrix 4152 rows 889 cols
[2025-05-29 18:44:40] [INFO ] Computed 27 invariants in 117 ms
[2025-05-29 18:44:40] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 749/873 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 749/886 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/873 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 16/889 variables, 14/900 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 16/916 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 60.0))
(s1 (/ 1.0 15.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 (/ 49.0 60.0))
(s7 (/ 1.0 12.0))
(s8 0.0)
(s9 (/ 1.0 60.0))
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 (/ 13.0 20.0))
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 (/ 1.0 60.0))
(s29 (/ 1.0 60.0))
(s30 (/ 1.0 60.0))
(s31 (/ 1.0 60.0))
(s32 (/ 1.0 60.0))
(s33 (/ 1.0 60.0))
(s34 (/ 1.0 60.0))
(s35 (/ 1.0 60.0))
(s36 (/ 13.0 60.0))
(s37 0.0)
(s38 0.0)
(s39 (/ 17.0 20.0))
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 (/ 4.0 5.0))
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 (/ 17.0 20.0))
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 (/ 17.0 20.0))
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 17.0 20.0))
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 (/ 1.0 60.0))
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 (/ 1.0 60.0))
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 (/ 1.0 2.0))
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 889/5041 variables, and 916 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5054 ms.
Refiners :[Domain max(s): 889/889 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/889 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 749/873 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 749/886 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/873 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 16/889 variables, 14/900 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 16/916 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2025-05-29 18:44:50] [INFO ] Deduced a trap composed of 389 places in 929 ms of which 217 ms to minimize.
SMT process timed out in 10568ms, After SMT, problems are : Problem set: 0 solved, 124 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 889 transition count 4130
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 867 transition count 4130
Discarding 153 places :
Symmetric choice reduction at 0 with 153 rule applications. Total rules 197 place count 714 transition count 1095
Iterating global reduction 0 with 153 rules applied. Total rules applied 350 place count 714 transition count 1095
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 568 place count 605 transition count 986
Applied a total of 568 rules in 256 ms. Remains 605 /889 variables (removed 284) and now considering 986/4152 (removed 3166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 605/889 places, 986/4152 transitions.
RANDOM walk for 4000000 steps (8 resets) in 39382 ms. (101 steps per ms) remains 91/124 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2477 ms. (161 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1813 ms. (220 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1758 ms. (227 steps per ms) remains 91/91 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1740 ms. (229 steps per ms) remains 90/91 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1733 ms. (230 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1733 ms. (230 steps per ms) remains 89/90 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1715 ms. (233 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1691 ms. (236 steps per ms) remains 87/89 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1666 ms. (239 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1681 ms. (237 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1690 ms. (236 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1703 ms. (234 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1699 ms. (235 steps per ms) remains 86/87 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1716 ms. (232 steps per ms) remains 85/86 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1703 ms. (234 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1691 ms. (236 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1670 ms. (239 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1680 ms. (237 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1692 ms. (236 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1717 ms. (232 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1701 ms. (235 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1673 ms. (238 steps per ms) remains 84/85 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1701 ms. (235 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1917 ms. (208 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2806 ms. (142 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2095 ms. (190 steps per ms) remains 82/84 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1659 ms. (240 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1685 ms. (237 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1673 ms. (238 steps per ms) remains 81/82 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1638 ms. (244 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1646 ms. (242 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1681 ms. (237 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1665 ms. (240 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1668 ms. (239 steps per ms) remains 80/81 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1639 ms. (243 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1671 ms. (239 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1659 ms. (240 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1640 ms. (243 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1637 ms. (244 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1655 ms. (241 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1666 ms. (239 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1648 ms. (242 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1655 ms. (241 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1666 ms. (239 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1652 ms. (241 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1686 ms. (237 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1649 ms. (242 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1669 ms. (239 steps per ms) remains 76/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1614 ms. (247 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1633 ms. (244 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1641 ms. (243 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1611 ms. (248 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1635 ms. (244 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1590 ms. (251 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1616 ms. (247 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1601 ms. (249 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1625 ms. (246 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1646 ms. (242 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1641 ms. (243 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1612 ms. (247 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1618 ms. (247 steps per ms) remains 75/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1587 ms. (251 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1608 ms. (248 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1608 ms. (248 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1583 ms. (252 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1575 ms. (253 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1611 ms. (248 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1599 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1581 ms. (252 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1600 ms. (249 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1595 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1588 ms. (251 steps per ms) remains 74/75 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1576 ms. (253 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1596 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1560 ms. (256 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1534 ms. (260 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1551 ms. (257 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1523 ms. (262 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1545 ms. (258 steps per ms) remains 72/74 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1535 ms. (260 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1992 ms. (200 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1543 ms. (259 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1548 ms. (258 steps per ms) remains 72/72 properties
// Phase 1: matrix 986 rows 605 cols
[2025-05-29 18:45:39] [INFO ] Computed 27 invariants in 33 ms
[2025-05-29 18:45:39] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 508/580 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 12/592 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 13/605 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 986/1591 variables, 605/632 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1591 variables, 132/764 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1591 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/1591 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1591/1591 variables, and 764 constraints, problems are : Problem set: 0 solved, 72 unsolved in 7500 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 605/605 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 508/580 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-05-29 18:45:47] [INFO ] Deduced a trap composed of 537 places in 224 ms of which 5 ms to minimize.
[2025-05-29 18:45:47] [INFO ] Deduced a trap composed of 539 places in 202 ms of which 4 ms to minimize.
[2025-05-29 18:45:48] [INFO ] Deduced a trap composed of 549 places in 199 ms of which 4 ms to minimize.
[2025-05-29 18:45:49] [INFO ] Deduced a trap composed of 526 places in 233 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-05-29 18:45:49] [INFO ] Deduced a trap composed of 539 places in 221 ms of which 3 ms to minimize.
[2025-05-29 18:45:49] [INFO ] Deduced a trap composed of 530 places in 219 ms of which 3 ms to minimize.
[2025-05-29 18:45:49] [INFO ] Deduced a trap composed of 504 places in 217 ms of which 4 ms to minimize.
[2025-05-29 18:45:50] [INFO ] Deduced a trap composed of 535 places in 214 ms of which 4 ms to minimize.
[2025-05-29 18:45:50] [INFO ] Deduced a trap composed of 535 places in 201 ms of which 4 ms to minimize.
[2025-05-29 18:45:50] [INFO ] Deduced a trap composed of 524 places in 206 ms of which 4 ms to minimize.
[2025-05-29 18:45:50] [INFO ] Deduced a trap composed of 540 places in 201 ms of which 4 ms to minimize.
[2025-05-29 18:45:50] [INFO ] Deduced a trap composed of 527 places in 208 ms of which 4 ms to minimize.
[2025-05-29 18:45:51] [INFO ] Deduced a trap composed of 542 places in 198 ms of which 4 ms to minimize.
[2025-05-29 18:45:51] [INFO ] Deduced a trap composed of 542 places in 199 ms of which 4 ms to minimize.
[2025-05-29 18:45:51] [INFO ] Deduced a trap composed of 539 places in 204 ms of which 3 ms to minimize.
[2025-05-29 18:45:51] [INFO ] Deduced a trap composed of 529 places in 204 ms of which 4 ms to minimize.
[2025-05-29 18:45:51] [INFO ] Deduced a trap composed of 542 places in 197 ms of which 4 ms to minimize.
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 539 places in 201 ms of which 4 ms to minimize.
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 518 places in 195 ms of which 4 ms to minimize.
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 547 places in 190 ms of which 4 ms to minimize.
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 512 places in 202 ms of which 4 ms to minimize.
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 525 places in 205 ms of which 3 ms to minimize.
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 518 places in 200 ms of which 4 ms to minimize.
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 536 places in 196 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 12/592 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 13/605 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-05-29 18:45:55] [INFO ] Deduced a trap composed of 116 places in 264 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 986/1591 variables, 605/657 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1591 variables, 132/789 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1591 variables, 72/861 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1591 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 14 (OVERLAPS) 0/1591 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1591/1591 variables, and 861 constraints, problems are : Problem set: 0 solved, 72 unsolved in 34545 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 605/605 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 25/25 constraints]
After SMT, in 42107ms problems are : Problem set: 0 solved, 72 unsolved
Parikh walk visited 0 properties in 4518 ms.
Support contains 72 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 986/986 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 605 transition count 985
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 985
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 602 transition count 961
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 602 transition count 961
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 88 place count 561 transition count 920
Applied a total of 88 rules in 94 ms. Remains 561 /605 variables (removed 44) and now considering 920/986 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 561/605 places, 920/986 transitions.
RANDOM walk for 4000000 steps (8 resets) in 31679 ms. (126 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1539 ms. (259 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1531 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1528 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1523 ms. (262 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1537 ms. (260 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1550 ms. (257 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1553 ms. (257 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1548 ms. (258 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1539 ms. (259 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1556 ms. (256 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1524 ms. (262 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1527 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1514 ms. (264 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1528 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1535 ms. (260 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1530 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1530 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1536 ms. (260 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1525 ms. (262 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1519 ms. (263 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1499 ms. (266 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1492 ms. (267 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1519 ms. (263 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1518 ms. (263 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1498 ms. (266 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1522 ms. (262 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1528 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1527 ms. (261 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1548 ms. (258 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1544 ms. (258 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1588 ms. (251 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1556 ms. (256 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1554 ms. (257 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1556 ms. (256 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1571 ms. (254 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1578 ms. (253 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1557 ms. (256 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1570 ms. (254 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1558 ms. (256 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1580 ms. (253 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1568 ms. (254 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1586 ms. (252 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1598 ms. (250 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1572 ms. (254 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1593 ms. (250 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1583 ms. (252 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1577 ms. (253 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1565 ms. (255 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1556 ms. (256 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1590 ms. (251 steps per ms) remains 72/72 properties
Interrupted probabilistic random walk after 6814602 steps, run timeout after 93001 ms. (steps per millisecond=73 ) properties seen :64 out of 72
Probabilistic random walk after 6814602 steps, saw 4350286 distinct states, run finished after 93005 ms. (steps per millisecond=73 ) properties seen :64
// Phase 1: matrix 920 rows 561 cols
[2025-05-29 18:48:30] [INFO ] Computed 27 invariants in 14 ms
[2025-05-29 18:48:30] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/561 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 920/1481 variables, 561/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1481 variables, 132/720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1481 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1481 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1481/1481 variables, and 720 constraints, problems are : Problem set: 0 solved, 8 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 561/561 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/561 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-29 18:48:31] [INFO ] Deduced a trap composed of 184 places in 251 ms of which 4 ms to minimize.
[2025-05-29 18:48:32] [INFO ] Deduced a trap composed of 287 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:48:32] [INFO ] Deduced a trap composed of 133 places in 231 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 920/1481 variables, 561/591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1481 variables, 132/723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1481 variables, 8/731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1481 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1481 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1481/1481 variables, and 731 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3334 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 561/561 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 4141ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 982 ms.
Support contains 8 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 920/920 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 120 place count 501 transition count 860
Applied a total of 120 rules in 54 ms. Remains 501 /561 variables (removed 60) and now considering 860/920 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 501/561 places, 860/920 transitions.
RANDOM walk for 4000000 steps (8 resets) in 18955 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8864 ms. (451 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (8 resets) in 7563 ms. (528 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7486 ms. (534 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7623 ms. (524 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 7624 ms. (524 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (8 resets) in 7461 ms. (536 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7417 ms. (539 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 7502 ms. (533 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 2543952 steps, run visited all 8 properties in 20493 ms. (steps per millisecond=124 )
Probabilistic random walk after 2543952 steps, saw 1634041 distinct states, run finished after 20506 ms. (steps per millisecond=124 ) properties seen :8
Able to resolve query StableMarking after proving 889 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 280043 ms.
ITS solved all properties within timeout

BK_STOP 1748544558498

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-12"
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 Anderson-PT-12, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r014-tall-174853743400133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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