fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r201-smll-167840347500269
Last Updated
May 14, 2023

About the Execution of LTSMin+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
271.584 11323.00 21143.00 483.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347500269.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HealthRecord-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347500269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 51K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678638977018

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:36:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 16:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:36:21] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-12 16:36:21] [INFO ] Transformed 125 places.
[2023-03-12 16:36:21] [INFO ] Transformed 246 transitions.
[2023-03-12 16:36:21] [INFO ] Found NUPN structural information;
[2023-03-12 16:36:21] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Normalized transition count is 229 out of 237 initially.
// Phase 1: matrix 229 rows 125 cols
[2023-03-12 16:36:21] [INFO ] Computed 14 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 917 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :7
FORMULA HealthRecord-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :2
FORMULA HealthRecord-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 16:36:21] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2023-03-12 16:36:21] [INFO ] Computed 14 place invariants in 17 ms
[2023-03-12 16:36:22] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2023-03-12 16:36:22] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-12 16:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:22] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-12 16:36:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:36:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-12 16:36:22] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-12 16:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:22] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-12 16:36:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:36:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-12 16:36:22] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 49 ms.
[2023-03-12 16:36:23] [INFO ] Added : 18 causal constraints over 5 iterations in 247 ms. Result :sat
Minimization took 41 ms.
[2023-03-12 16:36:23] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-12 16:36:23] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-12 16:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:23] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-12 16:36:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:36:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-12 16:36:23] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-12 16:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:23] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-12 16:36:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:36:23] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 8 ms to minimize.
[2023-03-12 16:36:23] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2023-03-12 16:36:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-12 16:36:23] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 39 ms.
[2023-03-12 16:36:23] [INFO ] Added : 7 causal constraints over 2 iterations in 107 ms. Result :sat
Minimization took 40 ms.
[2023-03-12 16:36:24] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 25 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:24] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-12 16:36:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:36:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:24] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:36:24] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 44 ms.
[2023-03-12 16:36:24] [INFO ] Added : 9 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 22 ms.
[2023-03-12 16:36:24] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:24] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-12 16:36:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:36:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:24] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-12 16:36:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:36:24] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 34 ms.
[2023-03-12 16:36:25] [INFO ] Added : 24 causal constraints over 5 iterations in 185 ms. Result :sat
Minimization took 38 ms.
[2023-03-12 16:36:25] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-12 16:36:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2023-03-12 16:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:25] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-12 16:36:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:36:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-12 16:36:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 16:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:25] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-12 16:36:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:36:25] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2023-03-12 16:36:25] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2023-03-12 16:36:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-12 16:36:25] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 32 ms.
[2023-03-12 16:36:25] [INFO ] Added : 6 causal constraints over 2 iterations in 111 ms. Result :sat
Minimization took 38 ms.
[2023-03-12 16:36:25] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-12 16:36:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 16:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:26] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-12 16:36:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:36:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-12 16:36:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 16:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:36:26] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-12 16:36:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-12 16:36:26] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 36 ms.
[2023-03-12 16:36:26] [INFO ] Added : 8 causal constraints over 2 iterations in 111 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 125 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 235/235 transitions.
Graph (trivial) has 183 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 455 edges and 122 vertex of which 100 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 100 transition count 119
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 152 place count 42 transition count 61
Iterating global reduction 1 with 58 rules applied. Total rules applied 210 place count 42 transition count 61
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 210 place count 42 transition count 54
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 224 place count 35 transition count 54
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 238 place count 21 transition count 32
Iterating global reduction 1 with 14 rules applied. Total rules applied 252 place count 21 transition count 32
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 255 place count 21 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 259 place count 17 transition count 22
Iterating global reduction 2 with 4 rules applied. Total rules applied 263 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 17 transition count 21
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 267 place count 14 transition count 18
Iterating global reduction 3 with 3 rules applied. Total rules applied 270 place count 14 transition count 18
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 273 place count 14 transition count 15
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 4 with 2 rules applied. Total rules applied 275 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 12 transition count 13
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 280 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 284 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 284 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 286 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 287 place count 7 transition count 7
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 6 with 2 rules applied. Total rules applied 289 place count 6 transition count 6
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 6 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 291 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 293 place count 5 transition count 3
Applied a total of 293 rules in 70 ms. Remains 5 /125 variables (removed 120) and now considering 3/235 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 5/125 places, 3/235 transitions.
// Phase 1: matrix 3 rows 5 cols
[2023-03-12 16:36:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 250000 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6491 ms.
ITS solved all properties within timeout

BK_STOP 1678638988341

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347500269"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;