Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 100K 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-09-UpperBounds-00
FORMULA_NAME FireWire-PT-09-UpperBounds-01
FORMULA_NAME FireWire-PT-09-UpperBounds-02
FORMULA_NAME FireWire-PT-09-UpperBounds-03
FORMULA_NAME FireWire-PT-09-UpperBounds-04
FORMULA_NAME FireWire-PT-09-UpperBounds-05
FORMULA_NAME FireWire-PT-09-UpperBounds-06
FORMULA_NAME FireWire-PT-09-UpperBounds-07
FORMULA_NAME FireWire-PT-09-UpperBounds-08
FORMULA_NAME FireWire-PT-09-UpperBounds-09
FORMULA_NAME FireWire-PT-09-UpperBounds-10
FORMULA_NAME FireWire-PT-09-UpperBounds-11
FORMULA_NAME FireWire-PT-09-UpperBounds-12
FORMULA_NAME FireWire-PT-09-UpperBounds-13
FORMULA_NAME FireWire-PT-09-UpperBounds-14
FORMULA_NAME FireWire-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748676121770

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:22:04] [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-05-31 07:22:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:22:05] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2025-05-31 07:22:05] [INFO ] Transformed 130 places.
[2025-05-31 07:22:05] [INFO ] Transformed 408 transitions.
[2025-05-31 07:22:05] [INFO ] Found NUPN structural information;
[2025-05-31 07:22:05] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:22:05] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2025-05-31 07:22:05] [INFO ] Computed 8 invariants in 55 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 (551 resets) in 114 ms. (86 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (1027 resets) in 358 ms. (194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:22:06] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
[2025-05-31 07:22:06] [INFO ] Invariant cache hit.
[2025-05-31 07:22:06] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-31 07:22:07] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-05-31 07:22:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 07:22:07] [INFO ] [Real]Added 45 Read/Feed constraints in 47 ms returned sat
[2025-05-31 07:22:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-31 07:22:07] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2025-05-31 07:22:07] [INFO ] [Nat]Added 45 Read/Feed constraints in 48 ms returned sat
[2025-05-31 07:22:07] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 97 ms.
[2025-05-31 07:22:08] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 33 ms to minimize.
[2025-05-31 07:22:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-05-31 07:22:08] [INFO ] Added : 22 causal constraints over 6 iterations in 637 ms. Result :sat
Minimization took 206 ms.
[2025-05-31 07:22:08] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:09] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-05-31 07:22:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:22:09] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2025-05-31 07:22:09] [INFO ] [Nat]Added 45 Read/Feed constraints in 32 ms returned sat
[2025-05-31 07:22:09] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 55 ms.
[2025-05-31 07:22:09] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 4 ms to minimize.
[2025-05-31 07:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2025-05-31 07:22:09] [INFO ] Added : 32 causal constraints over 7 iterations in 512 ms. Result :sat
Minimization took 254 ms.
[2025-05-31 07:22:10] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:22:10] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-05-31 07:22:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:22:10] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-05-31 07:22:10] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2025-05-31 07:22:10] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 59 ms.
[2025-05-31 07:22:10] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2025-05-31 07:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2025-05-31 07:22:11] [INFO ] Added : 18 causal constraints over 5 iterations in 400 ms. Result :sat
Minimization took 183 ms.
[2025-05-31 07:22:11] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:11] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-05-31 07:22:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:22:11] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-31 07:22:11] [INFO ] [Nat]Added 45 Read/Feed constraints in 41 ms returned sat
[2025-05-31 07:22:11] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 3 ms to minimize.
[2025-05-31 07:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2025-05-31 07:22:12] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 81 ms.
[2025-05-31 07:22:12] [INFO ] Added : 0 causal constraints over 0 iterations in 147 ms. Result :sat
Minimization took 194 ms.
[2025-05-31 07:22:12] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:22:12] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-05-31 07:22:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:22:12] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 07:22:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 34 ms returned sat
[2025-05-31 07:22:12] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 41 ms.
[2025-05-31 07:22:13] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2025-05-31 07:22:13] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2025-05-31 07:22:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2025-05-31 07:22:13] [INFO ] Added : 24 causal constraints over 5 iterations in 379 ms. Result :sat
Minimization took 200 ms.
[2025-05-31 07:22:13] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:22:13] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-05-31 07:22:13] [INFO ] [Real]Added 45 Read/Feed constraints in 24 ms returned sat
[2025-05-31 07:22:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-31 07:22:13] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 07:22:13] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2025-05-31 07:22:13] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 37 ms.
[2025-05-31 07:22:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2025-05-31 07:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-05-31 07:22:14] [INFO ] Added : 17 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 236 ms.
[2025-05-31 07:22:14] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:22:14] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-05-31 07:22:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:22:14] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-05-31 07:22:14] [INFO ] [Nat]Added 45 Read/Feed constraints in 14 ms returned sat
[2025-05-31 07:22:14] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 36 ms.
[2025-05-31 07:22:15] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2025-05-31 07:22:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2025-05-31 07:22:15] [INFO ] Added : 30 causal constraints over 7 iterations in 418 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-03 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 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 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 130 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 126 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 126 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 125 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 124 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 123 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 122 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 121 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 120 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 119 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 118 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 117 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 116 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 116 transition count 313
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 36 place count 115 transition count 312
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 112 transition count 318
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 48 place count 112 transition count 312
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 57 place count 112 transition count 303
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 112 transition count 305
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 61 place count 111 transition count 303
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 63 place count 111 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 110 transition count 300
Applied a total of 64 rules in 276 ms. Remains 110 /130 variables (removed 20) and now considering 300/352 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 110/130 places, 300/352 transitions.
[2025-05-31 07:22:16] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
// Phase 1: matrix 271 rows 110 cols
[2025-05-31 07:22:16] [INFO ] Computed 8 invariants in 8 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 (57750 resets) in 1591 ms. (628 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (42370 resets) in 1563 ms. (1918 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-31 07:22:19] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2025-05-31 07:22:19] [INFO ] Invariant cache hit.
[2025-05-31 07:22:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:22:19] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-05-31 07:22:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:22:19] [INFO ] [Real]Added 40 Read/Feed constraints in 28 ms returned sat
[2025-05-31 07:22:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 07:22:19] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-31 07:22:19] [INFO ] [Nat]Added 40 Read/Feed constraints in 30 ms returned sat
[2025-05-31 07:22:19] [INFO ] Computed and/alt/rep : 121/492/121 causal constraints (skipped 148 transitions) in 30 ms.
[2025-05-31 07:22:19] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 3 ms to minimize.
[2025-05-31 07:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-05-31 07:22:20] [INFO ] Added : 37 causal constraints over 8 iterations in 358 ms. Result :sat
Minimization took 119 ms.
[2025-05-31 07:22:20] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:20] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-05-31 07:22:20] [INFO ] [Real]Added 40 Read/Feed constraints in 17 ms returned sat
[2025-05-31 07:22:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:20] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-31 07:22:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 27 ms returned sat
[2025-05-31 07:22:20] [INFO ] Computed and/alt/rep : 121/492/121 causal constraints (skipped 148 transitions) in 35 ms.
[2025-05-31 07:22:20] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2025-05-31 07:22:21] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2025-05-31 07:22:21] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2025-05-31 07:22:21] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2025-05-31 07:22:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 566 ms
[2025-05-31 07:22:21] [INFO ] Added : 51 causal constraints over 12 iterations in 910 ms. Result :sat
Minimization took 130 ms.
[2025-05-31 07:22:21] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:21] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-31 07:22:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:21] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-05-31 07:22:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 29 ms returned sat
[2025-05-31 07:22:22] [INFO ] Computed and/alt/rep : 121/492/121 causal constraints (skipped 148 transitions) in 29 ms.
[2025-05-31 07:22:22] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 07:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-05-31 07:22:22] [INFO ] Added : 39 causal constraints over 9 iterations in 355 ms. Result :sat
Minimization took 123 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 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 300/300 transitions.
Applied a total of 0 rules in 18 ms. Remains 110 /110 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 110/110 places, 300/300 transitions.
[2025-05-31 07:22:22] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2025-05-31 07:22:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57990 resets) in 1453 ms. (687 steps per ms)
BEST_FIRST walk for 3000003 steps (42574 resets) in 1905 ms. (1573 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-31 07:22:25] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2025-05-31 07:22:25] [INFO ] Invariant cache hit.
[2025-05-31 07:22:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:22:26] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-05-31 07:22:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:22:26] [INFO ] [Real]Added 40 Read/Feed constraints in 19 ms returned sat
[2025-05-31 07:22:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 07:22:26] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-05-31 07:22:26] [INFO ] [Nat]Added 40 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:22:26] [INFO ] Computed and/alt/rep : 121/492/121 causal constraints (skipped 148 transitions) in 23 ms.
[2025-05-31 07:22:26] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2025-05-31 07:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2025-05-31 07:22:26] [INFO ] Added : 37 causal constraints over 8 iterations in 356 ms. Result :sat
Minimization took 171 ms.
[2025-05-31 07:22:26] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:22:27] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-31 07:22:27] [INFO ] [Real]Added 40 Read/Feed constraints in 23 ms returned sat
[2025-05-31 07:22:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:27] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-31 07:22:27] [INFO ] [Nat]Added 40 Read/Feed constraints in 31 ms returned sat
[2025-05-31 07:22:27] [INFO ] Computed and/alt/rep : 121/492/121 causal constraints (skipped 148 transitions) in 31 ms.
[2025-05-31 07:22:27] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2025-05-31 07:22:27] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2025-05-31 07:22:27] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 3 ms to minimize.
[2025-05-31 07:22:28] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2025-05-31 07:22:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
[2025-05-31 07:22:28] [INFO ] Added : 51 causal constraints over 12 iterations in 839 ms. Result :sat
Minimization took 137 ms.
[2025-05-31 07:22:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 07:22:28] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-05-31 07:22:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:22:28] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-31 07:22:28] [INFO ] [Nat]Added 40 Read/Feed constraints in 23 ms returned sat
[2025-05-31 07:22:28] [INFO ] Computed and/alt/rep : 121/492/121 causal constraints (skipped 148 transitions) in 20 ms.
[2025-05-31 07:22:28] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-05-31 07:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2025-05-31 07:22:28] [INFO ] Added : 39 causal constraints over 9 iterations in 346 ms. Result :sat
Minimization took 132 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 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 300/300 transitions.
Applied a total of 0 rules in 11 ms. Remains 110 /110 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 110/110 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 300/300 transitions.
Applied a total of 0 rules in 10 ms. Remains 110 /110 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2025-05-31 07:22:29] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2025-05-31 07:22:29] [INFO ] Invariant cache hit.
[2025-05-31 07:22:29] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-31 07:22:29] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2025-05-31 07:22:29] [INFO ] Invariant cache hit.
[2025-05-31 07:22:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:22:29] [INFO ] Implicit Places using invariants and state equation in 424 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 615 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 108/110 places, 300/300 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 298
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 106 transition count 298
Applied a total of 4 rules in 30 ms. Remains 106 /108 variables (removed 2) and now considering 298/300 (removed 2) transitions.
[2025-05-31 07:22:29] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
// Phase 1: matrix 269 rows 106 cols
[2025-05-31 07:22:29] [INFO ] Computed 6 invariants in 2 ms
[2025-05-31 07:22:30] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-05-31 07:22:30] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2025-05-31 07:22:30] [INFO ] Invariant cache hit.
[2025-05-31 07:22:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:22:30] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/110 places, 298/300 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1269 ms. Remains : 106/110 places, 298/300 transitions.
[2025-05-31 07:22:30] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2025-05-31 07:22:30] [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 (58159 resets) in 1433 ms. (697 steps per ms)
BEST_FIRST walk for 3000001 steps (42411 resets) in 1549 ms. (1935 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-31 07:22:33] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2025-05-31 07:22:33] [INFO ] Invariant cache hit.
[2025-05-31 07:22:33] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:33] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-05-31 07:22:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-31 07:22:33] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-31 07:22:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:22:33] [INFO ] [Nat]Added 40 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:22:33] [INFO ] Computed and/alt/rep : 119/486/119 causal constraints (skipped 148 transitions) in 25 ms.
[2025-05-31 07:22:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2025-05-31 07:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-05-31 07:22:34] [INFO ] Added : 25 causal constraints over 5 iterations in 272 ms. Result :sat
Minimization took 201 ms.
[2025-05-31 07:22:34] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:34] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-05-31 07:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-31 07:22:34] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-05-31 07:22:34] [INFO ] [Nat]Added 40 Read/Feed constraints in 44 ms returned sat
[2025-05-31 07:22:34] [INFO ] Computed and/alt/rep : 119/486/119 causal constraints (skipped 148 transitions) in 33 ms.
[2025-05-31 07:22:35] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2025-05-31 07:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-05-31 07:22:35] [INFO ] Added : 42 causal constraints over 10 iterations in 409 ms. Result :sat
Minimization took 178 ms.
[2025-05-31 07:22:35] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-31 07:22:35] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-05-31 07:22:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:22:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-31 07:22:35] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-31 07:22:35] [INFO ] [Nat]Added 40 Read/Feed constraints in 39 ms returned sat
[2025-05-31 07:22:35] [INFO ] Computed and/alt/rep : 119/486/119 causal constraints (skipped 148 transitions) in 21 ms.
[2025-05-31 07:22:36] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2025-05-31 07:22:36] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2025-05-31 07:22:36] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2025-05-31 07:22:36] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-05-31 07:22:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 493 ms
[2025-05-31 07:22:36] [INFO ] Added : 52 causal constraints over 13 iterations in 827 ms. Result :sat
Minimization took 239 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 298/298 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 106/106 places, 298/298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 298/298 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2025-05-31 07:22:36] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2025-05-31 07:22:36] [INFO ] Invariant cache hit.
[2025-05-31 07:22:36] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-31 07:22:37] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2025-05-31 07:22:37] [INFO ] Invariant cache hit.
[2025-05-31 07:22:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:22:37] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2025-05-31 07:22:37] [INFO ] Redundant transitions in 49 ms returned []
Running 296 sub problems to find dead transitions.
[2025-05-31 07:22:37] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2025-05-31 07:22:37] [INFO ] Invariant cache hit.
[2025-05-31 07:22:37] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2025-05-31 07:22:39] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 3 ms to minimize.
[2025-05-31 07:22:40] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 2 ms to minimize.
[2025-05-31 07:22:40] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 2 ms to minimize.
[2025-05-31 07:22:40] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2025-05-31 07:22:40] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2025-05-31 07:22:40] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2025-05-31 07:22:42] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 269/374 variables, 105/118 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2025-05-31 07:22:48] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 1/375 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 160 constraints, problems are : Problem set: 0 solved, 296 unsolved in 27341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 269/374 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 296/455 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2025-05-31 07:23:11] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2025-05-31 07:23:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 1/375 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 458 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 10/10 constraints]
After SMT, in 57972ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 57999ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58627 ms. Remains : 106/106 places, 298/298 transitions.
RANDOM walk for 40000 steps (2325 resets) in 2492 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (603 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (593 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (549 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (582 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (588 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (571 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
[2025-05-31 07:23:36] [INFO ] Flatten gal took : 255 ms
[2025-05-31 07:23:37] [INFO ] Flatten gal took : 62 ms
[2025-05-31 07:23:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13579541308493040922.gal : 24 ms
[2025-05-31 07:23:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16562653802617751730.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13579541308493040922.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16562653802617751730.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16562653802617751730.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 20
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :20 after 41
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :41 after 90
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :90 after 252
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :252 after 1622
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1622 after 4522
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4522 after 12992
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :559940 after 817160
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.1854e+06,2.07776,32292,2,1992,17,80248,12,0,730,99405,0
Total reachable state count : 4185395

Verifying 6 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,6395,2.07979,32292,2,565,17,80248,12,0,732,99405,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6395,2.08139,32292,2,565,17,80248,12,0,732,99405,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,7726,2.08247,32292,2,598,17,80248,12,0,733,99405,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,7726,2.08339,32292,2,598,17,80248,12,0,733,99405,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,6395,2.08476,32292,2,565,17,80248,12,0,734,99405,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6395,2.08618,32292,2,565,17,80248,12,0,734,99405,0
Interrupted probabilistic random walk after 490705 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :4 out of 6
Probabilistic random walk after 490705 steps, saw 105172 distinct states, run finished after 3007 ms. (steps per millisecond=163 ) properties seen :4
FORMULA FireWire-PT-09-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-09-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-09-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 95121 ms.

BK_STOP 1748676219961

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is FireWire-PT-09, 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 r097-smll-174860111800039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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