Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K 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 84K 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-01-UpperBounds-00
FORMULA_NAME FireWire-PT-01-UpperBounds-01
FORMULA_NAME FireWire-PT-01-UpperBounds-02
FORMULA_NAME FireWire-PT-01-UpperBounds-03
FORMULA_NAME FireWire-PT-01-UpperBounds-04
FORMULA_NAME FireWire-PT-01-UpperBounds-05
FORMULA_NAME FireWire-PT-01-UpperBounds-06
FORMULA_NAME FireWire-PT-01-UpperBounds-07
FORMULA_NAME FireWire-PT-01-UpperBounds-08
FORMULA_NAME FireWire-PT-01-UpperBounds-09
FORMULA_NAME FireWire-PT-01-UpperBounds-10
FORMULA_NAME FireWire-PT-01-UpperBounds-11
FORMULA_NAME FireWire-PT-01-UpperBounds-12
FORMULA_NAME FireWire-PT-01-UpperBounds-13
FORMULA_NAME FireWire-PT-01-UpperBounds-14
FORMULA_NAME FireWire-PT-01-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748840011121

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 04:53:33] [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 04:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 04:53:34] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2025-06-02 04:53:34] [INFO ] Transformed 107 places.
[2025-06-02 04:53:34] [INFO ] Transformed 346 transitions.
[2025-06-02 04:53:34] [INFO ] Found NUPN structural information;
[2025-06-02 04:53:34] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 559 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 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 04:53:34] [INFO ] Flow matrix only has 261 transitions (discarded 32 similar events)
// Phase 1: matrix 261 rows 107 cols
[2025-06-02 04:53:34] [INFO ] Computed 8 invariants in 30 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 (539 resets) in 105 ms. (94 steps per ms)
FORMULA FireWire-PT-01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (686 resets) in 164 ms. (363 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-02 04:53:34] [INFO ] Flow matrix only has 261 transitions (discarded 32 similar events)
[2025-06-02 04:53:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:53:35] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-02 04:53:35] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-06-02 04:53:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 04:53:35] [INFO ] [Real]Added 40 Read/Feed constraints in 38 ms returned sat
[2025-06-02 04:53:35] [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 04:53:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-02 04:53:36] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-06-02 04:53:36] [INFO ] [Nat]Added 40 Read/Feed constraints in 65 ms returned sat
[2025-06-02 04:53:36] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 92 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:36] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 28 ms to minimize.
[2025-06-02 04:53:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2025-06-02 04:53:36] [INFO ] Added : 37 causal constraints over 8 iterations in 792 ms. Result :sat
Minimization took 277 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:53:37] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 04:53:37] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-06-02 04:53:37] [INFO ] [Real]Added 40 Read/Feed constraints in 20 ms returned sat
[2025-06-02 04:53:37] [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 04:53:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 04:53:37] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-02 04:53:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 33 ms returned sat
[2025-06-02 04:53:37] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 56 ms.
[2025-06-02 04:53:38] [INFO ] Added : 28 causal constraints over 6 iterations in 305 ms. Result :sat
Minimization took 266 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:53:38] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 04:53:38] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-02 04:53:38] [INFO ] [Real]Added 40 Read/Feed constraints in 13 ms returned sat
[2025-06-02 04:53:38] [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 04:53:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 04:53:38] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-06-02 04:53:38] [INFO ] [Nat]Added 40 Read/Feed constraints in 45 ms returned sat
[2025-06-02 04:53:38] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 54 ms.
[2025-06-02 04:53:39] [INFO ] Added : 9 causal constraints over 2 iterations in 162 ms. Result :sat
Minimization took 249 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:53:39] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 04:53:39] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-06-02 04:53:39] [INFO ] [Real]Added 40 Read/Feed constraints in 17 ms returned sat
[2025-06-02 04:53:39] [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 04:53:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 04:53:39] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-02 04:53:39] [INFO ] [Nat]Added 40 Read/Feed constraints in 31 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:39] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 18 ms to minimize.
[2025-06-02 04:53:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2025-06-02 04:53:40] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 54 ms.
[2025-06-02 04:53:40] [INFO ] Added : 41 causal constraints over 9 iterations in 371 ms. Result :sat
Minimization took 286 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:53:40] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 04:53:40] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-06-02 04:53:40] [INFO ] [Real]Added 40 Read/Feed constraints in 28 ms returned sat
[2025-06-02 04:53:40] [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 04:53:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 04:53:41] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-02 04:53:41] [INFO ] [Nat]Added 40 Read/Feed constraints in 35 ms returned sat
[2025-06-02 04:53:41] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 54 ms.
[2025-06-02 04:53:41] [INFO ] Added : 37 causal constraints over 9 iterations in 402 ms. Result :sat
Minimization took 267 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:53:41] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 04:53:42] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-06-02 04:53:42] [INFO ] [Real]Added 40 Read/Feed constraints in 17 ms returned sat
[2025-06-02 04:53:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:53:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 04:53:42] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-02 04:53:42] [INFO ] [Nat]Added 40 Read/Feed constraints in 35 ms returned sat
[2025-06-02 04:53:42] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 49 ms.
[2025-06-02 04:53:42] [INFO ] Added : 14 causal constraints over 3 iterations in 202 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 107 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p13) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 290/290 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 285
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 105 transition count 285
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 102 transition count 277
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 102 transition count 277
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 100 transition count 273
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 100 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 97 transition count 280
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 29 place count 97 transition count 274
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 38 place count 97 transition count 265
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 97 transition count 268
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 45 place count 95 transition count 265
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 47 place count 95 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 94 transition count 262
Applied a total of 48 rules in 254 ms. Remains 94 /107 variables (removed 13) and now considering 262/290 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 94/107 places, 262/290 transitions.
[2025-06-02 04:53:43] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
// Phase 1: matrix 233 rows 94 cols
[2025-06-02 04:53:43] [INFO ] Computed 8 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64022 resets) in 1945 ms. (513 steps per ms)
BEST_FIRST walk for 1000000 steps (16222 resets) in 730 ms. (1367 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 04:53:46] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-06-02 04:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:53:46] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 04:53:46] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2025-06-02 04:53:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:53:46] [INFO ] [Real]Added 37 Read/Feed constraints in 19 ms returned sat
[2025-06-02 04:53:46] [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 04:53:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 04:53:46] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-02 04:53:46] [INFO ] [Nat]Added 37 Read/Feed constraints in 25 ms returned sat
[2025-06-02 04:53:46] [INFO ] Computed and/alt/rep : 103/414/103 causal constraints (skipped 128 transitions) in 37 ms.
[2025-06-02 04:53:46] [INFO ] Added : 7 causal constraints over 2 iterations in 119 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 262/262 transitions.
Applied a total of 0 rules in 17 ms. Remains 94 /94 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 94/94 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 94 /94 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-06-02 04:53:47] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-06-02 04:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:53:47] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-02 04:53:47] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-06-02 04:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:53:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:53:47] [INFO ] Implicit Places using invariants and state equation in 355 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 544 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/94 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 93 /93 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 580 ms. Remains : 93/94 places, 262/262 transitions.
[2025-06-02 04:53:47] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
// Phase 1: matrix 233 rows 93 cols
[2025-06-02 04:53:47] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64145 resets) in 1738 ms. (575 steps per ms)
BEST_FIRST walk for 1000001 steps (16240 resets) in 443 ms. (2252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 04:53:49] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-06-02 04:53:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:53:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 04:53:50] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-02 04:53:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:53:50] [INFO ] [Real]Added 37 Read/Feed constraints in 11 ms returned sat
[2025-06-02 04:53:50] [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 04:53:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 04:53:50] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-02 04:53:50] [INFO ] [Nat]Added 37 Read/Feed constraints in 21 ms returned sat
[2025-06-02 04:53:50] [INFO ] Computed and/alt/rep : 103/414/103 causal constraints (skipped 128 transitions) in 37 ms.
[2025-06-02 04:53:50] [INFO ] Added : 48 causal constraints over 13 iterations in 400 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 262/262 transitions.
Applied a total of 0 rules in 21 ms. Remains 93 /93 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 93/93 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 93 /93 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-06-02 04:53:50] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-06-02 04:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:53:51] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-02 04:53:51] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-06-02 04:53:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:53:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:53:51] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:53:51] [INFO ] Redundant transitions in 25 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-02 04:53:51] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-06-02 04:53:51] [INFO ] Invariant cache hit.
[2025-06-02 04:53:51] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:53] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:58] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:58] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:58] [INFO ] Deduced a trap composed of 15 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 04:53:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 233/325 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 37/142 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:05] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/326 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:15] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/326 variables, and 145 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 233/325 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 260/404 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 405 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61122 ms. Remains : 93/93 places, 262/262 transitions.
RANDOM walk for 40000 steps (2564 resets) in 1109 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (694 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (656 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3729 steps, run visited all 2 properties in 115 ms. (steps per millisecond=32 )
Probabilistic random walk after 3729 steps, saw 1778 distinct states, run finished after 134 ms. (steps per millisecond=27 ) properties seen :2
[2025-06-02 04:54:52] [INFO ] Flatten gal took : 129 ms
[2025-06-02 04:54:52] [INFO ] Flatten gal took : 52 ms
[2025-06-02 04:54:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality471662736129701904.gal : 27 ms
[2025-06-02 04:54:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13294780408763962267.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality471662736129701904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13294780408763962267.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-01-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 79143 ms.

BK_STOP 1748840093020

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

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