Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 332K Jun 2 16:33 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 CO4-PT-19-UpperBounds-00
FORMULA_NAME CO4-PT-19-UpperBounds-01
FORMULA_NAME CO4-PT-19-UpperBounds-02
FORMULA_NAME CO4-PT-19-UpperBounds-03
FORMULA_NAME CO4-PT-19-UpperBounds-04
FORMULA_NAME CO4-PT-19-UpperBounds-05
FORMULA_NAME CO4-PT-19-UpperBounds-06
FORMULA_NAME CO4-PT-19-UpperBounds-07
FORMULA_NAME CO4-PT-19-UpperBounds-08
FORMULA_NAME CO4-PT-19-UpperBounds-09
FORMULA_NAME CO4-PT-19-UpperBounds-10
FORMULA_NAME CO4-PT-19-UpperBounds-11
FORMULA_NAME CO4-PT-19-UpperBounds-12
FORMULA_NAME CO4-PT-19-UpperBounds-13
FORMULA_NAME CO4-PT-19-UpperBounds-14
FORMULA_NAME CO4-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717355591172

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 19:13:12] [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]
[2024-06-02 19:13:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:13:12] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-06-02 19:13:12] [INFO ] Transformed 1174 places.
[2024-06-02 19:13:12] [INFO ] Transformed 1447 transitions.
[2024-06-02 19:13:12] [INFO ] Found NUPN structural information;
[2024-06-02 19:13:12] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 201 places in 16 ms
Reduce places removed 201 places and 274 transitions.
FORMULA CO4-PT-19-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1173 rows 973 cols
[2024-06-02 19:13:12] [INFO ] Computed 12 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (214 resets) in 44 ms. (222 steps per ms)
FORMULA CO4-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110008 steps (390 resets) in 108 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:13:12] [INFO ] Invariant cache hit.
[2024-06-02 19:13:13] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-06-02 19:13:13] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:13] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-06-02 19:13:13] [INFO ] Deduced a trap composed of 126 places in 333 ms of which 85 ms to minimize.
[2024-06-02 19:13:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 51 ms returned sat
[2024-06-02 19:13:14] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:14] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-06-02 19:13:14] [INFO ] Deduced a trap composed of 126 places in 177 ms of which 8 ms to minimize.
[2024-06-02 19:13:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2024-06-02 19:13:15] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 77 ms.
[2024-06-02 19:13:16] [INFO ] Added : 152 causal constraints over 31 iterations in 1850 ms. Result :sat
Minimization took 624 ms.
[2024-06-02 19:13:17] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2024-06-02 19:13:17] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:17] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-06-02 19:13:18] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 58 ms.
[2024-06-02 19:13:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2024-06-02 19:13:18] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 6 ms returned sat
[2024-06-02 19:13:18] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2024-06-02 19:13:19] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 77 ms.
[2024-06-02 19:13:20] [INFO ] Added : 143 causal constraints over 29 iterations in 1770 ms. Result :sat
Minimization took 587 ms.
[2024-06-02 19:13:21] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 19:13:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:21] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-06-02 19:13:21] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 51 ms.
[2024-06-02 19:13:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2024-06-02 19:13:22] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:22] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2024-06-02 19:13:22] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 67 ms.
[2024-06-02 19:13:24] [INFO ] Added : 194 causal constraints over 39 iterations in 2251 ms. Result :sat
Minimization took 819 ms.
[2024-06-02 19:13:25] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-06-02 19:13:25] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:26] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-06-02 19:13:26] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 55 ms.
[2024-06-02 19:13:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-06-02 19:13:26] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:26] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2024-06-02 19:13:26] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 64 ms.
[2024-06-02 19:13:28] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 7 ms to minimize.
[2024-06-02 19:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-06-02 19:13:28] [INFO ] Added : 108 causal constraints over 23 iterations in 1638 ms. Result :sat
Minimization took 591 ms.
[2024-06-02 19:13:29] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 19:13:29] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:13:29] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-06-02 19:13:29] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 4 ms to minimize.
[2024-06-02 19:13:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-06-02 19:13:30] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:30] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-06-02 19:13:30] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 3 ms to minimize.
[2024-06-02 19:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-06-02 19:13:30] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 66 ms.
[2024-06-02 19:13:32] [INFO ] Added : 133 causal constraints over 27 iterations in 1519 ms. Result :sat
Minimization took 613 ms.
[2024-06-02 19:13:32] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2024-06-02 19:13:32] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:33] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-06-02 19:13:33] [INFO ] Deduced a trap composed of 126 places in 247 ms of which 5 ms to minimize.
[2024-06-02 19:13:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-06-02 19:13:33] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:33] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2024-06-02 19:13:34] [INFO ] Deduced a trap composed of 126 places in 267 ms of which 5 ms to minimize.
[2024-06-02 19:13:34] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-06-02 19:13:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2024-06-02 19:13:34] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 56 ms.
[2024-06-02 19:13:35] [INFO ] Added : 92 causal constraints over 19 iterations in 1072 ms. Result :sat
Minimization took 819 ms.
[2024-06-02 19:13:36] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 19:13:36] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:36] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2024-06-02 19:13:37] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 58 ms.
[2024-06-02 19:13:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-06-02 19:13:37] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:37] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2024-06-02 19:13:37] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 52 ms.
[2024-06-02 19:13:39] [INFO ] Added : 139 causal constraints over 28 iterations in 1598 ms. Result :sat
Minimization took 589 ms.
[2024-06-02 19:13:40] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 19:13:40] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:40] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2024-06-02 19:13:40] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 52 ms.
[2024-06-02 19:13:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2024-06-02 19:13:40] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:41] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2024-06-02 19:13:41] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 67 ms.
[2024-06-02 19:13:42] [INFO ] Added : 161 causal constraints over 33 iterations in 1853 ms. Result :sat
Minimization took 591 ms.
[2024-06-02 19:13:43] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 19:13:43] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:44] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-06-02 19:13:44] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 62 ms.
[2024-06-02 19:13:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-06-02 19:13:44] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:44] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2024-06-02 19:13:44] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 56 ms.
[2024-06-02 19:13:46] [INFO ] Deduced a trap composed of 278 places in 191 ms of which 4 ms to minimize.
[2024-06-02 19:13:46] [INFO ] Deduced a trap composed of 153 places in 205 ms of which 4 ms to minimize.
[2024-06-02 19:13:47] [INFO ] Deduced a trap composed of 155 places in 189 ms of which 4 ms to minimize.
[2024-06-02 19:13:47] [INFO ] Deduced a trap composed of 417 places in 181 ms of which 4 ms to minimize.
[2024-06-02 19:13:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1027 ms
[2024-06-02 19:13:47] [INFO ] Added : 139 causal constraints over 28 iterations in 2623 ms. Result :sat
Minimization took 588 ms.
[2024-06-02 19:13:48] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 19:13:48] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-02 19:13:48] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2024-06-02 19:13:48] [INFO ] Deduced a trap composed of 481 places in 204 ms of which 4 ms to minimize.
[2024-06-02 19:13:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-06-02 19:13:49] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:13:49] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-06-02 19:13:49] [INFO ] Deduced a trap composed of 481 places in 219 ms of which 5 ms to minimize.
[2024-06-02 19:13:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-06-02 19:13:49] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 59 ms.
[2024-06-02 19:13:51] [INFO ] Added : 133 causal constraints over 27 iterations in 1548 ms. Result :sat
Minimization took 595 ms.
[2024-06-02 19:13:51] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 19:13:51] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:13:52] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-06-02 19:13:52] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 55 ms.
[2024-06-02 19:13:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-06-02 19:13:52] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:52] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2024-06-02 19:13:53] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 64 ms.
[2024-06-02 19:13:54] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-06-02 19:13:54] [INFO ] Added : 123 causal constraints over 26 iterations in 1753 ms. Result :sat
Minimization took 693 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Graph (trivial) has 988 edges and 973 vertex of which 3 / 973 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1567 edges and 971 vertex of which 916 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.3 ms
Discarding 55 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 590 transitions
Trivial Post-agglo rules discarded 590 transitions
Performed 590 trivial Post agglomeration. Transition count delta: 590
Iterating post reduction 0 with 627 rules applied. Total rules applied 629 place count 916 transition count 524
Reduce places removed 590 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 616 rules applied. Total rules applied 1245 place count 326 transition count 498
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 26 rules applied. Total rules applied 1271 place count 314 transition count 484
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 1279 place count 310 transition count 480
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 1285 place count 308 transition count 476
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 11 rules applied. Total rules applied 1296 place count 306 transition count 467
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1303 place count 299 transition count 467
Discarding 43 places :
Symmetric choice reduction at 7 with 43 rule applications. Total rules 1346 place count 256 transition count 424
Iterating global reduction 7 with 43 rules applied. Total rules applied 1389 place count 256 transition count 424
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1389 place count 256 transition count 412
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1413 place count 244 transition count 412
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 1436 place count 221 transition count 377
Iterating global reduction 7 with 23 rules applied. Total rules applied 1459 place count 221 transition count 377
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 6 rules applied. Total rules applied 1465 place count 221 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1466 place count 220 transition count 371
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1468 place count 218 transition count 369
Iterating global reduction 9 with 2 rules applied. Total rules applied 1470 place count 218 transition count 369
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1472 place count 218 transition count 367
Performed 79 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 10 with 158 rules applied. Total rules applied 1630 place count 139 transition count 277
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1635 place count 139 transition count 272
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 11 with 82 rules applied. Total rules applied 1717 place count 98 transition count 316
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 11 with 35 rules applied. Total rules applied 1752 place count 98 transition count 281
Discarding 27 places :
Symmetric choice reduction at 12 with 27 rule applications. Total rules 1779 place count 71 transition count 184
Iterating global reduction 12 with 27 rules applied. Total rules applied 1806 place count 71 transition count 184
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1823 place count 71 transition count 167
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1828 place count 66 transition count 143
Iterating global reduction 13 with 5 rules applied. Total rules applied 1833 place count 66 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1835 place count 66 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 14 with 6 rules applied. Total rules applied 1841 place count 66 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1841 place count 66 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1843 place count 65 transition count 134
Free-agglomeration rule applied 11 times.
Iterating global reduction 14 with 11 rules applied. Total rules applied 1854 place count 65 transition count 123
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 1867 place count 54 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1868 place count 54 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1870 place count 54 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1871 place count 54 transition count 119
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1874 place count 54 transition count 119
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1875 place count 54 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1876 place count 53 transition count 117
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t731.t732.t1160.t639.t640.t641 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 26 edges and 49 vertex of which 2 / 49 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 3 rules applied. Total rules applied 1879 place count 48 transition count 115
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1882 place count 48 transition count 112
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 18 with 2 rules applied. Total rules applied 1884 place count 47 transition count 111
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1885 place count 46 transition count 107
Iterating global reduction 18 with 1 rules applied. Total rules applied 1886 place count 46 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1887 place count 46 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 19 with 16 rules applied. Total rules applied 1903 place count 46 transition count 90
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 1906 place count 43 transition count 84
Iterating global reduction 19 with 3 rules applied. Total rules applied 1909 place count 43 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1912 place count 43 transition count 81
Free-agglomeration rule applied 8 times.
Iterating global reduction 20 with 8 rules applied. Total rules applied 1920 place count 43 transition count 73
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 20 with 8 rules applied. Total rules applied 1928 place count 35 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 21 with 4 rules applied. Total rules applied 1932 place count 35 transition count 69
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 1934 place count 35 transition count 69
Applied a total of 1934 rules in 214 ms. Remains 35 /973 variables (removed 938) and now considering 69/1173 (removed 1104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 35/973 places, 69/1173 transitions.
[2024-06-02 19:13:55] [INFO ] Flow matrix only has 66 transitions (discarded 3 similar events)
// Phase 1: matrix 66 rows 35 cols
[2024-06-02 19:13:55] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 975 ms. (1024 steps per ms)
FORMULA CO4-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 295 ms. (3378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-02 19:13:57] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:13:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:13:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17654360837933671116.gal : 6 ms
[2024-06-02 19:13:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2095981410173177462.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17654360837933671116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2095981410173177462.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 44961 ms.

BK_STOP 1717355637306

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CO4-PT-19"
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-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-19, 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 r550-tall-171734898700149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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