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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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 260K 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-16-UpperBounds-00
FORMULA_NAME CO4-PT-16-UpperBounds-01
FORMULA_NAME CO4-PT-16-UpperBounds-02
FORMULA_NAME CO4-PT-16-UpperBounds-03
FORMULA_NAME CO4-PT-16-UpperBounds-04
FORMULA_NAME CO4-PT-16-UpperBounds-05
FORMULA_NAME CO4-PT-16-UpperBounds-06
FORMULA_NAME CO4-PT-16-UpperBounds-07
FORMULA_NAME CO4-PT-16-UpperBounds-08
FORMULA_NAME CO4-PT-16-UpperBounds-09
FORMULA_NAME CO4-PT-16-UpperBounds-10
FORMULA_NAME CO4-PT-16-UpperBounds-11
FORMULA_NAME CO4-PT-16-UpperBounds-12
FORMULA_NAME CO4-PT-16-UpperBounds-13
FORMULA_NAME CO4-PT-16-UpperBounds-14
FORMULA_NAME CO4-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717353028125

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 18:30:29] [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 18:30:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:30:29] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 18:30:29] [INFO ] Transformed 837 places.
[2024-06-02 18:30:29] [INFO ] Transformed 1122 transitions.
[2024-06-02 18:30:29] [INFO ] Found NUPN structural information;
[2024-06-02 18:30:29] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-UpperBounds-12 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, 0, 0] Max Struct:[1, 1, 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, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 942 rows 721 cols
[2024-06-02 18:30:29] [INFO ] Computed 12 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 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, 1, 1]
RANDOM walk for 10000 steps (224 resets) in 45 ms. (217 steps per ms)
FORMULA CO4-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100006 steps (370 resets) in 85 ms. (1162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:30:29] [INFO ] Invariant cache hit.
[2024-06-02 18:30:30] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 18:30:30] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:30] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-06-02 18:30:30] [INFO ] Deduced a trap composed of 55 places in 288 ms of which 46 ms to minimize.
[2024-06-02 18:30:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:30:30] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:31] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-06-02 18:30:31] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 4 ms to minimize.
[2024-06-02 18:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-06-02 18:30:31] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 73 ms.
[2024-06-02 18:30:32] [INFO ] Added : 111 causal constraints over 23 iterations in 1218 ms. Result :sat
Minimization took 392 ms.
[2024-06-02 18:30:33] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:30:33] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:33] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-06-02 18:30:33] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 5 ms to minimize.
[2024-06-02 18:30:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:30:33] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:34] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-06-02 18:30:34] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 5 ms to minimize.
[2024-06-02 18:30:34] [INFO ] Deduced a trap composed of 335 places in 163 ms of which 3 ms to minimize.
[2024-06-02 18:30:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2024-06-02 18:30:34] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2024-06-02 18:30:35] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2024-06-02 18:30:35] [INFO ] Added : 113 causal constraints over 23 iterations in 1401 ms. Result :sat
Minimization took 382 ms.
[2024-06-02 18:30:36] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:30:36] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:30:36] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-06-02 18:30:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:30:36] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:37] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-06-02 18:30:37] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 5 ms to minimize.
[2024-06-02 18:30:37] [INFO ] Deduced a trap composed of 335 places in 195 ms of which 4 ms to minimize.
[2024-06-02 18:30:37] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2024-06-02 18:30:38] [INFO ] Deduced a trap composed of 411 places in 187 ms of which 3 ms to minimize.
[2024-06-02 18:30:38] [INFO ] Deduced a trap composed of 212 places in 141 ms of which 3 ms to minimize.
[2024-06-02 18:30:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1141 ms
[2024-06-02 18:30:38] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 65 ms.
[2024-06-02 18:30:39] [INFO ] Added : 125 causal constraints over 25 iterations in 1243 ms. Result :sat
Minimization took 377 ms.
[2024-06-02 18:30:40] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:30:40] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:40] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-02 18:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:30:40] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:30:40] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-06-02 18:30:40] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 4 ms to minimize.
[2024-06-02 18:30:41] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 4 ms to minimize.
[2024-06-02 18:30:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2024-06-02 18:30:41] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 54 ms.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 210 places in 200 ms of which 4 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 222 places in 192 ms of which 4 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2024-06-02 18:30:42] [INFO ] Added : 118 causal constraints over 24 iterations in 1796 ms. Result :sat
Minimization took 401 ms.
[2024-06-02 18:30:43] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2024-06-02 18:30:43] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:30:43] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-06-02 18:30:43] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 3 ms to minimize.
[2024-06-02 18:30:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:30:44] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:30:44] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2024-06-02 18:30:44] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 3 ms to minimize.
[2024-06-02 18:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-06-02 18:30:44] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 43 ms.
[2024-06-02 18:30:45] [INFO ] Added : 58 causal constraints over 12 iterations in 640 ms. Result :sat
Minimization took 346 ms.
[2024-06-02 18:30:45] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:30:45] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:45] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-06-02 18:30:46] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2024-06-02 18:30:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 18:30:46] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:30:46] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 18:30:46] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 3 ms to minimize.
[2024-06-02 18:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-06-02 18:30:46] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 46 ms.
[2024-06-02 18:30:47] [INFO ] Added : 72 causal constraints over 15 iterations in 775 ms. Result :sat
Minimization took 359 ms.
[2024-06-02 18:30:48] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:30:48] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:30:48] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-06-02 18:30:48] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 4 ms to minimize.
[2024-06-02 18:30:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:30:48] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:30:48] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-06-02 18:30:49] [INFO ] Deduced a trap composed of 55 places in 204 ms of which 4 ms to minimize.
[2024-06-02 18:30:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-06-02 18:30:49] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 58 ms.
[2024-06-02 18:30:50] [INFO ] Added : 85 causal constraints over 17 iterations in 888 ms. Result :sat
Minimization took 389 ms.
[2024-06-02 18:30:50] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:30:50] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:30:50] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2024-06-02 18:30:51] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 57 ms.
[2024-06-02 18:30:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 18:30:51] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:51] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 18:30:51] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 47 ms.
[2024-06-02 18:30:53] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2024-06-02 18:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-06-02 18:30:53] [INFO ] Added : 149 causal constraints over 31 iterations in 1805 ms. Result :sat
Minimization took 414 ms.
[2024-06-02 18:30:53] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:30:53] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:30:54] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-06-02 18:30:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:30:54] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:54] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-06-02 18:30:54] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 4 ms to minimize.
[2024-06-02 18:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2024-06-02 18:30:54] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 52 ms.
[2024-06-02 18:30:55] [INFO ] Added : 93 causal constraints over 19 iterations in 939 ms. Result :sat
Minimization took 370 ms.
[2024-06-02 18:30:56] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 18:30:56] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:56] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-06-02 18:30:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:30:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 18:30:56] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:30:56] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 18:30:56] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 51 ms.
[2024-06-02 18:30:57] [INFO ] Added : 81 causal constraints over 17 iterations in 849 ms. Result :sat
Minimization took 363 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 942/942 transitions.
Graph (trivial) has 745 edges and 721 vertex of which 2 / 721 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1392 edges and 720 vertex of which 675 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 387 rules applied. Total rules applied 389 place count 675 transition count 533
Reduce places removed 356 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 385 rules applied. Total rules applied 774 place count 319 transition count 504
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 29 rules applied. Total rules applied 803 place count 306 transition count 488
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 812 place count 303 transition count 482
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 821 place count 300 transition count 476
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 827 place count 297 transition count 473
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 827 place count 297 transition count 472
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 829 place count 296 transition count 472
Discarding 49 places :
Symmetric choice reduction at 6 with 49 rule applications. Total rules 878 place count 247 transition count 423
Iterating global reduction 6 with 49 rules applied. Total rules applied 927 place count 247 transition count 423
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 927 place count 247 transition count 409
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 955 place count 233 transition count 409
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 986 place count 202 transition count 354
Iterating global reduction 6 with 31 rules applied. Total rules applied 1017 place count 202 transition count 354
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 7 rules applied. Total rules applied 1024 place count 202 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1025 place count 201 transition count 347
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1029 place count 197 transition count 342
Iterating global reduction 8 with 4 rules applied. Total rules applied 1033 place count 197 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1037 place count 197 transition count 338
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 9 with 148 rules applied. Total rules applied 1185 place count 123 transition count 254
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1189 place count 123 transition count 250
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 10 with 76 rules applied. Total rules applied 1265 place count 85 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 10 with 76 rules applied. Total rules applied 1341 place count 85 transition count 215
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 1369 place count 57 transition count 148
Iterating global reduction 11 with 28 rules applied. Total rules applied 1397 place count 57 transition count 148
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1417 place count 57 transition count 128
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1422 place count 52 transition count 107
Iterating global reduction 12 with 5 rules applied. Total rules applied 1427 place count 52 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1430 place count 52 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1432 place count 51 transition count 119
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1435 place count 51 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 14 with 12 rules applied. Total rules applied 1447 place count 51 transition count 104
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1448 place count 50 transition count 102
Iterating global reduction 14 with 1 rules applied. Total rules applied 1449 place count 50 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1450 place count 50 transition count 101
Free-agglomeration rule applied 11 times.
Iterating global reduction 15 with 11 rules applied. Total rules applied 1461 place count 50 transition count 90
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 1474 place count 39 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1475 place count 39 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1476 place count 38 transition count 87
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 21 edges and 35 vertex of which 5 / 35 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 1480 place count 32 transition count 87
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 23 edges and 31 vertex of which 6 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 17 with 10 rules applied. Total rules applied 1490 place count 26 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 18 with 23 rules applied. Total rules applied 1513 place count 26 transition count 56
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1514 place count 25 transition count 54
Iterating global reduction 19 with 1 rules applied. Total rules applied 1515 place count 25 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1516 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 1520 place count 25 transition count 49
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1522 place count 25 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1524 place count 23 transition count 47
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 1528 place count 23 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1529 place count 23 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1530 place count 22 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 1532 place count 22 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1533 place count 22 transition count 39
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1536 place count 21 transition count 37
Applied a total of 1536 rules in 166 ms. Remains 21 /721 variables (removed 700) and now considering 37/942 (removed 905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 21/721 places, 37/942 transitions.
[2024-06-02 18:30:58] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 21 cols
[2024-06-02 18:30:58] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 858 ms. (1164 steps per ms)
FORMULA CO4-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 336 ms. (2967 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 18:30:59] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:30:59] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8120838511006698101.gal : 5 ms
[2024-06-02 18:30:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16165346274578623925.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/ReachabilityCardinality8120838511006698101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16165346274578623925.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 30706 ms.

BK_STOP 1717353060045

--------------------
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-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-16, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898600125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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