fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477300149
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for HealthRecord-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
258.168 17734.00 30420.00 278.20 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.1K Apr 30 11:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 11:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 11:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 11:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 69K May 10 09:34 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-10-UpperBounds-00
FORMULA_NAME HealthRecord-PT-10-UpperBounds-01
FORMULA_NAME HealthRecord-PT-10-UpperBounds-02
FORMULA_NAME HealthRecord-PT-10-UpperBounds-03
FORMULA_NAME HealthRecord-PT-10-UpperBounds-04
FORMULA_NAME HealthRecord-PT-10-UpperBounds-05
FORMULA_NAME HealthRecord-PT-10-UpperBounds-06
FORMULA_NAME HealthRecord-PT-10-UpperBounds-07
FORMULA_NAME HealthRecord-PT-10-UpperBounds-08
FORMULA_NAME HealthRecord-PT-10-UpperBounds-09
FORMULA_NAME HealthRecord-PT-10-UpperBounds-10
FORMULA_NAME HealthRecord-PT-10-UpperBounds-11
FORMULA_NAME HealthRecord-PT-10-UpperBounds-12
FORMULA_NAME HealthRecord-PT-10-UpperBounds-13
FORMULA_NAME HealthRecord-PT-10-UpperBounds-14
FORMULA_NAME HealthRecord-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652694454688

Running Version 202205111006
[2022-05-16 09:47:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:47:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:47:37] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2022-05-16 09:47:37] [INFO ] Transformed 158 places.
[2022-05-16 09:47:37] [INFO ] Transformed 333 transitions.
[2022-05-16 09:47:37] [INFO ] Found NUPN structural information;
[2022-05-16 09:47:37] [INFO ] Parsed PT model containing 158 places and 333 transitions in 466 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Normalized transition count is 294 out of 306 initially.
// Phase 1: matrix 294 rows 158 cols
[2022-05-16 09:47:37] [INFO ] Computed 18 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 627 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :10
FORMULA HealthRecord-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
[2022-05-16 09:47:37] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2022-05-16 09:47:37] [INFO ] Computed 18 place invariants in 8 ms
[2022-05-16 09:47:38] [INFO ] [Real]Absence check using 10 positive place invariants in 128 ms returned sat
[2022-05-16 09:47:38] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-16 09:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:38] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-05-16 09:47:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:47:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-16 09:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:38] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-05-16 09:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:47:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:47:38] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 69 ms.
[2022-05-16 09:47:39] [INFO ] Added : 12 causal constraints over 3 iterations in 252 ms. Result :sat
Minimization took 52 ms.
[2022-05-16 09:47:39] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 09:47:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-16 09:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:39] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-16 09:47:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 09:47:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:39] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2022-05-16 09:47:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:47:39] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 5 ms to minimize.
[2022-05-16 09:47:39] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2022-05-16 09:47:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2022-05-16 09:47:39] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 59 ms.
[2022-05-16 09:47:40] [INFO ] Added : 15 causal constraints over 3 iterations in 196 ms. Result :sat
Minimization took 54 ms.
[2022-05-16 09:47:40] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:47:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 09:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:40] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-05-16 09:47:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2022-05-16 09:47:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:40] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-05-16 09:47:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-16 09:47:40] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 49 ms.
[2022-05-16 09:47:40] [INFO ] Added : 14 causal constraints over 4 iterations in 197 ms. Result :sat
Minimization took 46 ms.
[2022-05-16 09:47:41] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:47:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:41] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-16 09:47:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 09:47:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:41] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-16 09:47:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-16 09:47:41] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2022-05-16 09:47:41] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2022-05-16 09:47:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2022-05-16 09:47:41] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 54 ms.
[2022-05-16 09:47:42] [INFO ] Added : 10 causal constraints over 2 iterations in 160 ms. Result :sat
Minimization took 49 ms.
[2022-05-16 09:47:42] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:47:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:42] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2022-05-16 09:47:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 09:47:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:42] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2022-05-16 09:47:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-16 09:47:42] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2022-05-16 09:47:42] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2022-05-16 09:47:43] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 1 ms to minimize.
[2022-05-16 09:47:43] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 1 ms to minimize.
[2022-05-16 09:47:43] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2022-05-16 09:47:43] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2022-05-16 09:47:43] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
[2022-05-16 09:47:43] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2022-05-16 09:47:43] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2022-05-16 09:47:44] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 1 ms to minimize.
[2022-05-16 09:47:44] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2022-05-16 09:47:44] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2022-05-16 09:47:44] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2022-05-16 09:47:44] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2022-05-16 09:47:44] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
[2022-05-16 09:47:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2350 ms
[2022-05-16 09:47:44] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 51 ms.
[2022-05-16 09:47:45] [INFO ] Added : 15 causal constraints over 3 iterations in 176 ms. Result :sat
Minimization took 59 ms.
[2022-05-16 09:47:45] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:47:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:45] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-05-16 09:47:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 09:47:45] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:45] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-05-16 09:47:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:47:45] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 41 ms.
[2022-05-16 09:47:46] [INFO ] Added : 30 causal constraints over 7 iterations in 281 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (trivial) has 234 edges and 158 vertex of which 8 / 158 are part of one of the 4 SCC in 8 ms
Free SCC test removed 4 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 666 edges and 154 vertex of which 144 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 144 transition count 281
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 10 rules applied. Total rules applied 16 place count 140 transition count 275
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 19 place count 138 transition count 274
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 138 transition count 272
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 135 transition count 272
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 102 place count 57 transition count 116
Iterating global reduction 3 with 78 rules applied. Total rules applied 180 place count 57 transition count 116
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 189 place count 48 transition count 98
Iterating global reduction 3 with 9 rules applied. Total rules applied 198 place count 48 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 207 place count 48 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 46 transition count 83
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 213 place count 44 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 44 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 221 place count 44 transition count 73
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 223 place count 43 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -34
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 233 place count 38 transition count 106
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 38 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 237 place count 36 transition count 104
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 248 place count 36 transition count 104
Applied a total of 248 rules in 137 ms. Remains 36 /158 variables (removed 122) and now considering 104/306 (removed 202) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/158 places, 104/306 transitions.
Successfully produced net in file /tmp/petri1000_15444303877204651693.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
Normalized transition count is 90 out of 103 initially.
// Phase 1: matrix 90 rows 36 cols
[2022-05-16 09:47:46] [INFO ] Computed 7 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 134589 resets, run finished after 2501 ms. (steps per millisecond=399 ) properties (out of 4) seen :3
FORMULA HealthRecord-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 20537 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties (out of 1) seen :0
[2022-05-16 09:47:49] [INFO ] Flow matrix only has 90 transitions (discarded 13 similar events)
// Phase 1: matrix 90 rows 36 cols
[2022-05-16 09:47:49] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 09:47:49] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-16 09:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-16 09:47:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:49] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-16 09:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:49] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-16 09:47:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 09:47:49] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2022-05-16 09:47:49] [INFO ] Computed and/alt/rep : 19/63/19 causal constraints (skipped 55 transitions) in 13 ms.
[2022-05-16 09:47:49] [INFO ] Added : 9 causal constraints over 2 iterations in 46 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 103/103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 35 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 35 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 34 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 34 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 33 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 33 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 32 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 32 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 13 place count 32 transition count 86
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 1 with 2 rules applied. Total rules applied 15 place count 31 transition count 86
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 31 transition count 83
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 31 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 30 transition count 82
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 30 transition count 142
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 28 transition count 141
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 28 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 27 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 27 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 26 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 26 transition count 103
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 42 place count 26 transition count 93
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 51 place count 26 transition count 93
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 26 transition count 93
Applied a total of 52 rules in 46 ms. Remains 26 /36 variables (removed 10) and now considering 93/103 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/36 places, 93/103 transitions.
Successfully produced net in file /tmp/petri1001_6713509630733766673.dot
Successfully produced net in file /tmp/petri1002_16335374079243004738.dot
Successfully produced net in file /tmp/petri1003_13031438213223609751.dot
Successfully produced net in file /tmp/petri1004_3327594900437627957.dot
Successfully produced net in file /tmp/petri1005_18387690515799272029.dot
Successfully produced net in file /tmp/petri1006_15531509843106030197.dot
Successfully produced net in file /tmp/petri1007_1468666862844475768.dot
Successfully produced net in file /tmp/petri1008_17961014727271434595.dot
Drop transitions removed 8 transitions
Dominated transitions for bounds rules discarded 8 transitions
Normalized transition count is 67 out of 85 initially.
// Phase 1: matrix 67 rows 26 cols
[2022-05-16 09:47:49] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 8 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 1) seen :0
[2022-05-16 09:47:52] [INFO ] Flow matrix only has 67 transitions (discarded 18 similar events)
// Phase 1: matrix 67 rows 26 cols
[2022-05-16 09:47:52] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:52] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 09:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 09:47:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:47:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 09:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:47:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 09:47:52] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-16 09:47:52] [INFO ] [Nat]Added 19 Read/Feed constraints in 6 ms returned sat
[2022-05-16 09:47:52] [INFO ] Computed and/alt/rep : 4/11/4 causal constraints (skipped 47 transitions) in 10 ms.
[2022-05-16 09:47:52] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA HealthRecord-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 15641 ms.

BK_STOP 1652694472422

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-10, 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 r114-smll-165264477300149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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