fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r179-tall-171640602400815
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for HealthRecord-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
413.771 13955.00 30966.00 110.10 TTFTFTTFTTTTFTTT 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-171640602400815.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-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602400815
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 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 73K 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-15-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716491374195

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:09:35] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-23 19:09:35] [INFO ] Transformed 163 places.
[2024-05-23 19:09:35] [INFO ] Transformed 348 transitions.
[2024-05-23 19:09:35] [INFO ] Found NUPN structural information;
[2024-05-23 19:09:35] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (3692 resets) in 1820 ms. (21 steps per ms) remains 11/15 properties
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (486 resets) in 431 ms. (92 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (612 resets) in 622 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (477 resets) in 169 ms. (235 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (493 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (477 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (351 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (466 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (477 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (480 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (481 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
[2024-05-23 19:09:36] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2024-05-23 19:09:36] [INFO ] Computed 18 invariants in 13 ms
[2024-05-23 19:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 37/118 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HealthRecord-PT-15-ReachabilityFireability-2024-07 is UNSAT
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 45/163 variables, 8/136 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 45/181 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 306/469 variables, 163/344 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/470 variables, 1/345 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/470 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 345 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1024 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 163/163 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 43/115 variables, 10/82 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 43/125 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 16 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 8/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:38] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 8/141 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/143 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem HealthRecord-PT-15-ReachabilityFireability-2024-01 is UNSAT
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 48/163 variables, 8/151 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 48/199 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-23 19:09:39] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 14/213 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:09:40] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 20/233 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 6 ms to minimize.
[2024-05-23 19:09:41] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 6/239 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 14/253 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-23 19:09:42] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/470 variables, and 255 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5008 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/163 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 74/74 constraints]
After SMT, in 6163ms problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (complete) has 701 edges and 163 vertex of which 157 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 157 transition count 306
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 56 place count 109 transition count 210
Iterating global reduction 1 with 48 rules applied. Total rules applied 104 place count 109 transition count 210
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 106 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 106 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 106 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 105 transition count 201
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 102 transition count 205
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 102 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 101 transition count 204
Applied a total of 122 rules in 72 ms. Remains 101 /163 variables (removed 62) and now considering 204/319 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 101/163 places, 204/319 transitions.
RANDOM walk for 40000 steps (4661 resets) in 656 ms. (60 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (744 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (756 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (784 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (751 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (757 resets) in 62 ms. (634 steps per ms) remains 7/8 properties
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (759 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (759 resets) in 72 ms. (547 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (740 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
[2024-05-23 19:09:43] [INFO ] Flow matrix only has 200 transitions (discarded 4 similar events)
// Phase 1: matrix 200 rows 101 cols
[2024-05-23 19:09:43] [INFO ] Computed 12 invariants in 7 ms
[2024-05-23 19:09:43] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 22/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 18/101 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:43] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:09:43] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 200/301 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 118 constraints, problems are : Problem set: 0 solved, 7 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 22/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 18/101 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:09:45] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 200/301 variables, 101/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/301 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 159 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 36/36 constraints]
After SMT, in 2548ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 951 ms.
Support contains 54 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 204/204 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 192
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 94 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 94 transition count 190
Applied a total of 14 rules in 9 ms. Remains 94 /101 variables (removed 7) and now considering 190/204 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 94/101 places, 190/204 transitions.
RANDOM walk for 40000 steps (4657 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (759 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (769 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (770 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (772 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 481876 steps, run visited all 4 properties in 921 ms. (steps per millisecond=523 )
Probabilistic random walk after 481876 steps, saw 67913 distinct states, run finished after 925 ms. (steps per millisecond=520 ) properties seen :4
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 12750 ms.
ITS solved all properties within timeout

BK_STOP 1716491388150

--------------------
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-15"
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-15, 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-171640602400815"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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