About the Execution of GreatSPN+red for HealthRecord-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
351.312 | 7780.00 | 20000.00 | 62.70 | FTTTTFTFFTTTTTTT | normal |
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-171640602200735.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602200735
=====================================================================
--------------------
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
here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-05-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716490465159
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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:54:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 18:54:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:54:26] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-23 18:54:26] [INFO ] Transformed 125 places.
[2024-05-23 18:54:26] [INFO ] Transformed 246 transitions.
[2024-05-23 18:54:26] [INFO ] Found NUPN structural information;
[2024-05-23 18:54:26] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
RANDOM walk for 40000 steps (3679 resets) in 2014 ms. (19 steps per ms) remains 11/16 properties
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (476 resets) in 278 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (496 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (483 resets) in 950 ms. (42 steps per ms) remains 9/11 properties
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (497 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (524 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (471 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (484 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (492 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (323 resets) in 57 ms. (689 steps per ms) remains 8/9 properties
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (490 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
[2024-05-23 18:54:27] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2024-05-23 18:54:27] [INFO ] Computed 14 invariants in 14 ms
[2024-05-23 18:54:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HealthRecord-PT-05-ReachabilityFireability-2024-07 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 49/101 variables, 8/60 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 49/109 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 24/125 variables, 6/115 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 24/139 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 228/353 variables, 125/264 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/265 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 265 constraints, problems are : Problem set: 1 solved, 7 unsolved in 624 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 53/97 variables, 8/52 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 53/105 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 12 ms to minimize.
Problem HealthRecord-PT-05-ReachabilityFireability-2024-00 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:54:28] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
Problem HealthRecord-PT-05-ReachabilityFireability-2024-14 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 12/117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/118 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem HealthRecord-PT-05-ReachabilityFireability-2024-09 is UNSAT
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 28/125 variables, 6/124 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 28/152 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 3/155 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/156 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/156 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 228/353 variables, 125/281 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 4/285 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:54:29] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 2/287 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 18:54:30] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/354 variables, 1/289 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 18:54:30] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 1/290 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/354 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 290 constraints, problems are : Problem set: 4 solved, 4 unsolved in 2161 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 21/21 constraints]
After SMT, in 2891ms problems are : Problem set: 4 solved, 4 unsolved
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 111 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 182 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 459 edges and 123 vertex of which 115 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 222
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 10 place count 113 transition count 218
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 13 place count 111 transition count 217
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 71 place count 53 transition count 101
Iterating global reduction 3 with 58 rules applied. Total rules applied 129 place count 53 transition count 101
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 139 place count 43 transition count 81
Iterating global reduction 3 with 10 rules applied. Total rules applied 149 place count 43 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 153 place count 43 transition count 77
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 156 place count 40 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 40 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 37 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 37 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 168 place count 37 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 36 transition count 58
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 180 place count 31 transition count 81
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 183 place count 31 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 186 place count 28 transition count 78
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 28 transition count 141
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 192 place count 26 transition count 139
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 193 place count 25 transition count 105
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 25 transition count 105
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 195 place count 24 transition count 103
Iterating global reduction 7 with 1 rules applied. Total rules applied 196 place count 24 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 200 place count 24 transition count 99
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 202 place count 24 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 204 place count 24 transition count 97
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 211 place count 24 transition count 97
Applied a total of 211 rules in 65 ms. Remains 24 /125 variables (removed 101) and now considering 97/237 (removed 140) transitions.
Running 81 sub problems to find dead transitions.
[2024-05-23 18:54:30] [INFO ] Flow matrix only has 71 transitions (discarded 26 similar events)
// Phase 1: matrix 71 rows 24 cols
[2024-05-23 18:54:30] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 18:54:30] [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, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
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
Problem TDEAD96 is UNSAT
At refinement iteration 3 (OVERLAPS) 71/95 variables, 24/30 constraints. Problems are: Problem set: 8 solved, 73 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 11/41 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 41 constraints, problems are : Problem set: 10 solved, 71 unsolved in 744 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 71/95 variables, 24/30 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 11/41 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 71/112 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/112 constraints. Problems are: Problem set: 10 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/112 constraints. Problems are: Problem set: 10 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 112 constraints, problems are : Problem set: 10 solved, 71 unsolved in 1085 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 71/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 1928ms problems are : Problem set: 10 solved, 71 unsolved
Search for dead transitions found 10 dead transitions in 1930ms
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 : 24/125 places, 87/237 transitions.
Graph (complete) has 76 edges and 24 vertex of which 23 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 10 ms. Remains 23 /24 variables (removed 1) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2020 ms. Remains : 23/125 places, 87/237 transitions.
RANDOM walk for 4037 steps (652 resets) in 170 ms. (23 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6551 ms.
ITS solved all properties within timeout
BK_STOP 1716490472939
--------------------
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-05"
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-05, 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-171640602200735"
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 [ "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 '
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 ;