Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 84K May 12 08:13 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 net-UpperBounds-00
FORMULA_NAME net-UpperBounds-01
FORMULA_NAME net-UpperBounds-02
FORMULA_NAME net-UpperBounds-03
FORMULA_NAME net-UpperBounds-04
FORMULA_NAME net-UpperBounds-05
FORMULA_NAME net-UpperBounds-06
FORMULA_NAME net-UpperBounds-07
FORMULA_NAME net-UpperBounds-08
FORMULA_NAME net-UpperBounds-09
FORMULA_NAME net-UpperBounds-10
FORMULA_NAME net-UpperBounds-11
FORMULA_NAME net-UpperBounds-12
FORMULA_NAME net-UpperBounds-13
FORMULA_NAME net-UpperBounds-14
FORMULA_NAME net-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621283423121

Running Version 0
[2021-05-17 20:30:24] [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]
[2021-05-17 20:30:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:30:24] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-17 20:30:24] [INFO ] Transformed 453 places.
[2021-05-17 20:30:24] [INFO ] Transformed 594 transitions.
[2021-05-17 20:30:24] [INFO ] Found NUPN structural information;
[2021-05-17 20:30:24] [INFO ] Parsed PT model containing 453 places and 594 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 594 rows 453 cols
[2021-05-17 20:30:24] [INFO ] Computed 14 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :6
FORMULA net-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :2
FORMULA net-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :1
FORMULA net-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 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 17 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 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
// Phase 1: matrix 594 rows 453 cols
[2021-05-17 20:30:25] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-17 20:30:25] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-17 20:30:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:25] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-17 20:30:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-17 20:30:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:25] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-17 20:30:25] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 39 ms.
[2021-05-17 20:30:26] [INFO ] Added : 58 causal constraints over 12 iterations in 408 ms. Result :sat
Minimization took 50 ms.
[2021-05-17 20:30:26] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-17 20:30:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:26] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-17 20:30:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:30:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:26] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-17 20:30:26] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 4 ms to minimize.
[2021-05-17 20:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2021-05-17 20:30:26] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 32 ms.
[2021-05-17 20:30:27] [INFO ] Added : 94 causal constraints over 19 iterations in 557 ms. Result :sat
Minimization took 58 ms.
[2021-05-17 20:30:27] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:27] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-17 20:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:27] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-17 20:30:28] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 46 ms.
[2021-05-17 20:30:29] [INFO ] Added : 233 causal constraints over 47 iterations in 1359 ms. Result :sat
Minimization took 81 ms.
[2021-05-17 20:30:29] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:30:29] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:29] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-17 20:30:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-17 20:30:29] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-17 20:30:30] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2021-05-17 20:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2021-05-17 20:30:30] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 32 ms.
[2021-05-17 20:30:30] [INFO ] Added : 98 causal constraints over 20 iterations in 498 ms. Result :sat
Minimization took 58 ms.
[2021-05-17 20:30:30] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-17 20:30:30] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:30] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-17 20:30:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:30:30] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:31] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-17 20:30:31] [INFO ] Deduced a trap composed of 169 places in 101 ms of which 1 ms to minimize.
[2021-05-17 20:30:31] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 0 ms to minimize.
[2021-05-17 20:30:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2021-05-17 20:30:31] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 49 ms.
[2021-05-17 20:30:31] [INFO ] Added : 89 causal constraints over 18 iterations in 497 ms. Result :sat
Minimization took 67 ms.
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-17 20:30:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:32] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-17 20:30:32] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 26 ms.
[2021-05-17 20:30:32] [INFO ] Added : 58 causal constraints over 12 iterations in 320 ms. Result :sat
Minimization took 48 ms.
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:33] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-17 20:30:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:30:33] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:33] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-17 20:30:33] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 31 ms.
[2021-05-17 20:30:33] [INFO ] Added : 60 causal constraints over 12 iterations in 317 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 6400 steps, including 114 resets, run finished after 25 ms. (steps per millisecond=256 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6200 steps, including 110 resets, run finished after 20 ms. (steps per millisecond=310 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10400 steps, including 164 resets, run finished after 34 ms. (steps per millisecond=305 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA net-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11400 steps, including 162 resets, run finished after 32 ms. (steps per millisecond=356 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 30200 steps, including 253 resets, run finished after 96 ms. (steps per millisecond=314 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA net-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11400 steps, including 181 resets, run finished after 38 ms. (steps per millisecond=300 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6100 steps, including 98 resets, run finished after 21 ms. (steps per millisecond=290 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 527 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 4 ms
Free SCC test removed 32 places
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 820 edges and 421 vertex of which 380 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 313 rules applied. Total rules applied 315 place count 380 transition count 201
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 244 rules applied. Total rules applied 559 place count 164 transition count 173
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 573 place count 152 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 575 place count 150 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 575 place count 150 transition count 157
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 603 place count 136 transition count 157
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 658 place count 81 transition count 102
Iterating global reduction 4 with 55 rules applied. Total rules applied 713 place count 81 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 713 place count 81 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 725 place count 75 transition count 96
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 731 place count 69 transition count 90
Iterating global reduction 4 with 6 rules applied. Total rules applied 737 place count 69 transition count 90
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 741 place count 65 transition count 86
Iterating global reduction 4 with 4 rules applied. Total rules applied 745 place count 65 transition count 86
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 751 place count 59 transition count 79
Iterating global reduction 4 with 6 rules applied. Total rules applied 757 place count 59 transition count 79
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 762 place count 59 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 763 place count 58 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 764 place count 58 transition count 73
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 786 place count 47 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 794 place count 43 transition count 77
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 795 place count 43 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 796 place count 42 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 797 place count 42 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 798 place count 41 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 799 place count 41 transition count 74
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 800 place count 41 transition count 73
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 807 place count 41 transition count 66
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 815 place count 34 transition count 65
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 816 place count 34 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 817 place count 34 transition count 64
Applied a total of 817 rules in 126 ms. Remains 34 /453 variables (removed 419) and now considering 64/594 (removed 530) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/453 places, 64/594 transitions.
Normalized transition count is 55 out of 64 initially.
// Phase 1: matrix 55 rows 34 cols
[2021-05-17 20:30:34] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 26669 resets, run finished after 2085 ms. (steps per millisecond=479 ) properties (out of 5) seen :5
FORMULA net-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621283437208

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-16"
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-16, 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 r292-tall-162124156400379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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