Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r143-smll-177955812400025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is FireWire-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 05:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 7 05:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 7 05:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 7 05:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 05:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K Mar 3 18:30 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-07-UpperBounds-00
FORMULA_NAME FireWire-PT-07-UpperBounds-01
FORMULA_NAME FireWire-PT-07-UpperBounds-02
FORMULA_NAME FireWire-PT-07-UpperBounds-03
FORMULA_NAME FireWire-PT-07-UpperBounds-04
FORMULA_NAME FireWire-PT-07-UpperBounds-05
FORMULA_NAME FireWire-PT-07-UpperBounds-06
FORMULA_NAME FireWire-PT-07-UpperBounds-07
FORMULA_NAME FireWire-PT-07-UpperBounds-08
FORMULA_NAME FireWire-PT-07-UpperBounds-09
FORMULA_NAME FireWire-PT-07-UpperBounds-10
FORMULA_NAME FireWire-PT-07-UpperBounds-11
FORMULA_NAME FireWire-PT-07-UpperBounds-12
FORMULA_NAME FireWire-PT-07-UpperBounds-13
FORMULA_NAME FireWire-PT-07-UpperBounds-14
FORMULA_NAME FireWire-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779625308084

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:21:50] [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]
[2026-05-24 12:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:21:51] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2026-05-24 12:21:51] [INFO ] Transformed 126 places.
[2026-05-24 12:21:51] [INFO ] Transformed 396 transitions.
[2026-05-24 12:21:51] [INFO ] Found NUPN structural information;
[2026-05-24 12:21:51] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 412 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]
[2026-05-24 12:21:51] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
// Phase 1: matrix 311 rows 126 cols
[2026-05-24 12:21:51] [INFO ] Computed 8 invariants in 24 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 (546 resets) in 104 ms. (95 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (839 resets) in 162 ms. (368 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]
[2026-05-24 12:21:51] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
[2026-05-24 12:21:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:52] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2026-05-24 12:21:52] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2026-05-24 12:21:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 12:21:52] [INFO ] [Real]Added 45 Read/Feed constraints in 40 ms returned sat
[2026-05-24 12:21:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-24 12:21:52] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2026-05-24 12:21:52] [INFO ] [Nat]Added 45 Read/Feed constraints in 45 ms returned sat
[2026-05-24 12:21:53] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 95 ms.
[2026-05-24 12:21:53] [INFO ] Added : 23 causal constraints over 5 iterations in 390 ms. Result :sat
Minimization took 166 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:53] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:21:53] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2026-05-24 12:21:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:21:54] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2026-05-24 12:21:54] [INFO ] [Nat]Added 45 Read/Feed constraints in 42 ms returned sat
[2026-05-24 12:21:54] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 84 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:21:54] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 33 ms to minimize.
[2026-05-24 12:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2026-05-24 12:21:54] [INFO ] Added : 22 causal constraints over 9 iterations in 730 ms. Result :sat
Minimization took 172 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:55] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:21:55] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2026-05-24 12:21:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-24 12:21:55] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2026-05-24 12:21:55] [INFO ] [Nat]Added 45 Read/Feed constraints in 38 ms returned sat
[2026-05-24 12:21:55] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 72 ms.
[2026-05-24 12:21:56] [INFO ] Added : 17 causal constraints over 4 iterations in 258 ms. Result :sat
Minimization took 159 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:56] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:21:56] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2026-05-24 12:21:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:21:56] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-24 12:21:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 40 ms returned sat
[2026-05-24 12:21:56] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 53 ms.
[2026-05-24 12:21:56] [INFO ] Added : 29 causal constraints over 7 iterations in 229 ms. Result :sat
Minimization took 121 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:21:57] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-24 12:21:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-24 12:21:57] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2026-05-24 12:21:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 69 ms returned sat
[2026-05-24 12:21:57] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 51 ms.
[2026-05-24 12:21:57] [INFO ] Added : 17 causal constraints over 5 iterations in 240 ms. Result :sat
Minimization took 102 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:58] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:21:58] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-24 12:21:58] [INFO ] [Real]Added 45 Read/Feed constraints in 31 ms returned sat
[2026-05-24 12:21:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:21:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-24 12:21:58] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2026-05-24 12:21:58] [INFO ] [Nat]Added 45 Read/Feed constraints in 41 ms returned sat
[2026-05-24 12:21:58] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 45 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:21:58] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
[2026-05-24 12:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2026-05-24 12:21:59] [INFO ] Added : 30 causal constraints over 7 iterations in 469 ms. Result :sat
Minimization took 165 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-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 343/343 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 126 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 121 transition count 329
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 121 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 119 transition count 321
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 118 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 118 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 116 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 115 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 114 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 113 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 113 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 112 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 112 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 111 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 111 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 110 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 110 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 109 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 109 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 108 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 108 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 107 transition count 294
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 104 transition count 300
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 56 place count 104 transition count 294
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 65 place count 104 transition count 285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 104 transition count 287
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 69 place count 103 transition count 285
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 71 place count 103 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 102 transition count 282
Applied a total of 72 rules in 326 ms. Remains 102 /126 variables (removed 24) and now considering 282/343 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 102/126 places, 282/343 transitions.
[2026-05-24 12:22:00] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
// Phase 1: matrix 253 rows 102 cols
[2026-05-24 12:22:00] [INFO ] Computed 8 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (57593 resets) in 1952 ms. (512 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000001 steps (42325 resets) in 1838 ms. (1631 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:22:04] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2026-05-24 12:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:22:04] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-24 12:22:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:22:04] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-24 12:22:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-24 12:22:04] [INFO ] [Nat]Added 39 Read/Feed constraints in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:04] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 21 ms to minimize.
[2026-05-24 12:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2026-05-24 12:22:04] [INFO ] Computed and/alt/rep : 115/460/115 causal constraints (skipped 136 transitions) in 42 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:05] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:05] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:05] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 4 ms to minimize.
[2026-05-24 12:22:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 549 ms
[2026-05-24 12:22:05] [INFO ] Added : 46 causal constraints over 11 iterations in 944 ms. Result :sat
Minimization took 112 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:22:05] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-24 12:22:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:22:05] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-24 12:22:05] [INFO ] [Nat]Added 39 Read/Feed constraints in 17 ms returned sat
[2026-05-24 12:22:06] [INFO ] Computed and/alt/rep : 115/460/115 causal constraints (skipped 136 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:06] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 12 ms to minimize.
[2026-05-24 12:22:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2026-05-24 12:22:06] [INFO ] Added : 14 causal constraints over 4 iterations in 316 ms. Result :sat
Minimization took 94 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:22:06] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-24 12:22:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:22:06] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-24 12:22:06] [INFO ] [Nat]Added 39 Read/Feed constraints in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:06] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:07] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 17 ms to minimize.
[2026-05-24 12:22:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2026-05-24 12:22:07] [INFO ] Computed and/alt/rep : 115/460/115 causal constraints (skipped 136 transitions) in 34 ms.
[2026-05-24 12:22:07] [INFO ] Added : 53 causal constraints over 11 iterations in 304 ms. Result :sat
Minimization took 104 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 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 282/282 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 102/102 places, 282/282 transitions.
[2026-05-24 12:22:07] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2026-05-24 12:22:07] [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 (57672 resets) in 1542 ms. (648 steps per ms)
BEST_FIRST walk for 3000002 steps (41971 resets) in 1507 ms. (1989 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:22:10] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2026-05-24 12:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 12:22:10] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-24 12:22:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:22:10] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-24 12:22:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-24 12:22:11] [INFO ] [Nat]Added 39 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:11] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 20 ms to minimize.
[2026-05-24 12:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2026-05-24 12:22:11] [INFO ] Computed and/alt/rep : 115/460/115 causal constraints (skipped 136 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:11] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:11] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:11] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 5 ms to minimize.
[2026-05-24 12:22:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2026-05-24 12:22:12] [INFO ] Added : 46 causal constraints over 11 iterations in 823 ms. Result :sat
Minimization took 163 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:12] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:22:12] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-24 12:22:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:22:12] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-24 12:22:12] [INFO ] [Nat]Added 39 Read/Feed constraints in 22 ms returned sat
[2026-05-24 12:22:12] [INFO ] Computed and/alt/rep : 115/460/115 causal constraints (skipped 136 transitions) in 30 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:12] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 12 ms to minimize.
[2026-05-24 12:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2026-05-24 12:22:13] [INFO ] Added : 14 causal constraints over 4 iterations in 417 ms. Result :sat
Minimization took 130 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:13] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:22:13] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-24 12:22:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:22:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:22:13] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-24 12:22:13] [INFO ] [Nat]Added 39 Read/Feed constraints in 37 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:13] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:13] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 10 ms to minimize.
[2026-05-24 12:22:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2026-05-24 12:22:13] [INFO ] Computed and/alt/rep : 115/460/115 causal constraints (skipped 136 transitions) in 19 ms.
[2026-05-24 12:22:14] [INFO ] Added : 53 causal constraints over 11 iterations in 252 ms. Result :sat
Minimization took 156 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 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 282/282 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 102/102 places, 282/282 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 282/282 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2026-05-24 12:22:14] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2026-05-24 12:22:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:22:14] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 12:22:14] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2026-05-24 12:22:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:22:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-24 12:22:15] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:22:15] [INFO ] Redundant transitions in 28 ms returned []
Running 280 sub problems to find dead transitions.
[2026-05-24 12:22:15] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2026-05-24 12:22:15] [INFO ] Invariant cache hit.
[2026-05-24 12:22:15] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:17] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:17] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:17] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:18] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:18] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:19] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 253/354 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:27] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:27] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 1/355 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 5.0 2.0))
(t1 1.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 1.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 1.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 1.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 6.0)
(t34 0.0)
(t35 1.0)
(t36 1.0)
(t37 1.0)
(t38 1.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 1.0)
(t49 0.0)
(t50 1.0)
(t51 0.0)
(t52 0.0)
(t53 1.0)
(t54 0.0)
(t55 1.0)
(t56 0.0)
(t57 0.0)
(t58 1.0)
(t59 0.0)
(t60 1.0)
(t61 0.0)
(t62 0.0)
(t63 1.0)
(t64 0.0)
(t65 1.0)
(t66 0.0)
(t67 0.0)
(t68 1.0)
(t69 1.0)
(t70 0.0)
(t71 0.0)
(t72 1.0)
(t73 0.0)
(t74 1.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 2.0)
(t97 0.0)
(t98 0.0)
(t99 2.0)
(t100 0.0)
(t101 0.0)
(t102 2.0)
(t103 0.0)
(t104 1.0)
(t105 0.0)
(t106 2.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 (/ 11.0 2.0))
(t111 (/ 3.0 4.0))
(t112 0.0)
(t113 (/ 19.0 4.0))
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 1.0)
(t118 0.0)
(t119 1.0)
(t120 0.0)
(t121 1.0)
(t122 0.0)
(t123 2.0)
(t124 0.0)
(t125 timeout
2.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/355 variables, and 157 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 253/354 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 39/156 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 280/436 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:22:55] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 280 unsolved
SMT process timed out in 60391ms, After SMT, problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61142 ms. Remains : 102/102 places, 282/282 transitions.
RANDOM walk for 40000 steps (2250 resets) in 1749 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (533 resets) in 434 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (507 resets) in 487 ms. (81 steps per ms) remains 6/6 properties
[2026-05-24 12:23:16] [INFO ] Flatten gal took : 256 ms
BEST_FIRST walk for 40004 steps (606 resets) in 362 ms. (110 steps per ms) remains 6/6 properties
[2026-05-24 12:23:16] [INFO ] Flatten gal took : 127 ms
BEST_FIRST walk for 40003 steps (600 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (521 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
[2026-05-24 12:23:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2867428106531469613.gal : 57 ms
[2026-05-24 12:23:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2476908350738292056.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/ReachabilityCardinality2867428106531469613.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2476908350738292056.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (552 resets) in 187 ms. (212 steps per ms) remains 6/6 properties

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 ...328
Finished probabilistic random walk after 2257 steps, run visited all 6 properties in 60 ms. (steps per millisecond=37 )
Probabilistic random walk after 2257 steps, saw 1296 distinct states, run finished after 68 ms. (steps per millisecond=33 ) properties seen :6
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality2476908350738292056.prop.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-07-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-07-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-07-UpperBounds-13 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 86029 ms.

BK_STOP 1779625396850

--------------------
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-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is FireWire-PT-07, 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 r143-smll-177955812400025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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