fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102300317
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FireWire-PT-10

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102300317.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 FireWire-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102300317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 101K 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 FireWire-PT-10-UpperBounds-00
FORMULA_NAME FireWire-PT-10-UpperBounds-01
FORMULA_NAME FireWire-PT-10-UpperBounds-02
FORMULA_NAME FireWire-PT-10-UpperBounds-03
FORMULA_NAME FireWire-PT-10-UpperBounds-04
FORMULA_NAME FireWire-PT-10-UpperBounds-05
FORMULA_NAME FireWire-PT-10-UpperBounds-06
FORMULA_NAME FireWire-PT-10-UpperBounds-07
FORMULA_NAME FireWire-PT-10-UpperBounds-08
FORMULA_NAME FireWire-PT-10-UpperBounds-09
FORMULA_NAME FireWire-PT-10-UpperBounds-10
FORMULA_NAME FireWire-PT-10-UpperBounds-11
FORMULA_NAME FireWire-PT-10-UpperBounds-12
FORMULA_NAME FireWire-PT-10-UpperBounds-13
FORMULA_NAME FireWire-PT-10-UpperBounds-14
FORMULA_NAME FireWire-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748860900147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 10:41:42] [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-02 10:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 10:41:43] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2025-06-02 10:41:43] [INFO ] Transformed 131 places.
[2025-06-02 10:41:43] [INFO ] Transformed 409 transitions.
[2025-06-02 10:41:43] [INFO ] Found NUPN structural information;
[2025-06-02 10:41:43] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 10:41:43] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
// Phase 1: matrix 321 rows 131 cols
[2025-06-02 10:41:43] [INFO ] Computed 8 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (564 resets) in 100 ms. (99 steps per ms)
FORMULA FireWire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80004 steps (1175 resets) in 303 ms. (263 steps per ms)
FORMULA FireWire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-02 10:41:44] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
[2025-06-02 10:41:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:44] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-02 10:41:44] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 10:41: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-02 10:41:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-06-02 10:41:45] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-06-02 10:41:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:41:45] [INFO ] [Nat]Added 45 Read/Feed constraints in 67 ms returned sat
[2025-06-02 10:41:45] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 92 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:46] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 21 ms to minimize.
[2025-06-02 10:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2025-06-02 10:41:46] [INFO ] Added : 18 causal constraints over 5 iterations in 712 ms. Result :sat
Minimization took 74 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 10:41:46] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-06-02 10:41:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 10:41:46] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-06-02 10:41:46] [INFO ] [Nat]Added 45 Read/Feed constraints in 52 ms returned sat
[2025-06-02 10:41:46] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 74 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:47] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 15 ms to minimize.
[2025-06-02 10:41:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-02 10:41:47] [INFO ] Added : 31 causal constraints over 8 iterations in 700 ms. Result :sat
Minimization took 163 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:47] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 10:41:48] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2025-06-02 10:41: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-02 10:41:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 10:41:48] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2025-06-02 10:41:48] [INFO ] [Nat]Added 45 Read/Feed constraints in 46 ms returned sat
[2025-06-02 10:41:48] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 69 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:48] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 7 ms to minimize.
[2025-06-02 10:41:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-06-02 10:41:48] [INFO ] Added : 12 causal constraints over 4 iterations in 468 ms. Result :sat
Minimization took 117 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:49] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 10:41:49] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-02 10:41:49] [INFO ] [Real]Added 45 Read/Feed constraints in 22 ms returned sat
[2025-06-02 10:41:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 10:41:49] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-06-02 10:41:49] [INFO ] [Nat]Added 45 Read/Feed constraints in 56 ms returned sat
[2025-06-02 10:41:49] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 73 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:49] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
[2025-06-02 10:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-06-02 10:41:50] [INFO ] Added : 28 causal constraints over 7 iterations in 464 ms. Result :sat
Minimization took 81 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:50] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:41:50] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-02 10:41:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:41:50] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-06-02 10:41:50] [INFO ] [Nat]Added 45 Read/Feed constraints in 29 ms returned sat
[2025-06-02 10:41:50] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 62 ms.
[2025-06-02 10:41:50] [INFO ] Added : 17 causal constraints over 4 iterations in 275 ms. Result :sat
Minimization took 110 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:51] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 10:41:51] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-06-02 10:41:51] [INFO ] [Real]Added 45 Read/Feed constraints in 33 ms returned sat
[2025-06-02 10:41:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 10:41:51] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-06-02 10:41:51] [INFO ] [Nat]Added 45 Read/Feed constraints in 28 ms returned sat
[2025-06-02 10:41:51] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
[2025-06-02 10:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-06-02 10:41:51] [INFO ] Added : 13 causal constraints over 5 iterations in 347 ms. Result :sat
Minimization took 92 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:52] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 10:41:52] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-06-02 10:41:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 10:41:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 10:41:52] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-06-02 10:41:52] [INFO ] [Nat]Added 45 Read/Feed constraints in 28 ms returned sat
[2025-06-02 10:41:52] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 41 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:52] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:52] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 5 ms to minimize.
[2025-06-02 10:41:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2025-06-02 10:41:53] [INFO ] Added : 37 causal constraints over 10 iterations in 580 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 127 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 127 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 127 transition count 339
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 126 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 125 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 124 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 123 transition count 329
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 122 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 121 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 121 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 120 transition count 323
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 117 transition count 329
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 117 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 49 place count 117 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 117 transition count 316
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 116 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 116 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 115 transition count 311
Applied a total of 56 rules in 206 ms. Remains 115 /131 variables (removed 16) and now considering 311/353 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 115/131 places, 311/353 transitions.
[2025-06-02 10:41:53] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
// Phase 1: matrix 282 rows 115 cols
[2025-06-02 10:41:53] [INFO ] Computed 8 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57888 resets) in 1843 ms. (542 steps per ms)
FORMULA FireWire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (56869 resets) in 2663 ms. (1501 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 10:41:58] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-06-02 10:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:41:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 10:41:58] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 10:41:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:41:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:41:58] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-06-02 10:41:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:41:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2025-06-02 10:41:58] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
[2025-06-02 10:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-06-02 10:41:58] [INFO ] Added : 49 causal constraints over 10 iterations in 399 ms. Result :sat
Minimization took 131 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:41:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 10:41:59] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-06-02 10:41:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:41:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 10:41:59] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-02 10:41:59] [INFO ] [Nat]Added 42 Read/Feed constraints in 17 ms returned sat
[2025-06-02 10:41:59] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:59] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:41:59] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:00] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 15 ms to minimize.
[2025-06-02 10:42:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:00] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
[2025-06-02 10:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-06-02 10:42:00] [INFO ] Added : 58 causal constraints over 15 iterations in 869 ms. Result :sat
Minimization took 126 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:00] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-02 10:42:00] [INFO ] [Real]Added 42 Read/Feed constraints in 20 ms returned sat
[2025-06-02 10:42:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:00] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-02 10:42:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2025-06-02 10:42:00] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:01] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 6 ms to minimize.
[2025-06-02 10:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-06-02 10:42:01] [INFO ] Added : 50 causal constraints over 11 iterations in 389 ms. Result :sat
Minimization took 183 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:01] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:42:01] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-02 10:42:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 10:42:01] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-02 10:42:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2025-06-02 10:42:01] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:02] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:02] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 8 ms to minimize.
[2025-06-02 10:42:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2025-06-02 10:42:02] [INFO ] Added : 41 causal constraints over 10 iterations in 574 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 23 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 115/115 places, 311/311 transitions.
[2025-06-02 10:42:02] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-06-02 10:42:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (57839 resets) in 1367 ms. (730 steps per ms)
BEST_FIRST walk for 4000001 steps (56491 resets) in 1938 ms. (2062 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 10:42:05] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-06-02 10:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:05] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-02 10:42:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:06] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-06-02 10:42:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:42:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2025-06-02 10:42:06] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2025-06-02 10:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-06-02 10:42:06] [INFO ] Added : 49 causal constraints over 10 iterations in 464 ms. Result :sat
Minimization took 201 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:06] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:42:07] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-06-02 10:42:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 10:42:07] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-06-02 10:42:07] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2025-06-02 10:42:07] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:07] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:08] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:08] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 25 ms to minimize.
[2025-06-02 10:42:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 718 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
[2025-06-02 10:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-02 10:42:08] [INFO ] Added : 58 causal constraints over 15 iterations in 1411 ms. Result :sat
Minimization took 207 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:08] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:42:09] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-06-02 10:42:09] [INFO ] [Real]Added 42 Read/Feed constraints in 34 ms returned sat
[2025-06-02 10:42:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:42:09] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-06-02 10:42:09] [INFO ] [Nat]Added 42 Read/Feed constraints in 55 ms returned sat
[2025-06-02 10:42:09] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 32 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:10] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 10 ms to minimize.
[2025-06-02 10:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-02 10:42:10] [INFO ] Added : 50 causal constraints over 11 iterations in 607 ms. Result :sat
Minimization took 223 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:10] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 10:42:10] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-06-02 10:42:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 10:42:10] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-02 10:42:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 32 ms returned sat
[2025-06-02 10:42:10] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 32 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:11] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:11] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 12 ms to minimize.
[2025-06-02 10:42:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2025-06-02 10:42:11] [INFO ] Added : 41 causal constraints over 10 iterations in 828 ms. Result :sat
Minimization took 206 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 16 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 115/115 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 14 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2025-06-02 10:42:12] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-06-02 10:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:42:12] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-06-02 10:42:12] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-06-02 10:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:42:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:42:12] [INFO ] Implicit Places using invariants and state equation in 561 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 771 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/115 places, 311/311 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 309
Applied a total of 4 rules in 31 ms. Remains 111 /113 variables (removed 2) and now considering 309/311 (removed 2) transitions.
[2025-06-02 10:42:12] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
// Phase 1: matrix 280 rows 111 cols
[2025-06-02 10:42:12] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:42:12] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-02 10:42:13] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:42:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:42:13] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/115 places, 309/311 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1415 ms. Remains : 111/115 places, 309/311 transitions.
[2025-06-02 10:42:13] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (58158 resets) in 1698 ms. (588 steps per ms)
BEST_FIRST walk for 4000002 steps (56468 resets) in 2231 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 10:42:17] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:17] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:17] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-02 10:42:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:17] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-06-02 10:42:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:42:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:17] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 18 ms to minimize.
[2025-06-02 10:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-06-02 10:42:17] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:18] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 4 ms to minimize.
[2025-06-02 10:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-06-02 10:42:18] [INFO ] Added : 41 causal constraints over 9 iterations in 418 ms. Result :sat
Minimization took 199 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 10:42:18] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2025-06-02 10:42:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:18] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-06-02 10:42:18] [INFO ] [Nat]Added 42 Read/Feed constraints in 17 ms returned sat
[2025-06-02 10:42:18] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 24 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:19] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:19] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 5 ms to minimize.
[2025-06-02 10:42:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2025-06-02 10:42:19] [INFO ] Added : 59 causal constraints over 14 iterations in 619 ms. Result :sat
Minimization took 232 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:19] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 10:42:19] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-06-02 10:42:19] [INFO ] [Real]Added 42 Read/Feed constraints in 16 ms returned sat
[2025-06-02 10:42:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:19] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-02 10:42:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:20] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 16 ms to minimize.
[2025-06-02 10:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2025-06-02 10:42:20] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 35 ms.
[2025-06-02 10:42:20] [INFO ] Added : 38 causal constraints over 8 iterations in 249 ms. Result :sat
Minimization took 144 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:20] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 10:42:20] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-02 10:42:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 10:42:20] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-06-02 10:42:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 21 ms returned sat
[2025-06-02 10:42:21] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 33 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:21] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:21] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:22] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:22] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:22] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 7 ms to minimize.
[2025-06-02 10:42:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 871 ms
[2025-06-02 10:42:22] [INFO ] Added : 61 causal constraints over 13 iterations in 1377 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 111/111 places, 309/309 transitions.
[2025-06-02 10:42:22] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57876 resets) in 1427 ms. (700 steps per ms)
BEST_FIRST walk for 3000002 steps (42191 resets) in 1512 ms. (1982 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-02 10:42:25] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:25] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:25] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-02 10:42:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 10:42:25] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-02 10:42:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:42:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 17 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:25] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 13 ms to minimize.
[2025-06-02 10:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-06-02 10:42:25] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:26] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 4 ms to minimize.
[2025-06-02 10:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-02 10:42:26] [INFO ] Added : 41 causal constraints over 9 iterations in 314 ms. Result :sat
Minimization took 144 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:26] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 10:42:26] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-02 10:42:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:26] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-02 10:42:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2025-06-02 10:42:26] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:27] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:27] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 3 ms to minimize.
[2025-06-02 10:42:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2025-06-02 10:42:27] [INFO ] Added : 59 causal constraints over 14 iterations in 584 ms. Result :sat
Minimization took 159 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 10:42:27] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-06-02 10:42:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 10:42:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 10:42:27] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-06-02 10:42:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2025-06-02 10:42:27] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:28] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:28] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:28] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:29] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:29] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 11 ms to minimize.
[2025-06-02 10:42:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1132 ms
[2025-06-02 10:42:29] [INFO ] Added : 61 causal constraints over 13 iterations in 1539 ms. Result :sat
Minimization took 223 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 309/309 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 111/111 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 309/309 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2025-06-02 10:42:29] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:42:29] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 10:42:29] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:42:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:42:30] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:42:30] [INFO ] Redundant transitions in 34 ms returned []
Running 307 sub problems to find dead transitions.
[2025-06-02 10:42:30] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-06-02 10:42:30] [INFO ] Invariant cache hit.
[2025-06-02 10:42:30] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:32] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:32] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:33] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:33] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:33] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:33] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:35] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:35] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:36] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 280/390 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 42/167 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:42:45] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/391 variables, and 169 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 280/390 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 42/168 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 307/475 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:43:10] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:43:20] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/391 variables, and 477 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60470ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61123 ms. Remains : 111/111 places, 309/309 transitions.
RANDOM walk for 40000 steps (2324 resets) in 2072 ms. (19 steps per ms) remains 6/6 properties
[2025-06-02 10:43:31] [INFO ] Flatten gal took : 255 ms
[2025-06-02 10:43:31] [INFO ] Flatten gal took : 116 ms
BEST_FIRST walk for 40003 steps (579 resets) in 558 ms. (71 steps per ms) remains 6/6 properties
[2025-06-02 10:43:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7865936930872450576.gal : 36 ms
[2025-06-02 10:43:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17563027903643264942.prop : 1 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/ReachabilityCardinality7865936930872450576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17563027903643264942.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (578 resets) in 362 ms. (110 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality17563027903643264942.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 43
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :43 after 111
BEST_FIRST walk for 40004 steps (526 resets) in 376 ms. (106 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :111 after 252
BEST_FIRST walk for 40003 steps (568 resets) in 268 ms. (148 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :252 after 1678
BEST_FIRST walk for 40004 steps (564 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (552 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1678 after 5407
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :5407 after 31296
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.56095e+06,1.19125,29720,2,1921,15,79727,12,0,761,93873,0
Total reachable state count : 7560950

Verifying 6 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,6395,1.19249,29848,2,537,15,79727,12,0,763,93873,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6395,1.19322,29976,2,537,15,79727,12,0,763,93873,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,8750,1.19373,29976,2,564,15,79727,12,0,764,93873,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,8750,1.19418,29976,2,564,15,79727,12,0,764,93873,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,6395,1.1949,29976,2,537,15,79727,12,0,765,93873,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6395,1.19558,29976,2,537,15,79727,12,0,765,93873,0
Interrupted probabilistic random walk after 603741 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 6
Probabilistic random walk after 603741 steps, saw 130219 distinct states, run finished after 3007 ms. (steps per millisecond=200 ) properties seen :0
FORMULA FireWire-PT-10-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-10-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-10-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 112160 ms.

BK_STOP 1748861015195

--------------------
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="FireWire-PT-10"
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 FireWire-PT-10, 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 r086-smll-174860102300317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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