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.r457-smll-167912649400477.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is StigmergyCommit-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649400477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 5.4K Feb 26 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 5.4M Mar 5 18:23 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 StigmergyCommit-PT-07a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679458415408

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:13:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 04:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:13:38] [INFO ] Load time of PNML (sax parser for PT used): 685 ms
[2023-03-22 04:13:38] [INFO ] Transformed 292 places.
[2023-03-22 04:13:38] [INFO ] Transformed 7108 transitions.
[2023-03-22 04:13:38] [INFO ] Found NUPN structural information;
[2023-03-22 04:13:38] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 861 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Normalized transition count is 866 out of 890 initially.
// Phase 1: matrix 866 rows 292 cols
[2023-03-22 04:13:39] [INFO ] Computed 9 place invariants in 61 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 16) seen :9
FORMULA StigmergyCommit-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
[2023-03-22 04:13:39] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2023-03-22 04:13:39] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-22 04:13:39] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2023-03-22 04:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:40] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-22 04:13:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-22 04:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:40] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-22 04:13:40] [INFO ] State equation strengthened by 621 read => feed constraints.
[2023-03-22 04:13:41] [INFO ] [Nat]Added 621 Read/Feed constraints in 229 ms returned sat
[2023-03-22 04:13:41] [INFO ] Deduced a trap composed of 16 places in 614 ms of which 5 ms to minimize.
[2023-03-22 04:13:42] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 1 ms to minimize.
[2023-03-22 04:13:42] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 1 ms to minimize.
[2023-03-22 04:13:42] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 2 ms to minimize.
[2023-03-22 04:13:42] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2023-03-22 04:13:43] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-22 04:13:43] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-22 04:13:43] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-22 04:13:43] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2023-03-22 04:13:43] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2023-03-22 04:13:43] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-22 04:13:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2779 ms
[2023-03-22 04:13:44] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 168 ms.
[2023-03-22 04:13:45] [INFO ] Added : 61 causal constraints over 13 iterations in 1083 ms. Result :sat
Minimization took 264 ms.
[2023-03-22 04:13:45] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-22 04:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:45] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2023-03-22 04:13:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-22 04:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:46] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-22 04:13:46] [INFO ] [Nat]Added 621 Read/Feed constraints in 296 ms returned sat
[2023-03-22 04:13:46] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2023-03-22 04:13:46] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2023-03-22 04:13:47] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 0 ms to minimize.
[2023-03-22 04:13:47] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2023-03-22 04:13:47] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-22 04:13:47] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-22 04:13:47] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-22 04:13:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1559 ms
[2023-03-22 04:13:47] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 100 ms.
[2023-03-22 04:13:48] [INFO ] Added : 63 causal constraints over 13 iterations in 994 ms. Result :sat
Minimization took 258 ms.
[2023-03-22 04:13:49] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-22 04:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:49] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-22 04:13:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-22 04:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:49] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-22 04:13:49] [INFO ] [Nat]Added 621 Read/Feed constraints in 175 ms returned sat
[2023-03-22 04:13:50] [INFO ] Deduced a trap composed of 16 places in 324 ms of which 1 ms to minimize.
[2023-03-22 04:13:50] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 0 ms to minimize.
[2023-03-22 04:13:50] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 1 ms to minimize.
[2023-03-22 04:13:51] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2023-03-22 04:13:51] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2023-03-22 04:13:51] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2023-03-22 04:13:51] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2023-03-22 04:13:51] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2023-03-22 04:13:52] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2023-03-22 04:13:52] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2023-03-22 04:13:52] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-22 04:13:52] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-22 04:13:52] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2023-03-22 04:13:52] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-22 04:13:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3004 ms
[2023-03-22 04:13:53] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 96 ms.
[2023-03-22 04:13:53] [INFO ] Added : 62 causal constraints over 13 iterations in 987 ms. Result :sat
Minimization took 243 ms.
[2023-03-22 04:13:54] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-22 04:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:54] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-22 04:13:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-22 04:13:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:54] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-22 04:13:55] [INFO ] [Nat]Added 621 Read/Feed constraints in 189 ms returned sat
[2023-03-22 04:13:55] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2023-03-22 04:13:55] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 1 ms to minimize.
[2023-03-22 04:13:55] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2023-03-22 04:13:56] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-22 04:13:56] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2023-03-22 04:13:56] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2023-03-22 04:13:56] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2023-03-22 04:13:56] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-22 04:13:56] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2023-03-22 04:13:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1753 ms
[2023-03-22 04:13:56] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 97 ms.
[2023-03-22 04:13:57] [INFO ] Added : 65 causal constraints over 13 iterations in 898 ms. Result :sat
Minimization took 286 ms.
[2023-03-22 04:13:58] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-22 04:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:58] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-22 04:13:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-22 04:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:58] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2023-03-22 04:13:58] [INFO ] [Nat]Added 621 Read/Feed constraints in 183 ms returned sat
[2023-03-22 04:13:59] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-22 04:13:59] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 3 ms to minimize.
[2023-03-22 04:13:59] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2023-03-22 04:13:59] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-22 04:14:00] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-22 04:14:00] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2023-03-22 04:14:00] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-22 04:14:00] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-22 04:14:00] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2023-03-22 04:14:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1877 ms
[2023-03-22 04:14:00] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 93 ms.
[2023-03-22 04:14:01] [INFO ] Added : 67 causal constraints over 14 iterations in 876 ms. Result :sat
Minimization took 201 ms.
[2023-03-22 04:14:01] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-22 04:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:02] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-22 04:14:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:14:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-22 04:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:02] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2023-03-22 04:14:02] [INFO ] [Nat]Added 621 Read/Feed constraints in 162 ms returned sat
[2023-03-22 04:14:03] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-22 04:14:03] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-22 04:14:03] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2023-03-22 04:14:03] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2023-03-22 04:14:03] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-22 04:14:03] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2023-03-22 04:14:04] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2023-03-22 04:14:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1380 ms
[2023-03-22 04:14:04] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 99 ms.
[2023-03-22 04:14:05] [INFO ] Added : 64 causal constraints over 13 iterations in 954 ms. Result :sat
Minimization took 232 ms.
[2023-03-22 04:14:05] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-22 04:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:05] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-22 04:14:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:14:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-22 04:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:06] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-22 04:14:06] [INFO ] [Nat]Added 621 Read/Feed constraints in 158 ms returned sat
[2023-03-22 04:14:06] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 1 ms to minimize.
[2023-03-22 04:14:06] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-22 04:14:07] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 0 ms to minimize.
[2023-03-22 04:14:07] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 1 ms to minimize.
[2023-03-22 04:14:07] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2023-03-22 04:14:07] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-22 04:14:07] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-22 04:14:08] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-22 04:14:08] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2023-03-22 04:14:08] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2023-03-22 04:14:08] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2023-03-22 04:14:08] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2023-03-22 04:14:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2454 ms
[2023-03-22 04:14:08] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 98 ms.
[2023-03-22 04:14:09] [INFO ] Added : 67 causal constraints over 14 iterations in 897 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 32328 ms.
ITS solved all properties within timeout

BK_STOP 1679458451327

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="StigmergyCommit-PT-07a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyCommit-PT-07a, 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 r457-smll-167912649400477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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