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.r179-tall-171640602100703.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-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602100703
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 46K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-01-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716490018125

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:46:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 18:46:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:46:59] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-23 18:46:59] [INFO ] Transformed 117 places.
[2024-05-23 18:46:59] [INFO ] Transformed 218 transitions.
[2024-05-23 18:46:59] [INFO ] Found NUPN structural information;
[2024-05-23 18:46:59] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
RANDOM walk for 40000 steps (2092 resets) in 1982 ms. (20 steps per ms) remains 9/16 properties
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (333 resets) in 267 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (323 resets) in 168 ms. (236 steps per ms) remains 8/9 properties
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (316 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 546 ms. (73 steps per ms) remains 7/8 properties
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (333 resets) in 770 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (316 resets) in 78 ms. (506 steps per ms) remains 6/7 properties
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (338 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
[2024-05-23 18:47:00] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2024-05-23 18:47:00] [INFO ] Computed 14 invariants in 11 ms
[2024-05-23 18:47:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem HealthRecord-PT-01-ReachabilityFireability-2024-02 is UNSAT
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-01-ReachabilityFireability-2024-12 is UNSAT
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 19/107 variables, 8/96 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 19/115 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/116 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/117 variables, 5/121 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 10/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 204/321 variables, 117/248 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/248 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/322 variables, 1/249 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/249 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/249 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 249 constraints, problems are : Problem set: 2 solved, 4 unsolved in 557 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 45/85 variables, 8/48 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 45/93 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 18:47:01] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/94 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 32/117 variables, 6/100 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 32/132 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 18:47:01] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-23 18:47:01] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:47:01] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 8/140 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 204/321 variables, 117/257 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 4/261 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 1/262 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:47:02] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 6/268 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 3/271 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 4/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:47:03] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 2/277 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/322 variables, 1/278 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/322 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/322 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 278 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2543 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 25/25 constraints]
After SMT, in 3242ms problems are : Problem set: 2 solved, 4 unsolved
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 86 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 213/213 transitions.
Graph (trivial) has 171 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 401 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 102 transition count 184
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 14 rules applied. Total rules applied 22 place count 96 transition count 176
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 94 transition count 174
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 93 transition count 173
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 28 place count 93 transition count 169
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 39 place count 86 transition count 169
Discarding 46 places :
Symmetric choice reduction at 4 with 46 rule applications. Total rules 85 place count 40 transition count 77
Iterating global reduction 4 with 46 rules applied. Total rules applied 131 place count 40 transition count 77
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 141 place count 30 transition count 57
Iterating global reduction 4 with 10 rules applied. Total rules applied 151 place count 30 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 155 place count 30 transition count 53
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 158 place count 27 transition count 44
Iterating global reduction 5 with 3 rules applied. Total rules applied 161 place count 27 transition count 44
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 164 place count 24 transition count 38
Iterating global reduction 5 with 3 rules applied. Total rules applied 167 place count 24 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 170 place count 24 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 178 place count 20 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 20 transition count 49
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 189 place count 20 transition count 49
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 197 place count 20 transition count 49
Applied a total of 197 rules in 47 ms. Remains 20 /117 variables (removed 97) and now considering 49/213 (removed 164) transitions.
Running 41 sub problems to find dead transitions.
[2024-05-23 18:47:04] [INFO ] Flow matrix only has 48 transitions (discarded 1 similar events)
// Phase 1: matrix 48 rows 20 cols
[2024-05-23 18:47:04] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 18:47:04] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 3 (OVERLAPS) 48/68 variables, 20/23 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 11/34 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/68 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 34 constraints, problems are : Problem set: 9 solved, 32 unsolved in 312 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 48/68 variables, 20/23 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 11/34 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 32/66 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 66 constraints, problems are : Problem set: 9 solved, 32 unsolved in 355 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 9 solved, 32 unsolved
Search for dead transitions found 9 dead transitions in 707ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/117 places, 40/213 transitions.
Graph (complete) has 58 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 40
Applied a total of 3 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 770 ms. Remains : 19/117 places, 40/213 transitions.
RANDOM walk for 24503 steps (8187 resets) in 340 ms. (71 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-01-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5871 ms.
ITS solved all properties within timeout

BK_STOP 1716490025226

--------------------
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 ReachabilityFireability -timeout 360 -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-01"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-01, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640602100703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;