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.r496-tall-171640604100733.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 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 r496-tall-171640604100733
=====================================================================

--------------------
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 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 1717201000088

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
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:16:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:16:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:16:41] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 00:16:41] [INFO ] Transformed 125 places.
[2024-06-01 00:16:41] [INFO ] Transformed 246 transitions.
[2024-06-01 00:16:41] [INFO ] Found NUPN structural information;
[2024-06-01 00:16:41] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:16:41] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2024-06-01 00:16:41] [INFO ] Computed 14 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (914 resets) in 39 ms. (250 steps per ms)
FORMULA HealthRecord-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (866 resets) in 56 ms. (1228 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:16:41] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
[2024-06-01 00:16:41] [INFO ] Invariant cache hit.
[2024-06-01 00:16:41] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-01 00:16:41] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 00:16:41] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-01 00:16:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:16:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:16:42] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 8 ms to minimize.
[2024-06-01 00:16:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:16:42] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:16:42] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:16:42] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2024-06-01 00:16:42] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 27 ms.
[2024-06-01 00:16:42] [INFO ] Added : 11 causal constraints over 3 iterations in 88 ms. Result :sat
Minimization took 91 ms.
[2024-06-01 00:16:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:16:42] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:16:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 00:16:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:16:42] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:16:43] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:16:43] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:16:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2024-06-01 00:16:43] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 16 ms.
[2024-06-01 00:16:43] [INFO ] Added : 13 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 81 ms.
[2024-06-01 00:16:43] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:16:43] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 29 ms.
[2024-06-01 00:16:43] [INFO ] Added : 14 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 115 ms.
[2024-06-01 00:16:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:16:43] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 17 ms.
[2024-06-01 00:16:43] [INFO ] Added : 14 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 84 ms.
[2024-06-01 00:16:43] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 00:16:43] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 00:16:43] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 17 ms.
[2024-06-01 00:16:44] [INFO ] Added : 11 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 117 ms.
[2024-06-01 00:16:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:16:44] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 15 ms.
[2024-06-01 00:16:44] [INFO ] Added : 11 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 77 ms.
[2024-06-01 00:16:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:16:44] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 14 ms.
[2024-06-01 00:16:44] [INFO ] Added : 12 causal constraints over 3 iterations in 76 ms. Result :sat
Minimization took 125 ms.
[2024-06-01 00:16:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 00:16:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 00:16:44] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 16 ms.
[2024-06-01 00:16:44] [INFO ] Added : 12 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 86 ms.
[2024-06-01 00:16:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:16:45] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:16:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:16:45] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:16:45] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:16:45] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2024-06-01 00:16:45] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 17 ms.
[2024-06-01 00:16:45] [INFO ] Added : 11 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 79 ms.
[2024-06-01 00:16:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:16:45] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:16:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-01 00:16:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:16:45] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:45] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 5 ms to minimize.
[2024-06-01 00:16:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-06-01 00:16:45] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 15 ms.
[2024-06-01 00:16:46] [INFO ] Added : 14 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
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-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 125 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p87) 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 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) 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.1 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) 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 0 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 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 (Empty/Sink Transition effects.) 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 (Redundant composition of simpler 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 (Empty/Sink Transition effects.) 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 (Empty/Sink Transition effects.) 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 47 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 56 ms. Remains : 5/125 places, 3/235 transitions.
// Phase 1: matrix 3 rows 5 cols
[2024-06-01 00:16:46] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (250000 resets) in 260 ms. (3831 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5362 ms.
ITS solved all properties within timeout

BK_STOP 1717201006625

--------------------
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 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-5568"
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 r496-tall-171640604100733"
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 ;