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.r168-tall-174881267100458.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 QuasiCertifProtocol-COL-06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881267100458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 61K 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 1748903926078

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 22:38:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 22:38:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:38:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 22:38:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 22:38:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2025-06-02 22:38:48] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 17 ms.
[2025-06-02 22:38:48] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2025-06-02 22:38:48] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
Structural test allowed to assert that 4 places are NOT stable. Took 4 ms.
RANDOM walk for 40008 steps (3045 resets) in 771 ms. (51 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40003 steps (1364 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1374 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-02 22:38:48] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/56 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/56 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 498ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 52 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 7 ms.
Able to resolve query StableMarking after proving 27 properties.
[2025-06-02 22:38:49] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 19 ms.
[2025-06-02 22:38:49] [INFO ] Unfolded 30 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (3929 resets) in 1173 ms. (34 steps per ms) remains 21/30 properties
BEST_FIRST walk for 4004 steps (66 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (67 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (71 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (62 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (75 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (68 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (68 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (68 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (74 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (66 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (70 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (69 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (69 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (71 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (66 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (72 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (71 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (71 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (72 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (73 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (67 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
// Phase 1: matrix 116 rows 270 cols
[2025-06-02 22:38:49] [INFO ] Computed 155 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 138/139 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 19/256 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 116/372 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 14/386 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 425 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 138/139 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 19/256 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 10 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
[2025-06-02 22:38:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 8 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-02 22:38:52] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 10/184 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2025-06-02 22:38:53] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 8 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2025-06-02 22:38:54] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-06-02 22:38:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/386 variables, and 218 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 138/144 constraints, State Equation: 0/270 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 69/69 constraints]
After SMT, in 6383ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 237 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 268 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 261 transition count 101
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 23 place count 261 transition count 94
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 50 place count 241 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 50 place count 241 transition count 93
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 239 transition count 93
Applied a total of 53 rules in 34 ms. Remains 239 /270 variables (removed 31) and now considering 93/116 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 239/270 places, 93/116 transitions.
RANDOM walk for 4000000 steps (461079 resets) in 16506 ms. (242 steps per ms) remains 9/21 properties
BEST_FIRST walk for 4000002 steps (91660 resets) in 4137 ms. (966 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (91928 resets) in 5910 ms. (676 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (92234 resets) in 5931 ms. (674 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (91668 resets) in 4500 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (92223 resets) in 4419 ms. (904 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (92373 resets) in 4423 ms. (904 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (92434 resets) in 4381 ms. (912 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (92390 resets) in 4239 ms. (943 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (92401 resets) in 4496 ms. (889 steps per ms) remains 9/9 properties
// Phase 1: matrix 93 rows 239 cols
[2025-06-02 22:39:12] [INFO ] Computed 146 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 49/184 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 50/234 variables, 184/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 53/287 variables, 23/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 7/294 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 7/354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 17/311 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 17/328 variables, 15/377 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 3/331 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/331 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 1/332 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/332 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 385 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 145/145 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 49/184 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 50/234 variables, 184/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 53/287 variables, 23/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 7/294 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 7/363 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 17/311 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 17/328 variables, 15/386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/328 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 3/331 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 1/332 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/332 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 394 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2572 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 145/145 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3661ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Finished Parikh walk after 49 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=9 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 7 ms.
Able to resolve query StableMarking after proving 30 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL
Total runtime 28583 ms.
ITS solved all properties within timeout

BK_STOP 1748903955957

--------------------
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="QuasiCertifProtocol-COL-06"
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 QuasiCertifProtocol-COL-06, 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 r168-tall-174881267100458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 ;