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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K May 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 51K 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 1621282092066

Running Version 0
[2021-05-17 20:08: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:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:08:24] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-17 20:08:25] [INFO ] Transformed 160 places.
[2021-05-17 20:08:25] [INFO ] Transformed 340 transitions.
[2021-05-17 20:08:25] [INFO ] Found NUPN structural information;
[2021-05-17 20:08:25] [INFO ] Parsed PT model containing 160 places and 340 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Normalized transition count is 300 out of 312 initially.
// Phase 1: matrix 300 rows 160 cols
[2021-05-17 20:08:25] [INFO ] Computed 18 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 724 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :9
FORMULA net-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-10 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-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
FORMULA net-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
[2021-05-17 20:08:25] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-17 20:08:25] [INFO ] Computed 18 place invariants in 7 ms
[2021-05-17 20:08:25] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-17 20:08:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:25] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-17 20:08:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:08:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:25] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-17 20:08:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:08:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:08:25] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 31 ms.
[2021-05-17 20:08:25] [INFO ] Added : 83 causal constraints over 17 iterations in 295 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:08:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:26] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-17 20:08:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:26] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:26] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 24 ms.
[2021-05-17 20:08:26] [INFO ] Added : 82 causal constraints over 17 iterations in 252 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:08:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:26] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-17 20:08:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:26] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-17 20:08:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:26] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 25 ms.
[2021-05-17 20:08:26] [INFO ] Added : 79 causal constraints over 16 iterations in 236 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:08:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:27] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:27] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:08:27] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2021-05-17 20:08:27] [INFO ] Added : 93 causal constraints over 20 iterations in 325 ms. Result :sat
Minimization took 31 ms.
[2021-05-17 20:08:27] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:27] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-17 20:08:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-17 20:08:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:27] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2021-05-17 20:08:28] [INFO ] Added : 83 causal constraints over 17 iterations in 237 ms. Result :sat
Minimization took 29 ms.
[2021-05-17 20:08:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:28] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-17 20:08:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:08:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:28] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-17 20:08:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:28] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 23 ms.
[2021-05-17 20:08:28] [INFO ] Added : 85 causal constraints over 17 iterations in 233 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 19400 steps, including 838 resets, run finished after 102 ms. (steps per millisecond=190 ) properties (out of 6) seen :4 could not realise parikh vector
FORMULA net-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18700 steps, including 879 resets, run finished after 65 ms. (steps per millisecond=287 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA net-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 19800 steps, including 767 resets, run finished after 60 ms. (steps per millisecond=330 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18100 steps, including 403 resets, run finished after 58 ms. (steps per millisecond=312 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18200 steps, including 686 resets, run finished after 53 ms. (steps per millisecond=343 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18100 steps, including 1002 resets, run finished after 47 ms. (steps per millisecond=385 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 160 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 160/160 places, 311/311 transitions.
Graph (trivial) has 245 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 147 transition count 287
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 143 transition count 281
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 141 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 141 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 140 transition count 279
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 104 place count 57 transition count 113
Iterating global reduction 3 with 83 rules applied. Total rules applied 187 place count 57 transition count 113
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 197 place count 47 transition count 93
Iterating global reduction 3 with 10 rules applied. Total rules applied 207 place count 47 transition count 93
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 216 place count 47 transition count 84
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 219 place count 44 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 44 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 225 place count 41 transition count 69
Iterating global reduction 4 with 3 rules applied. Total rules applied 228 place count 41 transition count 69
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 237 place count 41 transition count 60
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 239 place count 40 transition count 59
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
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 249 place count 35 transition count 90
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 35 transition count 89
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 255 place count 35 transition count 84
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 260 place count 30 transition count 84
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 262 place count 30 transition count 82
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 30 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 267 place count 28 transition count 147
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 270 place count 28 transition count 144
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 271 place count 27 transition count 108
Iterating global reduction 7 with 1 rules applied. Total rules applied 272 place count 27 transition count 108
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 273 place count 26 transition count 106
Iterating global reduction 7 with 1 rules applied. Total rules applied 274 place count 26 transition count 106
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 284 place count 26 transition count 96
Applied a total of 284 rules in 66 ms. Remains 26 /160 variables (removed 134) and now considering 96/311 (removed 215) transitions.
[2021-05-17 20:08:29] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 26 cols
[2021-05-17 20:08:29] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:08:29] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/160 places, 96/311 transitions.
Normalized transition count is 72 out of 96 initially.
// Phase 1: matrix 72 rows 26 cols
[2021-05-17 20:08:29] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 207542 resets, run finished after 2500 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 26005 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 1) seen :0
[2021-05-17 20:08:32] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 26 cols
[2021-05-17 20:08:32] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:08:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 20:08:32] [INFO ] [Real]Absence check using 1 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:32] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 20:08:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 20:08:32] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-17 20:08:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-17 20:08:32] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:08:32] [INFO ] Computed and/alt/rep : 6/28/6 causal constraints (skipped 50 transitions) in 8 ms.
[2021-05-17 20:08:32] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3500 steps, including 751 resets, run finished after 12 ms. (steps per millisecond=291 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 26/26 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2021-05-17 20:08:32] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 26 cols
[2021-05-17 20:08:32] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:08:32] [INFO ] Implicit Places using invariants in 21 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
[2021-05-17 20:08:32] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-17 20:08:32] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 25 cols
[2021-05-17 20:08:32] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-17 20:08:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2021-05-17 20:08:32] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-17 20:08:32] [INFO ] Flow matrix only has 72 transitions (discarded 24 similar events)
// Phase 1: matrix 72 rows 25 cols
[2021-05-17 20:08:32] [INFO ] Computed 8 place invariants in 8 ms
[2021-05-17 20:08:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 96/96 transitions.
Normalized transition count is 72 out of 96 initially.
// Phase 1: matrix 72 rows 25 cols
[2021-05-17 20:08:32] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 207808 resets, run finished after 2376 ms. (steps per millisecond=420 ) properties (out of 1) seen :1
FORMULA net-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621282119839

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

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