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.r112-smll-174867016500358.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 HealthRecord-PT-05, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016500358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 154K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 51K 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 1748771120934

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:45:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:45:23] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2025-06-01 09:45:23] [INFO ] Transformed 125 places.
[2025-06-01 09:45:23] [INFO ] Transformed 246 transitions.
[2025-06-01 09:45:23] [INFO ] Found NUPN structural information;
[2025-06-01 09:45:23] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 379 ms.
Graph (trivial) has 194 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Structural test allowed to assert that 26 places are NOT stable. Took 44 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3694 resets) in 3901 ms. (10 steps per ms) remains 32/99 properties
BEST_FIRST walk for 4003 steps (48 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 45 ms. (87 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (50 resets) in 56 ms. (70 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (50 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (45 resets) in 60 ms. (65 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (48 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (47 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (46 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (47 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (47 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (49 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (51 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (49 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (44 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (48 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (48 resets) in 15 ms. (250 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (50 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (48 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (48 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
[2025-06-01 09:45:25] [INFO ] Flow matrix only has 223 transitions (discarded 11 similar events)
// Phase 1: matrix 223 rows 122 cols
[2025-06-01 09:45:25] [INFO ] Computed 14 invariants in 23 ms
[2025-06-01 09:45:25] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 50/78 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 50/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 44/122 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 222/344 variables, 122/258 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 259 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2076 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 50/78 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 50/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:45:28] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 20 ms to minimize.
[2025-06-01 09:45:28] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 3 ms to minimize.
[2025-06-01 09:45:28] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2025-06-01 09:45:28] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:45:28] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2025-06-01 09:45:29] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2025-06-01 09:45:29] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 2 ms to minimize.
[2025-06-01 09:45:29] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2025-06-01 09:45:29] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:45:29] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:45:29] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:45:29] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2025-06-01 09:45:30] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2025-06-01 09:45:30] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2025-06-01 09:45:30] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:45:30] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:45:30] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:45:31] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 3 ms to minimize.
[2025-06-01 09:45:31] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 44/122 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 44/155 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 09:45:31] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:45:31] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2025-06-01 09:45:31] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2025-06-01 09:45:31] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:45:31] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 3 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2025-06-01 09:45:32] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2025-06-01 09:45:33] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2025-06-01 09:45:33] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
SMT process timed out in 7252ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 234/234 transitions.
Graph (complete) has 457 edges and 122 vertex of which 115 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 115 transition count 220
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 113 transition count 216
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 111 transition count 215
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 58 place count 70 transition count 133
Iterating global reduction 3 with 41 rules applied. Total rules applied 99 place count 70 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 104 place count 65 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 109 place count 65 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 65 transition count 120
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 122 place count 60 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 60 transition count 145
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 60 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 127 place count 58 transition count 143
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 141 place count 58 transition count 143
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 153 place count 58 transition count 143
Applied a total of 153 rules in 132 ms. Remains 58 /122 variables (removed 64) and now considering 143/234 (removed 91) transitions.
Running 127 sub problems to find dead transitions.
[2025-06-01 09:45:33] [INFO ] Flow matrix only has 130 transitions (discarded 13 similar events)
// Phase 1: matrix 130 rows 58 cols
[2025-06-01 09:45:33] [INFO ] Computed 7 invariants in 8 ms
[2025-06-01 09:45:33] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 2/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 4 (OVERLAPS) 130/188 variables, 58/65 constraints. Problems are: Problem set: 13 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 10/75 constraints. Problems are: Problem set: 13 solved, 114 unsolved
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 1 ms to minimize.
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2025-06-01 09:45:35] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2025-06-01 09:45:36] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:45:36] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 10/85 constraints. Problems are: Problem set: 14 solved, 113 unsolved
[2025-06-01 09:45:37] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-06-01 09:45:37] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:45:37] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:45:37] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:45:38] [INFO ] Deduced a trap composed of 29 places in 540 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 5/90 constraints. Problems are: Problem set: 14 solved, 113 unsolved
[2025-06-01 09:45:38] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/91 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 14 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 91 constraints, problems are : Problem set: 14 solved, 113 unsolved in 7095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 58/58 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 14 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 3/57 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 6/7 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 16/23 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 130/188 variables, 58/81 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 10/91 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 113/204 constraints. Problems are: Problem set: 14 solved, 113 unsolved
[2025-06-01 09:45:42] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/205 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/205 constraints. Problems are: Problem set: 14 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/205 constraints. Problems are: Problem set: 14 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 205 constraints, problems are : Problem set: 14 solved, 113 unsolved in 4962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 58/58 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 113/127 constraints, Known Traps: 17/17 constraints]
After SMT, in 12400ms problems are : Problem set: 14 solved, 113 unsolved
Search for dead transitions found 14 dead transitions in 12409ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/122 places, 129/234 transitions.
Graph (complete) has 189 edges and 58 vertex of which 56 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 128
Applied a total of 3 rules in 13 ms. Remains 55 /58 variables (removed 3) and now considering 128/129 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12588 ms. Remains : 55/122 places, 128/234 transitions.
RANDOM walk for 97916 steps (11125 resets) in 1512 ms. (64 steps per ms) remains 0/28 properties
Able to resolve query StableMarking after proving 101 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 22800 ms.
ITS solved all properties within timeout

BK_STOP 1748771146378

--------------------
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="HealthRecord-PT-05"
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 HealthRecord-PT-05, 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 r112-smll-174867016500358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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