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.r453-smll-167912645500461.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 itstools
Input is StigmergyCommit-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645500461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 9.5K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 11:04 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 1.8M 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-06a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679349500876

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-20 21:58:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 21:58:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:58:24] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2023-03-20 21:58:24] [INFO ] Transformed 256 places.
[2023-03-20 21:58:24] [INFO ] Transformed 2816 transitions.
[2023-03-20 21:58:24] [INFO ] Found NUPN structural information;
[2023-03-20 21:58:24] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 799 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Normalized transition count is 566 out of 587 initially.
// Phase 1: matrix 566 rows 256 cols
[2023-03-20 21:58:24] [INFO ] Computed 8 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
[2023-03-20 21:58:24] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2023-03-20 21:58:24] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-20 21:58:25] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2023-03-20 21:58:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:25] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2023-03-20 21:58:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2023-03-20 21:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:26] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-20 21:58:26] [INFO ] State equation strengthened by 351 read => feed constraints.
[2023-03-20 21:58:26] [INFO ] [Nat]Added 351 Read/Feed constraints in 224 ms returned sat
[2023-03-20 21:58:26] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 4 ms to minimize.
[2023-03-20 21:58:27] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 2 ms to minimize.
[2023-03-20 21:58:27] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2023-03-20 21:58:27] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2023-03-20 21:58:27] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2023-03-20 21:58:27] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-20 21:58:27] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2023-03-20 21:58:28] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-20 21:58:28] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-20 21:58:28] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-03-20 21:58:28] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2023-03-20 21:58:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1955 ms
[2023-03-20 21:58:28] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 115 ms.
[2023-03-20 21:58:29] [INFO ] Added : 56 causal constraints over 12 iterations in 755 ms. Result :sat
Minimization took 256 ms.
[2023-03-20 21:58:29] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-20 21:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:29] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-20 21:58:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-20 21:58:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:30] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-20 21:58:30] [INFO ] [Nat]Added 351 Read/Feed constraints in 70 ms returned sat
[2023-03-20 21:58:30] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2023-03-20 21:58:30] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 1 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 1 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-20 21:58:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1819 ms
[2023-03-20 21:58:32] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 92 ms.
[2023-03-20 21:58:32] [INFO ] Added : 51 causal constraints over 11 iterations in 561 ms. Result :sat
Minimization took 124 ms.
[2023-03-20 21:58:32] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-20 21:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:32] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-20 21:58:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-20 21:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:33] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-20 21:58:33] [INFO ] [Nat]Added 351 Read/Feed constraints in 127 ms returned sat
[2023-03-20 21:58:33] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2023-03-20 21:58:33] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2023-03-20 21:58:34] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2023-03-20 21:58:34] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2023-03-20 21:58:34] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2023-03-20 21:58:34] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2023-03-20 21:58:34] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2023-03-20 21:58:35] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-20 21:58:35] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-20 21:58:35] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2023-03-20 21:58:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2013 ms
[2023-03-20 21:58:35] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 86 ms.
[2023-03-20 21:58:36] [INFO ] Added : 53 causal constraints over 11 iterations in 809 ms. Result :sat
Minimization took 121 ms.
[2023-03-20 21:58:36] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-20 21:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:36] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-20 21:58:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-20 21:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:36] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-20 21:58:36] [INFO ] [Nat]Added 351 Read/Feed constraints in 106 ms returned sat
[2023-03-20 21:58:37] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 1 ms to minimize.
[2023-03-20 21:58:37] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2023-03-20 21:58:37] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 0 ms to minimize.
[2023-03-20 21:58:37] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:58:38] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-20 21:58:38] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-20 21:58:38] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-20 21:58:38] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-20 21:58:38] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-20 21:58:38] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-20 21:58:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1955 ms
[2023-03-20 21:58:39] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 82 ms.
[2023-03-20 21:58:39] [INFO ] Added : 57 causal constraints over 12 iterations in 830 ms. Result :sat
Minimization took 192 ms.
[2023-03-20 21:58:40] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-20 21:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:40] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2023-03-20 21:58:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-20 21:58:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:40] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-20 21:58:40] [INFO ] [Nat]Added 351 Read/Feed constraints in 169 ms returned sat
[2023-03-20 21:58:41] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 1 ms to minimize.
[2023-03-20 21:58:41] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-20 21:58:41] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2023-03-20 21:58:41] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2023-03-20 21:58:42] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-20 21:58:42] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-20 21:58:42] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2023-03-20 21:58:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:58:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1677 ms
[2023-03-20 21:58:42] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 83 ms.
[2023-03-20 21:58:43] [INFO ] Added : 54 causal constraints over 11 iterations in 872 ms. Result :sat
Minimization took 215 ms.
[2023-03-20 21:58:43] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-20 21:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:44] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-20 21:58:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-20 21:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:44] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-20 21:58:44] [INFO ] [Nat]Added 351 Read/Feed constraints in 209 ms returned sat
[2023-03-20 21:58:44] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2023-03-20 21:58:45] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 5 ms to minimize.
[2023-03-20 21:58:45] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2023-03-20 21:58:45] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 0 ms to minimize.
[2023-03-20 21:58:45] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-20 21:58:45] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2023-03-20 21:58:46] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2023-03-20 21:58:46] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-20 21:58:46] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-20 21:58:46] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-20 21:58:46] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-20 21:58:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2057 ms
[2023-03-20 21:58:46] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 85 ms.
[2023-03-20 21:58:47] [INFO ] Added : 60 causal constraints over 12 iterations in 1027 ms. Result :sat
Minimization took 212 ms.
[2023-03-20 21:58:48] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-20 21:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:48] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-20 21:58:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-20 21:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:48] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2023-03-20 21:58:48] [INFO ] [Nat]Added 351 Read/Feed constraints in 155 ms returned sat
[2023-03-20 21:58:49] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 1 ms to minimize.
[2023-03-20 21:58:49] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 1 ms to minimize.
[2023-03-20 21:58:49] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 1 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 0 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2046 ms
[2023-03-20 21:58:51] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 82 ms.
[2023-03-20 21:58:51] [INFO ] Added : 57 causal constraints over 12 iterations in 763 ms. Result :sat
Minimization took 182 ms.
[2023-03-20 21:58:52] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-20 21:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:52] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-20 21:58:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-20 21:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:52] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-20 21:58:52] [INFO ] [Nat]Added 351 Read/Feed constraints in 124 ms returned sat
[2023-03-20 21:58:53] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 1 ms to minimize.
[2023-03-20 21:58:53] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-20 21:58:53] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 0 ms to minimize.
[2023-03-20 21:58:53] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 1 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1716 ms
[2023-03-20 21:58:54] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 82 ms.
[2023-03-20 21:58:55] [INFO ] Added : 62 causal constraints over 13 iterations in 700 ms. Result :sat
Minimization took 117 ms.
[2023-03-20 21:58:55] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-20 21:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:55] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-20 21:58:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:58:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-20 21:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:58:56] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-20 21:58:56] [INFO ] [Nat]Added 351 Read/Feed constraints in 104 ms returned sat
[2023-03-20 21:58:56] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:58:56] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-20 21:58:58] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-20 21:58:58] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-20 21:58:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1923 ms
[2023-03-20 21:58:58] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 72 ms.
[2023-03-20 21:58:58] [INFO ] Added : 52 causal constraints over 11 iterations in 631 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 35702 ms.

BK_STOP 1679349540517

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-06a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-06a, 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 r453-smll-167912645500461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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