MCC'2025- Execution of r156-tall-174881254300573

About the Execution of ITS-Tools for PolyORBNT-COL-S05J40

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	57199.00	0.00	0.00	5 1 1 5 2 1 1 1 4 1 1 1 1 1 1 4	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254300573.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-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254300573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 93K 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-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749048639833

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-S05J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-04 14:50:40] [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 14:50:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 14:50:41] [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 14:50:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 14:50:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 576 ms
[2025-06-04 14:50:41] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-04 14:50:41] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2025-06-04 14:50:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2025-06-04 14:50:41] [INFO ] Computed 13 invariants in 11 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[5, 0, 0, 5, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[5, +inf, +inf, 5, 2, 1, +inf, 1, 5, +inf, 1, 1, +inf, +inf, +inf, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-04 14:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:41] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-04 14:50:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 19 ms returned sat
[2025-06-04 14:50:41] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-06-04 14:50:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:50:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 14:50:41] [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 14:50:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-04 14:50:42] [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 14:50:42] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 8 ms to minimize.
[2025-06-04 14:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-04 14:50:42] [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 14:50:42] [INFO ] Deduced a trap composed of 23 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 14:50:42] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:42] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2025-06-04 14:50:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 172 ms
[2025-06-04 14:50:42] [INFO ] Added : 36 causal constraints over 8 iterations in 242 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 14:50:42] [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 14:50:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-04 14:50:42] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-04 14:50:42] [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 14:50:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-04 14:50:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 14:50:42] [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 14:50:42] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
[2025-06-04 14:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-04 14:50:42] [INFO ] Added : 20 causal constraints over 5 iterations in 333 ms. Result :sat
Minimization took 86 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
[2025-06-04 14:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-04 14:50:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-04 14:50:43] [INFO ] Added : 33 causal constraints over 7 iterations in 104 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [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 14:50:43] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 3 ms to minimize.
[2025-06-04 14:50:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2025-06-04 14:50:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-04 14:50:43] [INFO ] Added : 12 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 2 ms to minimize.
[2025-06-04 14:50:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2025-06-04 14:50:43] [INFO ] Added : 36 causal constraints over 8 iterations in 141 ms. Result :sat
Minimization took 97 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 14:50:43] [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 14:50:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
[2025-06-04 14:50:43] [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 14:50:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] Deduced a trap composed of 13 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 14:50:44] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 2 ms to minimize.
[2025-06-04 14:50:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 112 ms
[2025-06-04 14:50:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 14:50:44] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 4 ms to minimize.
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 4 ms to minimize.
[2025-06-04 14:50:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-04 14:50:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 14:50:44] [INFO ] Added : 33 causal constraints over 7 iterations in 31 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-04 14:50:44] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:44] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:50:44] [INFO ] Deduced a trap composed of 14 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 14:50:44] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
[2025-06-04 14:50:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 125 ms
[2025-06-04 14:50:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 14:50:44] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-04 14:50:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 14:50:44] [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 14:50:44] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
[2025-06-04 14:50:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-04 14:50:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 14:50:44] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-04 14:50:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 14:50:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-04 14:50:45] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 14:50:45] [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 14:50:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-04 14:50:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-04 14:50:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-04 14:50:45] [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 14:50:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2025-06-04 14:50:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-04 14:50:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 14:50:45] [INFO ] Added : 15 causal constraints over 3 iterations in 594 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 2, 1, 1, 1, 5, +inf, 1, +inf, +inf, +inf, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 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.
[2025-06-04 14:50:45] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 51 ms.
[2025-06-04 14:50:45] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 40 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] Max Struct:[+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] Max Struct:[+inf, +inf, 2, 1, 1, 5, +inf, 1, +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] Max Struct:[+inf, +inf, 2, 1, 1, 5, +inf, 1, +inf, +inf, +inf, 10]
[2025-06-04 14:50:46] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2025-06-04 14:50:46] [INFO ] Computed 102 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[41, 41, 2, 1, 1, 5, 11, 1, 11, 11, 41, 10]
RANDOM walk for 10000 steps (694 resets) in 170 ms. (58 steps per ms)
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (1304 resets) in 324 ms. (276 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 4, 1, 1, 1, 1, 4] Max Struct:[41, 41, 1, 5, 11, 11, 11, 41, 10]
[2025-06-04 14:50:46] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
[2025-06-04 14:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:46] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2025-06-04 14:50:46] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:46] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2025-06-04 14:50:46] [INFO ] [Real]Absence check using 95 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 14:50:46] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2025-06-04 14:50:46] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-04 14:50:47] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2025-06-04 14:50:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 14:50:47] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-04 14:50:47] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 81 ms.
[2025-06-04 14:50:47] [INFO ] Added : 9 causal constraints over 2 iterations in 285 ms. Result :sat
Minimization took 642 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:48] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-04 14:50:48] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-04 14:50:48] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2025-06-04 14:50:48] [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 14:50:48] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-04 14:50:48] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-04 14:50:49] [INFO ] [Nat]Absence check using state equation in 1108 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:49] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2025-06-04 14:50:49] [INFO ] [Real]Absence check using 95 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 14:50:50] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2025-06-04 14:50:50] [INFO ] [Real]Absence check using 95 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 14:50:50] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-04 14:50:50] [INFO ] [Real]Absence check using 95 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 14:50:50] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2025-06-04 14:50:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 14:50:50] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2025-06-04 14:50:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 4, 1, 1, 1, 1, 4] Max Struct:[1, 1, 1, 4, 1, 1, 1, 1, 4]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 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 629 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place place_520) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 934/934 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 624 transition count 889
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 95 place count 579 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 95 place count 579 transition count 844
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 185 place count 534 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 533 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 533 transition count 843
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 191 place count 531 transition count 841
Applied a total of 191 rules in 197 ms. Remains 531 /629 variables (removed 98) and now considering 841/934 (removed 93) transitions.
Running 835 sub problems to find dead transitions.
[2025-06-04 14:50:50] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 531 cols
[2025-06-04 14:50:50] [INFO ] Computed 97 invariants in 32 ms
[2025-06-04 14:50:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD620 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/529 variables, 4/93 constraints. Problems are: Problem set: 60 solved, 775 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 1/94 constraints. Problems are: Problem set: 60 solved, 775 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/1368 variables, and 94 constraints, problems are : Problem set: 60 solved, 775 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 5/8 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 775 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 85/85 constraints. Problems are: Problem set: 60 solved, 775 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 4/89 constraints. Problems are: Problem set: 60 solved, 775 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 0/89 constraints. Problems are: Problem set: 60 solved, 775 unsolved
At refinement iteration 3 (OVERLAPS) 4/529 variables, 4/93 constraints. Problems are: Problem set: 60 solved, 775 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 1/94 constraints. Problems are: Problem set: 60 solved, 775 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:51:25] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 1/95 constraints. Problems are: Problem set: 60 solved, 775 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/1368 variables, and 95 constraints, problems are : Problem set: 60 solved, 775 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 5/8 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41092ms problems are : Problem set: 60 solved, 775 unsolved
Search for dead transitions found 60 dead transitions in 41106ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 531/629 places, 781/934 transitions.
Applied a total of 0 rules in 25 ms. Remains 531 /531 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41345 ms. Remains : 531/629 places, 781/934 transitions.
[2025-06-04 14:51:31] [INFO ] Flow matrix only has 777 transitions (discarded 4 similar events)
// Phase 1: matrix 777 rows 531 cols
[2025-06-04 14:51:31] [INFO ] Computed 97 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (53975 resets) in 3879 ms. (257 steps per ms)
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (4691 resets) in 1025 ms. (974 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 )
[2025-06-04 14:51:36] [INFO ] Flatten gal took : 105 ms
[2025-06-04 14:51:36] [INFO ] Flatten gal took : 80 ms
[2025-06-04 14:51:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12397413418433322587.gal : 33 ms
[2025-06-04 14:51:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10305549717906800412.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/ReachabilityCardinality12397413418433322587.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10305549717906800412.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 56018 ms.

BK_STOP 1749048697032

--------------------
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-S05J40"
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-S05J40, 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-174881254300573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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