Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 92K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749044941969

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-S05J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-04 13:49:03] [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]
[2025-06-04 13:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 13:49:03] [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.
[2025-06-04 13:49:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 13:49:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 562 ms
[2025-06-04 13:49:03] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-04 13:49:03] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2025-06-04 13:49:03] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2025-06-04 13:49:03] [INFO ] Computed 13 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 5, 3, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 10, 4, +inf, +inf, 5, +inf, 5, 1, +inf, +inf, +inf, +inf, +inf, 10]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-04 13:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-04 13:49:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 13:49:04] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-04 13:49:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-04 13:49:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 13:49:04] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:04] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 9 ms to minimize.
[2025-06-04 13:49:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:04] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:04] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 4 ms to minimize.
[2025-06-04 13:49:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2025-06-04 13:49:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-04 13:49:04] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-04 13:49:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2025-06-04 13:49:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-04 13:49:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-04 13:49:05] [INFO ] Added : 15 causal constraints over 3 iterations in 627 ms. Result :sat
Minimization took 174 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:05] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-04 13:49:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 13:49:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2025-06-04 13:49:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-04 13:49:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-04 13:49:06] [INFO ] Added : 20 causal constraints over 5 iterations in 329 ms. Result :sat
Minimization took 294 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 13:49:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 13:49:06] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:06] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
[2025-06-04 13:49:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:06] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:06] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:06] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
[2025-06-04 13:49:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 116 ms
[2025-06-04 13:49:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-04 13:49:06] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-04 13:49:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 13:49:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-04 13:49:06] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 13:49:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 76 ms to minimize.
[2025-06-04 13:49:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
[2025-06-04 13:49:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 168 ms
[2025-06-04 13:49:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 13:49:07] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 13:49:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2025-06-04 13:49:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2025-06-04 13:49:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 3 ms to minimize.
[2025-06-04 13:49:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-04 13:49:07] [INFO ] Added : 36 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 13:49:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 13:49:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 13:49:07] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 13:49:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-04 13:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 3 ms to minimize.
[2025-06-04 13:49:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-04 13:49:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2025-06-04 13:49:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 164 ms
[2025-06-04 13:49:08] [INFO ] Added : 36 causal constraints over 8 iterations in 288 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-04 13:49:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
[2025-06-04 13:49:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 147 ms
[2025-06-04 13:49:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 13:49:08] [INFO ] Added : 36 causal constraints over 8 iterations in 47 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-04 13:49:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
[2025-06-04 13:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-04 13:49:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-04 13:49:08] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-04 13:49:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 13:49:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:49:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
[2025-06-04 13:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-04 13:49:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-04 13:49:09] [INFO ] Added : 15 causal constraints over 3 iterations in 590 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 10, 4, +inf, +inf, 3, 5, 1, +inf, +inf, +inf, +inf, +inf, 10]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-07 3 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.
[2025-06-04 13:49:09] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 67 ms.
[2025-06-04 13:49:09] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 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, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +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, 0, 0, 0] Max Struct:[+inf, 1, 10, 4, +inf, +inf, 5, 1, +inf, +inf, +inf, +inf, +inf, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 10, 4, +inf, +inf, 5, 1, +inf, +inf, +inf, +inf, +inf, 10]
[2025-06-04 13:49:09] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2025-06-04 13:49:09] [INFO ] Computed 82 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 1, 10, 4, 31, 11, 5, 1, 32, 11, 31, 31, 31, 10]
RANDOM walk for 10000 steps (692 resets) in 136 ms. (72 steps per ms)
FORMULA PolyORBNT-COL-S05J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100006 steps (1772 resets) in 349 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 1, 1, 1, 1, 1, 1, 1, 4] Max Struct:[11, 10, 31, 11, 32, 11, 31, 31, 31, 10]
[2025-06-04 13:49:10] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
[2025-06-04 13:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 5 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 31 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 55 ms returned sat
[2025-06-04 13:49:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 5 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:11] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-04 13:49:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 13:49:11] [INFO ] [Real]Absence check using 75 positive place invariants in 34 ms returned sat
[2025-06-04 13:49:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 1, 1, 1, 1, 1, 1, 1, 4] Max Struct:[1, 4, 1, 1, 1, 1, 1, 1, 1, 4]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 13:49:11] [INFO ] Flatten gal took : 114 ms
[2025-06-04 13:49:11] [INFO ] Flatten gal took : 68 ms
[2025-06-04 13:49:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3227182459764919637.gal : 30 ms
[2025-06-04 13:49:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9860671119274996956.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3227182459764919637.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9860671119274996956.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 8295 ms.

BK_STOP 1749044951578

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-S05J30"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J30, 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 r156-tall-174881254300565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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