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.r199-smll-167840345800349.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 lolaxred
Input is HealthRecord-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345800349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 73K 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-15-UpperBounds-00
FORMULA_NAME HealthRecord-PT-15-UpperBounds-01
FORMULA_NAME HealthRecord-PT-15-UpperBounds-02
FORMULA_NAME HealthRecord-PT-15-UpperBounds-03
FORMULA_NAME HealthRecord-PT-15-UpperBounds-04
FORMULA_NAME HealthRecord-PT-15-UpperBounds-05
FORMULA_NAME HealthRecord-PT-15-UpperBounds-06
FORMULA_NAME HealthRecord-PT-15-UpperBounds-07
FORMULA_NAME HealthRecord-PT-15-UpperBounds-08
FORMULA_NAME HealthRecord-PT-15-UpperBounds-09
FORMULA_NAME HealthRecord-PT-15-UpperBounds-10
FORMULA_NAME HealthRecord-PT-15-UpperBounds-11
FORMULA_NAME HealthRecord-PT-15-UpperBounds-12
FORMULA_NAME HealthRecord-PT-15-UpperBounds-13
FORMULA_NAME HealthRecord-PT-15-UpperBounds-14
FORMULA_NAME HealthRecord-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678521135449

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 07:52:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 07:52:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:52:20] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-11 07:52:20] [INFO ] Transformed 163 places.
[2023-03-11 07:52:20] [INFO ] Transformed 348 transitions.
[2023-03-11 07:52:20] [INFO ] Found NUPN structural information;
[2023-03-11 07:52:20] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Normalized transition count is 307 out of 319 initially.
// Phase 1: matrix 307 rows 163 cols
[2023-03-11 07:52:20] [INFO ] Computed 18 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 919 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 16) seen :7
FORMULA HealthRecord-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :1
FORMULA HealthRecord-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 07:52:20] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2023-03-11 07:52:20] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-11 07:52:21] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-11 07:52:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-11 07:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:21] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-11 07:52:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 07:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:22] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2023-03-11 07:52:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:52:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 07:52:22] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 6 ms to minimize.
[2023-03-11 07:52:22] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2023-03-11 07:52:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-03-11 07:52:22] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 65 ms.
[2023-03-11 07:52:22] [INFO ] Added : 12 causal constraints over 3 iterations in 274 ms. Result :sat
Minimization took 50 ms.
[2023-03-11 07:52:22] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-11 07:52:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 07:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:22] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-11 07:52:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 07:52:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 07:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:23] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-11 07:52:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 07:52:23] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2023-03-11 07:52:23] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 3 ms to minimize.
[2023-03-11 07:52:23] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2023-03-11 07:52:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 417 ms
[2023-03-11 07:52:23] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 48 ms.
[2023-03-11 07:52:23] [INFO ] Added : 19 causal constraints over 4 iterations in 214 ms. Result :sat
Minimization took 53 ms.
[2023-03-11 07:52:24] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 07:52:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:24] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-11 07:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:24] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-11 07:52:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 07:52:24] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 48 ms.
[2023-03-11 07:52:24] [INFO ] Added : 9 causal constraints over 2 iterations in 152 ms. Result :sat
Minimization took 45 ms.
[2023-03-11 07:52:24] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-11 07:52:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:24] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-11 07:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 07:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:25] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-11 07:52:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 07:52:25] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 1 ms to minimize.
[2023-03-11 07:52:25] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2023-03-11 07:52:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2023-03-11 07:52:25] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 49 ms.
[2023-03-11 07:52:25] [INFO ] Added : 15 causal constraints over 3 iterations in 182 ms. Result :sat
Minimization took 48 ms.
[2023-03-11 07:52:25] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 07:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:26] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-11 07:52:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:26] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-11 07:52:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 07:52:26] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2023-03-11 07:52:26] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2023-03-11 07:52:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-11 07:52:26] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 55 ms.
[2023-03-11 07:52:26] [INFO ] Added : 19 causal constraints over 4 iterations in 206 ms. Result :sat
Minimization took 55 ms.
[2023-03-11 07:52:27] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:27] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 07:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:27] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 07:52:27] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 42 ms.
[2023-03-11 07:52:27] [INFO ] Added : 17 causal constraints over 5 iterations in 220 ms. Result :sat
Minimization took 56 ms.
[2023-03-11 07:52:27] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2023-03-11 07:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:28] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-11 07:52:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:28] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-11 07:52:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 07:52:28] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 51 ms.
[2023-03-11 07:52:28] [INFO ] Added : 9 causal constraints over 2 iterations in 181 ms. Result :sat
Minimization took 46 ms.
[2023-03-11 07:52:28] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 07:52:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:28] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-11 07:52:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:52:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 07:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:29] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-11 07:52:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 07:52:29] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 43 ms.
[2023-03-11 07:52:29] [INFO ] Added : 10 causal constraints over 2 iterations in 142 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 241 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 10 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 695 edges and 160 vertex of which 134 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 134 transition count 172
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 204 place count 51 transition count 89
Iterating global reduction 1 with 83 rules applied. Total rules applied 287 place count 51 transition count 89
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 287 place count 51 transition count 82
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 301 place count 44 transition count 82
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 316 place count 29 transition count 59
Iterating global reduction 1 with 15 rules applied. Total rules applied 331 place count 29 transition count 59
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 340 place count 29 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 343 place count 26 transition count 45
Iterating global reduction 2 with 3 rules applied. Total rules applied 346 place count 26 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 26 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 24 transition count 42
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 24 transition count 42
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 357 place count 24 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 363 place count 21 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 364 place count 21 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 365 place count 20 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 369 place count 17 transition count 30
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 375 place count 16 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 375 place count 16 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 379 place count 14 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 380 place count 14 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 382 place count 13 transition count 21
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 385 place count 13 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 387 place count 12 transition count 17
Applied a total of 387 rules in 164 ms. Remains 12 /163 variables (removed 151) and now considering 17/319 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 12/163 places, 17/319 transitions.
Normalized transition count is 15 out of 17 initially.
// Phase 1: matrix 15 rows 12 cols
[2023-03-11 07:52:29] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1110 ms. (steps per millisecond=900 ) properties (out of 4) seen :4
FORMULA HealthRecord-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10984 ms.
ITS solved all properties within timeout

BK_STOP 1678521152042

--------------------
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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is HealthRecord-PT-15, 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 r199-smll-167840345800349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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