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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.1K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 53K 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 1621283327572

Running Version 0
[2021-05-17 20:28:49] [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:28:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:28:49] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-17 20:28:49] [INFO ] Transformed 163 places.
[2021-05-17 20:28:49] [INFO ] Transformed 348 transitions.
[2021-05-17 20:28:49] [INFO ] Found NUPN structural information;
[2021-05-17 20:28:49] [INFO ] Parsed PT model containing 163 places and 348 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Normalized transition count is 307 out of 319 initially.
// Phase 1: matrix 307 rows 163 cols
[2021-05-17 20:28:49] [INFO ] Computed 18 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 922 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :5
FORMULA net-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-07 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-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1
FORMULA net-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
[2021-05-17 20:28:49] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2021-05-17 20:28:49] [INFO ] Computed 18 place invariants in 9 ms
[2021-05-17 20:28:50] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:50] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-17 20:28:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:50] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-17 20:28:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:28:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:28:50] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 37 ms.
[2021-05-17 20:28:50] [INFO ] Added : 84 causal constraints over 17 iterations in 312 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:28:50] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:50] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-17 20:28:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-17 20:28:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:28:51] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 24 ms.
[2021-05-17 20:28:51] [INFO ] Added : 84 causal constraints over 17 iterations in 253 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:28:51] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:51] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:28:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:51] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:28:51] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 19 ms.
[2021-05-17 20:28:51] [INFO ] Added : 84 causal constraints over 17 iterations in 241 ms. Result :sat
Minimization took 41 ms.
[2021-05-17 20:28:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:51] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-17 20:28:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:51] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:28:52] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 19 ms.
[2021-05-17 20:28:52] [INFO ] Added : 85 causal constraints over 17 iterations in 245 ms. Result :sat
Minimization took 29 ms.
[2021-05-17 20:28:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:52] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-17 20:28:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:52] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:28:52] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 45 ms.
[2021-05-17 20:28:52] [INFO ] Added : 85 causal constraints over 17 iterations in 258 ms. Result :sat
Minimization took 29 ms.
[2021-05-17 20:28:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:52] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-17 20:28:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:52] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-17 20:28:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:28:53] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 4 ms to minimize.
[2021-05-17 20:28:53] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2021-05-17 20:28:53] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2021-05-17 20:28:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2021-05-17 20:28:53] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 17 ms.
[2021-05-17 20:28:53] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2021-05-17 20:28:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-17 20:28:53] [INFO ] Added : 81 causal constraints over 17 iterations in 313 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:28:53] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:28:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:53] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 20:28:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:53] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-17 20:28:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:28:53] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 16 ms.
[2021-05-17 20:28:54] [INFO ] Added : 81 causal constraints over 17 iterations in 246 ms. Result :sat
Minimization took 28 ms.
[2021-05-17 20:28:54] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:54] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-17 20:28:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:54] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:28:54] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 31 ms.
[2021-05-17 20:28:54] [INFO ] Added : 80 causal constraints over 16 iterations in 259 ms. Result :sat
Minimization took 28 ms.
[2021-05-17 20:28:54] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:54] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-17 20:28:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:54] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-17 20:28:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:28:54] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 30 ms.
[2021-05-17 20:28:55] [INFO ] Added : 83 causal constraints over 17 iterations in 236 ms. Result :sat
Minimization took 29 ms.
[2021-05-17 20:28:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:55] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-17 20:28:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:28:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:28:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:28:55] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-17 20:28:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:28:55] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 30 ms.
[2021-05-17 20:28:55] [INFO ] Added : 92 causal constraints over 19 iterations in 260 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 21200 steps, including 1128 resets, run finished after 93 ms. (steps per millisecond=227 ) properties (out of 10) seen :9 could not realise parikh vector
FORMULA net-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 19000 steps, including 496 resets, run finished after 61 ms. (steps per millisecond=311 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18600 steps, including 633 resets, run finished after 56 ms. (steps per millisecond=332 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18500 steps, including 844 resets, run finished after 57 ms. (steps per millisecond=324 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18800 steps, including 1218 resets, run finished after 46 ms. (steps per millisecond=408 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19200 steps, including 1196 resets, run finished after 74 ms. (steps per millisecond=259 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19300 steps, including 768 resets, run finished after 80 ms. (steps per millisecond=241 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19000 steps, including 1023 resets, run finished after 50 ms. (steps per millisecond=380 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19200 steps, including 1079 resets, run finished after 49 ms. (steps per millisecond=391 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19000 steps, including 656 resets, run finished after 53 ms. (steps per millisecond=358 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 163 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions, iteration 0 : 163/163 places, 317/317 transitions.
Graph (trivial) has 247 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 693 edges and 160 vertex of which 150 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 0 with 3 rules applied. Total rules applied 5 place count 149 transition count 295
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 rules applied. Total rules applied 11 place count 147 transition count 291
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 14 place count 145 transition count 290
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 100 place count 59 transition count 118
Iterating global reduction 3 with 86 rules applied. Total rules applied 186 place count 59 transition count 118
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 196 place count 49 transition count 98
Iterating global reduction 3 with 10 rules applied. Total rules applied 206 place count 49 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 215 place count 49 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 218 place count 46 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 221 place count 46 transition count 80
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 224 place count 43 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 43 transition count 74
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 236 place count 43 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 248 place count 37 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 37 transition count 97
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 254 place count 37 transition count 92
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 259 place count 32 transition count 92
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 32 transition count 90
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 264 place count 32 transition count 171
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 268 place count 29 transition count 170
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 271 place count 29 transition count 167
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 272 place count 28 transition count 123
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 28 transition count 123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 274 place count 27 transition count 121
Iterating global reduction 7 with 1 rules applied. Total rules applied 275 place count 27 transition count 121
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 285 place count 27 transition count 111
Applied a total of 285 rules in 64 ms. Remains 27 /163 variables (removed 136) and now considering 111/317 (removed 206) transitions.
[2021-05-17 20:28:56] [INFO ] Flow matrix only has 81 transitions (discarded 30 similar events)
// Phase 1: matrix 81 rows 27 cols
[2021-05-17 20:28:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:28:56] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/163 places, 111/317 transitions.
Successfully produced net in file /tmp/petri1000_4131646961811123151.dot
Successfully produced net in file /tmp/petri1001_11480779570925873721.dot
Successfully produced net in file /tmp/petri1002_12842655271414620828.dot
Successfully produced net in file /tmp/petri1003_10806759437476551989.dot
Successfully produced net in file /tmp/petri1004_10645886211956714828.dot
Successfully produced net in file /tmp/petri1005_11165443340893383923.dot
Successfully produced net in file /tmp/petri1006_8898188363090134515.dot
Drop transitions removed 7 transitions
Dominated transitions for bounds rules discarded 7 transitions
Normalized transition count is 74 out of 104 initially.
// Phase 1: matrix 74 rows 27 cols
[2021-05-17 20:28:56] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 150648 resets, run finished after 2624 ms. (steps per millisecond=381 ) properties (out of 1) seen :1
FORMULA net-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621283340079

--------------------
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-15"
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-15, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156400371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-15.tgz
mv HealthRecord-PT-15 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;