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-167840347600301.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-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:21 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 68K 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-09-UpperBounds-00
FORMULA_NAME HealthRecord-PT-09-UpperBounds-01
FORMULA_NAME HealthRecord-PT-09-UpperBounds-02
FORMULA_NAME HealthRecord-PT-09-UpperBounds-03
FORMULA_NAME HealthRecord-PT-09-UpperBounds-04
FORMULA_NAME HealthRecord-PT-09-UpperBounds-05
FORMULA_NAME HealthRecord-PT-09-UpperBounds-06
FORMULA_NAME HealthRecord-PT-09-UpperBounds-07
FORMULA_NAME HealthRecord-PT-09-UpperBounds-08
FORMULA_NAME HealthRecord-PT-09-UpperBounds-09
FORMULA_NAME HealthRecord-PT-09-UpperBounds-10
FORMULA_NAME HealthRecord-PT-09-UpperBounds-11
FORMULA_NAME HealthRecord-PT-09-UpperBounds-12
FORMULA_NAME HealthRecord-PT-09-UpperBounds-13
FORMULA_NAME HealthRecord-PT-09-UpperBounds-14
FORMULA_NAME HealthRecord-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678639699153

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-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:48:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 16:48:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:48:22] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-12 16:48:22] [INFO ] Transformed 157 places.
[2023-03-12 16:48:22] [INFO ] Transformed 327 transitions.
[2023-03-12 16:48:22] [INFO ] Found NUPN structural information;
[2023-03-12 16:48:22] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 210 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.
FORMULA HealthRecord-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 289 out of 301 initially.
// Phase 1: matrix 289 rows 157 cols
[2023-03-12 16:48:22] [INFO ] Computed 18 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 589 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :8
FORMULA HealthRecord-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
[2023-03-12 16:48:22] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2023-03-12 16:48:22] [INFO ] Computed 18 place invariants in 20 ms
[2023-03-12 16:48:22] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 16:48:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 16:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:23] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-12 16:48:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:48:23] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-12 16:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 16:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:23] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-12 16:48:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-12 16:48:23] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 53 ms.
[2023-03-12 16:48:23] [INFO ] Added : 28 causal constraints over 7 iterations in 284 ms. Result :sat
Minimization took 38 ms.
[2023-03-12 16:48:23] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 16:48:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 16:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:24] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-12 16:48:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:24] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:48:24] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 5 ms to minimize.
[2023-03-12 16:48:24] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2023-03-12 16:48:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-12 16:48:24] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 44 ms.
[2023-03-12 16:48:24] [INFO ] Added : 17 causal constraints over 4 iterations in 147 ms. Result :sat
Minimization took 31 ms.
[2023-03-12 16:48:24] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:24] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-12 16:48:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:24] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-12 16:48:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2023-03-12 16:48:24] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 36 ms.
[2023-03-12 16:48:25] [INFO ] Added : 19 causal constraints over 5 iterations in 147 ms. Result :sat
Minimization took 32 ms.
[2023-03-12 16:48:25] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:25] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-12 16:48:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 16:48:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:25] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-12 16:48:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-12 16:48:25] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2023-03-12 16:48:25] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2023-03-12 16:48:25] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 0 ms to minimize.
[2023-03-12 16:48:25] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 3 ms to minimize.
[2023-03-12 16:48:25] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2023-03-12 16:48:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 449 ms
[2023-03-12 16:48:25] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 28 ms.
[2023-03-12 16:48:26] [INFO ] Added : 15 causal constraints over 4 iterations in 119 ms. Result :sat
Minimization took 31 ms.
[2023-03-12 16:48:26] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 16:48:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 16:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:26] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-12 16:48:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 16:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:26] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-12 16:48:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:48:26] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-12 16:48:26] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2023-03-12 16:48:26] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2023-03-12 16:48:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2023-03-12 16:48:26] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 27 ms.
[2023-03-12 16:48:26] [INFO ] Added : 17 causal constraints over 4 iterations in 120 ms. Result :sat
Minimization took 30 ms.
[2023-03-12 16:48:26] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-12 16:48:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 16:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:26] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-12 16:48:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:27] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:48:27] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 23 ms.
[2023-03-12 16:48:27] [INFO ] Added : 7 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 28 ms.
[2023-03-12 16:48:27] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:27] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-12 16:48:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:27] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-12 16:48:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2023-03-12 16:48:27] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-12 16:48:27] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2023-03-12 16:48:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2023-03-12 16:48:27] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 23 ms.
[2023-03-12 16:48:27] [INFO ] Added : 18 causal constraints over 4 iterations in 119 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 231 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 653 edges and 151 vertex of which 142 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 142 transition count 270
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 22 place count 136 transition count 262
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 25 place count 134 transition count 261
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 25 place count 134 transition count 258
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 33 place count 129 transition count 258
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 106 place count 56 transition count 112
Iterating global reduction 3 with 73 rules applied. Total rules applied 179 place count 56 transition count 112
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 188 place count 47 transition count 94
Iterating global reduction 3 with 9 rules applied. Total rules applied 197 place count 47 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 206 place count 47 transition count 85
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 208 place count 45 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 212 place count 43 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 43 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 220 place count 43 transition count 69
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 222 place count 42 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 234 place count 36 transition count 108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 36 transition count 107
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 247 place count 36 transition count 107
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 258 place count 36 transition count 107
Applied a total of 258 rules in 90 ms. Remains 36 /157 variables (removed 121) and now considering 107/301 (removed 194) transitions.
[2023-03-12 16:48:28] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
// Phase 1: matrix 100 rows 36 cols
[2023-03-12 16:48:28] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-12 16:48:28] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 36/157 places, 107/301 transitions.
Normalized transition count is 100 out of 107 initially.
// Phase 1: matrix 100 rows 36 cols
[2023-03-12 16:48:28] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 322765 resets, run finished after 2114 ms. (steps per millisecond=473 ) properties (out of 5) seen :4
FORMULA HealthRecord-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 37236 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 1) seen :0
[2023-03-12 16:48:30] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
// Phase 1: matrix 100 rows 36 cols
[2023-03-12 16:48:30] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:48:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 16:48:30] [INFO ] [Real]Absence check using 1 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-12 16:48:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 16:48:30] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:30] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-12 16:48:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 16:48:30] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2023-03-12 16:48:30] [INFO ] Computed and/alt/rep : 29/168/29 causal constraints (skipped 55 transitions) in 13 ms.
[2023-03-12 16:48:30] [INFO ] Added : 6 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA HealthRecord-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 8999 ms.
ITS solved all properties within timeout

BK_STOP 1678639712362

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

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