Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r188-tall-171640616800458.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
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 r188-tall-171640616800458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 19:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 19:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 51K May 18 16:42 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 1716475631143

Invoking MCC driver with
BK_TOOL=greatspnxred
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
[2024-05-23 14:47:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:47:12] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-23 14:47:12] [INFO ] Transformed 125 places.
[2024-05-23 14:47:12] [INFO ] Transformed 246 transitions.
[2024-05-23 14:47:12] [INFO ] Found NUPN structural information;
[2024-05-23 14:47:12] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 163 ms.
Graph (trivial) has 194 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Structural test allowed to assert that 26 places are NOT stable. Took 23 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3706 resets) in 1815 ms. (22 steps per ms) remains 28/99 properties
BEST_FIRST walk for 4004 steps (48 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (46 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (49 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (45 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (46 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (45 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (47 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (50 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (46 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (48 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (49 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (48 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (49 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (48 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (51 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (49 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
[2024-05-23 14:47:13] [INFO ] Flow matrix only has 223 transitions (discarded 11 similar events)
// Phase 1: matrix 223 rows 122 cols
[2024-05-23 14:47:13] [INFO ] Computed 14 invariants in 15 ms
[2024-05-23 14:47:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 52/78 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 52/86 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 44/122 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 222/344 variables, 122/258 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 259 constraints, problems are : Problem set: 0 solved, 26 unsolved in 981 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: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 52/78 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 52/86 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 12 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:47:14] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 2 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 2 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 44/122 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 44/155 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-23 14:47:15] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 2 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 4 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 2 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
[2024-05-23 14:47:16] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 222/344 variables, 122/299 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 26/325 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 1/345 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 0/345 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 326 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3454 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: 26/26 constraints, Known Traps: 41/41 constraints]
After SMT, in 4512ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 23 properties in 1358 ms.
Support contains 3 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.1 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 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 75 place count 53 transition count 99
Iterating global reduction 3 with 58 rules applied. Total rules applied 133 place count 53 transition count 99
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 143 place count 43 transition count 79
Iterating global reduction 3 with 10 rules applied. Total rules applied 153 place count 43 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 157 place count 43 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 40 transition count 66
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 40 transition count 66
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 166 place count 37 transition count 60
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 37 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 172 place count 37 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 182 place count 32 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 32 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 186 place count 32 transition count 76
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 189 place count 29 transition count 76
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 191 place count 29 transition count 138
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 195 place count 27 transition count 136
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 196 place count 26 transition count 102
Iterating global reduction 7 with 1 rules applied. Total rules applied 197 place count 26 transition count 102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 198 place count 25 transition count 100
Iterating global reduction 7 with 1 rules applied. Total rules applied 199 place count 25 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 203 place count 25 transition count 96
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 210 place count 25 transition count 96
Applied a total of 210 rules in 57 ms. Remains 25 /122 variables (removed 97) and now considering 96/234 (removed 138) transitions.
Running 80 sub problems to find dead transitions.
[2024-05-23 14:47:19] [INFO ] Flow matrix only has 70 transitions (discarded 26 similar events)
// Phase 1: matrix 70 rows 25 cols
[2024-05-23 14:47:19] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 14:47:19] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 4 (OVERLAPS) 70/95 variables, 25/32 constraints. Problems are: Problem set: 8 solved, 72 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 11/43 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/43 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/43 constraints. Problems are: Problem set: 10 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 43 constraints, problems are : Problem set: 10 solved, 70 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 6/7 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 70/95 variables, 25/32 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 11/43 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 70/113 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/113 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/113 constraints. Problems are: Problem set: 10 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 113 constraints, problems are : Problem set: 10 solved, 70 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 70/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 1961ms problems are : Problem set: 10 solved, 70 unsolved
Search for dead transitions found 10 dead transitions in 1963ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/122 places, 86/234 transitions.
Graph (complete) has 83 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2037 ms. Remains : 24/122 places, 86/234 transitions.
RANDOM walk for 6178 steps (946 resets) in 148 ms. (41 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 101 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 9157 ms.
ITS solved all properties within timeout

BK_STOP 1716475641497

--------------------
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="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
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 r188-tall-171640616800458"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;