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-171640604100757.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-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100757
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 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 68K 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-08-UpperBounds-00
FORMULA_NAME HealthRecord-PT-08-UpperBounds-01
FORMULA_NAME HealthRecord-PT-08-UpperBounds-02
FORMULA_NAME HealthRecord-PT-08-UpperBounds-03
FORMULA_NAME HealthRecord-PT-08-UpperBounds-04
FORMULA_NAME HealthRecord-PT-08-UpperBounds-05
FORMULA_NAME HealthRecord-PT-08-UpperBounds-06
FORMULA_NAME HealthRecord-PT-08-UpperBounds-07
FORMULA_NAME HealthRecord-PT-08-UpperBounds-08
FORMULA_NAME HealthRecord-PT-08-UpperBounds-09
FORMULA_NAME HealthRecord-PT-08-UpperBounds-10
FORMULA_NAME HealthRecord-PT-08-UpperBounds-11
FORMULA_NAME HealthRecord-PT-08-UpperBounds-12
FORMULA_NAME HealthRecord-PT-08-UpperBounds-13
FORMULA_NAME HealthRecord-PT-08-UpperBounds-14
FORMULA_NAME HealthRecord-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717201192148

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:19:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:19:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:19:53] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 00:19:53] [INFO ] Transformed 156 places.
[2024-06-01 00:19:53] [INFO ] Transformed 326 transitions.
[2024-06-01 00:19:53] [INFO ] Found NUPN structural information;
[2024-06-01 00:19:53] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 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, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:19:53] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2024-06-01 00:19:53] [INFO ] Computed 18 invariants in 16 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (564 resets) in 39 ms. (250 steps per ms)
FORMULA HealthRecord-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (501 resets) in 59 ms. (1166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-01 00:19:53] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
[2024-06-01 00:19:53] [INFO ] Invariant cache hit.
[2024-06-01 00:19:53] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 00:19:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2024-06-01 00:19:53] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 00:19:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:19:53] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:19:54] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 8 ms to minimize.
[2024-06-01 00:19:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:19:54] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-06-01 00:19:54] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 27 ms.
[2024-06-01 00:19:54] [INFO ] Added : 17 causal constraints over 5 iterations in 152 ms. Result :sat
Minimization took 117 ms.
[2024-06-01 00:19:54] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:54] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:19:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 00:19:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2024-06-01 00:19:55] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 23 ms.
[2024-06-01 00:19:55] [INFO ] Added : 17 causal constraints over 4 iterations in 102 ms. Result :sat
Minimization took 113 ms.
[2024-06-01 00:19:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:19:55] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 00:19:55] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:19:55] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 23 ms.
[2024-06-01 00:19:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 00:19:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:19:55] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 00:19:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 00:19:55] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 24 ms.
[2024-06-01 00:19:55] [INFO ] Added : 29 causal constraints over 7 iterations in 136 ms. Result :sat
Minimization took 119 ms.
[2024-06-01 00:19:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:56] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 22 ms.
[2024-06-01 00:19:56] [INFO ] Added : 13 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 105 ms.
[2024-06-01 00:19:56] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:19:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 00:19:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:19:56] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 22 ms.
[2024-06-01 00:19:56] [INFO ] Added : 22 causal constraints over 5 iterations in 107 ms. Result :sat
Minimization took 104 ms.
[2024-06-01 00:19:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:19:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-06-01 00:19:57] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 00:19:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:19:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:19:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:19:57] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 00:19:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 285 ms
[2024-06-01 00:19:57] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 22 ms.
[2024-06-01 00:19:57] [INFO ] Added : 27 causal constraints over 6 iterations in 114 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 229 edges and 156 vertex of which 10 / 156 are part of one of the 5 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 652 edges and 151 vertex of which 141 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 141 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 136 transition count 265
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 134 transition count 264
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 22 place count 134 transition count 261
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 129 transition count 261
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 104 place count 55 transition count 113
Iterating global reduction 3 with 74 rules applied. Total rules applied 178 place count 55 transition count 113
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 188 place count 45 transition count 93
Iterating global reduction 3 with 10 rules applied. Total rules applied 198 place count 45 transition count 93
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 206 place count 45 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 207 place count 44 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 44 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 43 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 43 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 213 place count 43 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 42 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 225 place count 37 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 37 transition count 115
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 238 place count 37 transition count 115
Applied a total of 238 rules in 74 ms. Remains 37 /156 variables (removed 119) and now considering 115/300 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 37/156 places, 115/300 transitions.
[2024-06-01 00:19:57] [INFO ] Flow matrix only has 107 transitions (discarded 8 similar events)
// Phase 1: matrix 107 rows 37 cols
[2024-06-01 00:19:57] [INFO ] Computed 6 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (161752 resets) in 1652 ms. (604 steps per ms)
FORMULA HealthRecord-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (23836 resets) in 382 ms. (2610 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:20:00] [INFO ] Flow matrix only has 107 transitions (discarded 8 similar events)
[2024-06-01 00:20:00] [INFO ] Invariant cache hit.
[2024-06-01 00:20:00] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2024-06-01 00:20:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 00:20:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:20:00] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:20:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:20:00] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2024-06-01 00:20:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 00:20:00] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:20:00] [INFO ] Computed and/alt/rep : 23/95/23 causal constraints (skipped 68 transitions) in 11 ms.
[2024-06-01 00:20:00] [INFO ] Added : 2 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 37 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p145) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 35 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 35 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 34 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 34 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 33 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 33 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 33 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 32 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 31 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 31 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 30 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 30 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 30 transition count 82
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 30 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 28 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 28 transition count 78
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 34 place count 28 transition count 125
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 38 place count 25 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 41 place count 25 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 42 place count 24 transition count 94
Iterating global reduction 5 with 1 rules applied. Total rules applied 43 place count 24 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 44 place count 23 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 23 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 55 place count 23 transition count 81
Applied a total of 55 rules in 34 ms. Remains 23 /37 variables (removed 14) and now considering 81/113 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 23/37 places, 81/113 transitions.
[2024-06-01 00:20:00] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 23 cols
[2024-06-01 00:20:00] [INFO ] Computed 6 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (234594 resets) in 1382 ms. (723 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 8385 ms.
ITS solved all properties within timeout

BK_STOP 1717201201724

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

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