Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593000341.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Angiogenesis-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593000341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.5K Feb 26 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-00
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-01
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-02
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-03
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-04
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-05
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-06
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-07
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-08
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-09
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-10
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-11
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-12
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-13
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-14
FORMULA_NAME Angiogenesis-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678509297855

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Angiogenesis-PT-15
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 04:35:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 04:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:35:01] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-11 04:35:01] [INFO ] Transformed 39 places.
[2023-03-11 04:35:01] [INFO ] Transformed 64 transitions.
[2023-03-11 04:35:01] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 64 rows 39 cols
[2023-03-11 04:35:01] [INFO ] Computed 8 place invariants in 5 ms
FORMULA Angiogenesis-PT-15-UpperBounds-09 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-15-UpperBounds-03 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :121
FORMULA Angiogenesis-PT-15-UpperBounds-14 15 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-13 15 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-11 15 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-10 15 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-08 15 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-04 15 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-02 15 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :9
FORMULA Angiogenesis-PT-15-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 04:35:01] [INFO ] Invariant cache hit.
[2023-03-11 04:35:01] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2023-03-11 04:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:01] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-11 04:35:01] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-11 04:35:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-11 04:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:02] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-11 04:35:02] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 8 ms.
[2023-03-11 04:35:02] [INFO ] Added : 47 causal constraints over 10 iterations in 165 ms. Result :sat
Minimization took 30 ms.
[2023-03-11 04:35:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 04:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:02] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 04:35:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 04:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:02] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-11 04:35:02] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 4 ms.
[2023-03-11 04:35:02] [INFO ] Added : 55 causal constraints over 11 iterations in 99 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 04:35:02] [INFO ] [Real]Absence check using 8 positive place invariants in 30 ms returned sat
[2023-03-11 04:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:02] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-11 04:35:02] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-11 04:35:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 47 ms returned sat
[2023-03-11 04:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:03] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-11 04:35:03] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 4 ms.
[2023-03-11 04:35:03] [INFO ] Added : 52 causal constraints over 11 iterations in 159 ms. Result :sat
Minimization took 41 ms.
[2023-03-11 04:35:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 04:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:03] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-11 04:35:03] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-11 04:35:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 04:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 04:35:03] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-11 04:35:03] [INFO ] Added : 52 causal constraints over 11 iterations in 176 ms. Result :sat
Minimization took 19 ms.
[2023-03-11 04:35:03] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 04:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-11 04:35:03] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 4 ms.
[2023-03-11 04:35:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 04:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:03] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 04:35:03] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-11 04:35:03] [INFO ] Added : 52 causal constraints over 11 iterations in 190 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [15, 15, 15, 7, 15] Max seen :[1, 14, 2, 1, 4]
FORMULA Angiogenesis-PT-15-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-01 15 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-00 15 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 36 transition count 62
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 25 place count 26 transition count 52
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 79 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 10 rules applied. Total rules applied 35 place count 25 transition count 43
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 25 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 20 transition count 48
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 56 place count 20 transition count 38
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 62 place count 20 transition count 32
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 67 place count 20 transition count 27
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 74 place count 15 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 15 transition count 24
Applied a total of 75 rules in 24 ms. Remains 15 /39 variables (removed 24) and now considering 24/64 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 15/39 places, 24/64 transitions.
Normalized transition count is 23 out of 24 initially.
// Phase 1: matrix 23 rows 15 cols
[2023-03-11 04:35:04] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 2) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 2) seen :7
[2023-03-11 04:35:05] [INFO ] Flow matrix only has 23 transitions (discarded 1 similar events)
// Phase 1: matrix 23 rows 15 cols
[2023-03-11 04:35:05] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-11 04:35:05] [INFO ] [Real]Absence check using 6 positive place invariants in 35 ms returned sat
[2023-03-11 04:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-11 04:35:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 04:35:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 04:35:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 04:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:05] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 04:35:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2023-03-11 04:35:05] [INFO ] Computed and/alt/rep : 22/72/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 04:35:05] [INFO ] Added : 19 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 50 ms.
[2023-03-11 04:35:05] [INFO ] [Real]Absence check using 6 positive place invariants in 22 ms returned sat
[2023-03-11 04:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 04:35:05] [INFO ] [Real]Added 1 Read/Feed constraints in 22 ms returned sat
[2023-03-11 04:35:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 04:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-11 04:35:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 04:35:05] [INFO ] Computed and/alt/rep : 22/72/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 04:35:06] [INFO ] Added : 19 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [15, 15] Max seen :[10, 10]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 24/24 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-11 04:35:06] [INFO ] Flow matrix only has 23 transitions (discarded 1 similar events)
[2023-03-11 04:35:06] [INFO ] Invariant cache hit.
[2023-03-11 04:35:06] [INFO ] Implicit Places using invariants in 64 ms returned [5, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 11/15 places, 24/24 transitions.
Graph (trivial) has 14 edges and 11 vertex of which 6 / 11 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 11
Applied a total of 2 rules in 5 ms. Remains 7 /11 variables (removed 4) and now considering 11/24 (removed 13) transitions.
[2023-03-11 04:35:06] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 7 cols
[2023-03-11 04:35:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:35:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 04:35:06] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2023-03-11 04:35:06] [INFO ] Invariant cache hit.
[2023-03-11 04:35:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 04:35:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 7/15 places, 11/24 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 150 ms. Remains : 7/15 places, 11/24 transitions.
Normalized transition count is 10 out of 11 initially.
// Phase 1: matrix 10 rows 7 cols
[2023-03-11 04:35:06] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=3472 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=5319 ) properties (out of 2) seen :7
[2023-03-11 04:35:06] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 7 cols
[2023-03-11 04:35:06] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:35:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 04:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 04:35:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 04:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:07] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-11 04:35:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 04:35:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 04:35:07] [INFO ] Computed and/alt/rep : 10/23/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 04:35:07] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :unsat
[2023-03-11 04:35:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 04:35:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:07] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-11 04:35:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:35:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 04:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:35:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 04:35:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 04:35:07] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 6 ms to minimize.
[2023-03-11 04:35:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
Current structural bounds on expressions (after SMT) : [14, 14] Max seen :[14, 14]
FORMULA Angiogenesis-PT-15-UpperBounds-12 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Angiogenesis-PT-15-UpperBounds-05 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6231 ms.

BK_STOP 1678509307454

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Angiogenesis-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-5348"
echo " Executing tool itstools"
echo " Input is Angiogenesis-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 r005-oct2-167813593000341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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