Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446900365.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-COL-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446900365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.0K Apr 12 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 09:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 09:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 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 PolyORBNT-COL-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716922983533

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 19:03:05] [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-05-28 19:03:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:03:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 19:03:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:03:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 782 ms
[2024-05-28 19:03:06] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 55 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-28 19:03:06] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 19:03:06] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:03:06] [INFO ] Computed 13 invariants in 8 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 21, 0, 5, 0, 1, 0, 1, 0, 0, 5, 0] Max Struct:[+inf, 3, 1, 1, 1, 21, +inf, 5, +inf, 1, 1, +inf, +inf, 10, 5, +inf]
FORMULA PolyORBNT-COL-S05J20-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 19:03:06] [INFO ] Invariant cache hit.
[2024-05-28 19:03:06] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 19:03:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 37 ms returned sat
[2024-05-28 19:03:06] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-28 19:03:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:03:06] [INFO ] [Real]Added 1 Read/Feed constraints in 27 ms returned sat
[2024-05-28 19:03:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:03:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:06] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-28 19:03:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 19:03:06] [INFO ] Added : 36 causal constraints over 8 iterations in 132 ms. Result :sat
Minimization took 58 ms.
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 19:03:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2024-05-28 19:03:07] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 12 ms to minimize.
[2024-05-28 19:03:07] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:03:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2024-05-28 19:03:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 19:03:07] [INFO ] Added : 21 causal constraints over 5 iterations in 39 ms. Result :sat
Minimization took 38 ms.
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-28 19:03:07] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:03:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:07] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 19:03:07] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-28 19:03:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2024-05-28 19:03:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 19:03:07] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 16 ms.
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 19:03:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:08] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-28 19:03:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 19:03:08] [INFO ] Added : 33 causal constraints over 7 iterations in 107 ms. Result :sat
Minimization took 60 ms.
[2024-05-28 19:03:08] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:08] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-05-28 19:03:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:08] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-28 19:03:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 19:03:08] [INFO ] Added : 36 causal constraints over 8 iterations in 66 ms. Result :sat
Minimization took 33 ms.
[2024-05-28 19:03:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 19:03:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-28 19:03:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:03:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:03:08] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2024-05-28 19:03:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:03:08] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-28 19:03:08] [INFO ] Added : 36 causal constraints over 8 iterations in 176 ms. Result :sat
Minimization took 64 ms.
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 19:03:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:03:09] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 19 ms.
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 19:03:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 19:03:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:03:09] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:03:09] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:03:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2024-05-28 19:03:09] [INFO ] Added : 36 causal constraints over 8 iterations in 180 ms. Result :sat
Minimization took 24 ms.
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 19:03:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 19:03:09] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 19:03:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:09] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-28 19:03:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:03:10] [INFO ] Added : 22 causal constraints over 5 iterations in 527 ms. Result :sat
Minimization took 68 ms.
[2024-05-28 19:03:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:03:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 19:03:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 19:03:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:03:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:03:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 19:03:10] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 19:03:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:03:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:03:10] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, 3, 1, 1, 1, +inf, +inf, 1, 1, +inf, 10, +inf]
FORMULA PolyORBNT-COL-S05J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:03:10] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 91 ms.
[2024-05-28 19:03:10] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 3, 1, 1, 1, +inf, +inf, 1, +inf, 10, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 3, 1, 1, 1, +inf, +inf, 1, +inf, 10, +inf]
[2024-05-28 19:03:10] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2024-05-28 19:03:10] [INFO ] Computed 62 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 3, 1, 1, 1, 22, 11, 1, 11, 10, 11]
RANDOM walk for 10000 steps (680 resets) in 94 ms. (105 steps per ms)
FORMULA PolyORBNT-COL-S05J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (1468 resets) in 201 ms. (346 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 1, 1, 4, 1] Max Struct:[11, 1, 22, 11, 11, 10, 11]
[2024-05-28 19:03:11] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
[2024-05-28 19:03:11] [INFO ] Invariant cache hit.
[2024-05-28 19:03:11] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2024-05-28 19:03:11] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned unsat
[2024-05-28 19:03:11] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2024-05-28 19:03:11] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-28 19:03:11] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-28 19:03:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:03:11] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-28 19:03:11] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 76 ms.
[2024-05-28 19:03:11] [INFO ] Added : 7 causal constraints over 2 iterations in 214 ms. Result :sat
Minimization took 757 ms.
[2024-05-28 19:03:12] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned sat
[2024-05-28 19:03:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 22 ms returned unsat
[2024-05-28 19:03:12] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2024-05-28 19:03:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 17 ms returned unsat
[2024-05-28 19:03:12] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-28 19:03:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-28 19:03:13] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2024-05-28 19:03:13] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 4 ms returned unsat
[2024-05-28 19:03:13] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2024-05-28 19:03:13] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 1, 1, 4, 1] Max Struct:[1, 1, 1, 1, 1, 4, 1]
FORMULA PolyORBNT-COL-S05J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 349 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place place_456) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 554/554 transitions.
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 343 transition count 528
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 56 place count 318 transition count 528
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 56 place count 318 transition count 503
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 106 place count 293 transition count 503
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 292 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 292 transition count 502
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 290 transition count 500
Applied a total of 112 rules in 255 ms. Remains 290 /349 variables (removed 59) and now considering 500/554 (removed 54) transitions.
Running 494 sub problems to find dead transitions.
[2024-05-28 19:03:13] [INFO ] Flow matrix only has 496 transitions (discarded 4 similar events)
// Phase 1: matrix 496 rows 290 cols
[2024-05-28 19:03:13] [INFO ] Computed 57 invariants in 19 ms
[2024-05-28 19:03:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/288 variables, 4/53 constraints. Problems are: Problem set: 60 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 1/54 constraints. Problems are: Problem set: 60 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/54 constraints. Problems are: Problem set: 60 solved, 434 unsolved
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 6 (OVERLAPS) 2/290 variables, 3/57 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/57 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 8 (OVERLAPS) 496/786 variables, 290/347 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 1/348 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 0/348 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 11 (OVERLAPS) 0/786 variables, 0/348 constraints. Problems are: Problem set: 95 solved, 399 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 348 constraints, problems are : Problem set: 95 solved, 399 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 45/45 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 4/49 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/49 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 4/288 variables, 4/53 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 1/54 constraints. Problems are: Problem set: 95 solved, 399 unsolved
[2024-05-28 19:03:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 1/55 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/55 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 2/290 variables, 3/58 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 9 (OVERLAPS) 496/786 variables, 290/348 constraints. Problems are: Problem set: 95 solved, 399 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 1/349 constraints. Problems are: Problem set: 95 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/786 variables, and 748 constraints, problems are : Problem set: 95 solved, 399 unsolved in 20235 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 399/494 constraints, Known Traps: 1/1 constraints]
After SMT, in 41659ms problems are : Problem set: 95 solved, 399 unsolved
Search for dead transitions found 95 dead transitions in 41693ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/349 places, 405/554 transitions.
Applied a total of 0 rules in 22 ms. Remains 290 /290 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42001 ms. Remains : 290/349 places, 405/554 transitions.
[2024-05-28 19:03:55] [INFO ] Flow matrix only has 401 transitions (discarded 4 similar events)
// Phase 1: matrix 401 rows 290 cols
[2024-05-28 19:03:55] [INFO ] Computed 57 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (54272 resets) in 2454 ms. (407 steps per ms)
FORMULA PolyORBNT-COL-S05J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (7175 resets) in 896 ms. (1114 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-05-28 19:03:58] [INFO ] Flatten gal took : 107 ms
[2024-05-28 19:03:58] [INFO ] Flatten gal took : 51 ms
[2024-05-28 19:03:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2273691426881087368.gal : 43 ms
[2024-05-28 19:03:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5995889126814503200.prop : 0 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/ReachabilityCardinality2273691426881087368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5995889126814503200.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 ...328
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 53775 ms.

BK_STOP 1716923039024

--------------------
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="PolyORBNT-COL-S05J20"
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 PolyORBNT-COL-S05J20, 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 r290-tajo-171654446900365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 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 ;