MCC'2025- Execution of r086-smll-174860102200301

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

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200301.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FireWire-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 97K 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-08-UpperBounds-00
FORMULA_NAME FireWire-PT-08-UpperBounds-01
FORMULA_NAME FireWire-PT-08-UpperBounds-02
FORMULA_NAME FireWire-PT-08-UpperBounds-03
FORMULA_NAME FireWire-PT-08-UpperBounds-04
FORMULA_NAME FireWire-PT-08-UpperBounds-05
FORMULA_NAME FireWire-PT-08-UpperBounds-06
FORMULA_NAME FireWire-PT-08-UpperBounds-07
FORMULA_NAME FireWire-PT-08-UpperBounds-08
FORMULA_NAME FireWire-PT-08-UpperBounds-09
FORMULA_NAME FireWire-PT-08-UpperBounds-10
FORMULA_NAME FireWire-PT-08-UpperBounds-11
FORMULA_NAME FireWire-PT-08-UpperBounds-12
FORMULA_NAME FireWire-PT-08-UpperBounds-13
FORMULA_NAME FireWire-PT-08-UpperBounds-14
FORMULA_NAME FireWire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748856394796

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 09:26:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 09:26:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:26:37] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2025-06-02 09:26:37] [INFO ] Transformed 127 places.
[2025-06-02 09:26:37] [INFO ] Transformed 397 transitions.
[2025-06-02 09:26:37] [INFO ] Found NUPN structural information;
[2025-06-02 09:26:37] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 09:26:37] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2025-06-02 09:26:37] [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 (563 resets) in 87 ms. (113 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (1149 resets) in 210 ms. (379 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-06-02 09:26:38] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
[2025-06-02 09:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:38] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2025-06-02 09:26:38] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2025-06-02 09:26:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-02 09:26:39] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-06-02 09:26:39] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 09:26:39] [INFO ] [Nat]Added 45 Read/Feed constraints in 32 ms returned sat
[2025-06-02 09:26:39] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 96 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:40] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:40] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 3 ms to minimize.
[2025-06-02 09:26:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2025-06-02 09:26:40] [INFO ] Added : 29 causal constraints over 8 iterations in 864 ms. Result :sat
Minimization took 96 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:40] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 09:26:40] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-06-02 09:26:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 09:26:41] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2025-06-02 09:26:41] [INFO ] [Nat]Added 45 Read/Feed constraints in 39 ms returned sat
[2025-06-02 09:26:41] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 66 ms.
[2025-06-02 09:26:41] [INFO ] Added : 23 causal constraints over 5 iterations in 548 ms. Result :sat
Minimization took 143 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:41] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 09:26:42] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-06-02 09:26:42] [INFO ] [Real]Added 45 Read/Feed constraints in 36 ms returned sat
[2025-06-02 09:26:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 09:26:42] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-02 09:26:42] [INFO ] [Nat]Added 45 Read/Feed constraints in 52 ms returned sat
[2025-06-02 09:26:42] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 66 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:43] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 21 ms to minimize.
[2025-06-02 09:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2025-06-02 09:26:43] [INFO ] Added : 27 causal constraints over 6 iterations in 639 ms. Result :sat
Minimization took 143 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:43] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 09:26:43] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-02 09:26:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 09:26:43] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-06-02 09:26:43] [INFO ] [Nat]Added 45 Read/Feed constraints in 89 ms returned sat
[2025-06-02 09:26:43] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 59 ms.
[2025-06-02 09:26:44] [INFO ] Added : 31 causal constraints over 7 iterations in 398 ms. Result :sat
Minimization took 152 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:44] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 09:26:44] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-02 09:26:44] [INFO ] [Real]Added 45 Read/Feed constraints in 17 ms returned sat
[2025-06-02 09:26:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 09:26:45] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-06-02 09:26:45] [INFO ] [Nat]Added 45 Read/Feed constraints in 33 ms returned sat
[2025-06-02 09:26:45] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 56 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:45] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:45] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 20 ms to minimize.
[2025-06-02 09:26:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2025-06-02 09:26:45] [INFO ] Added : 29 causal constraints over 7 iterations in 900 ms. Result :sat
Minimization took 171 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:46] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 09:26:46] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-02 09:26:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 09:26:46] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-06-02 09:26:46] [INFO ] [Nat]Added 45 Read/Feed constraints in 42 ms returned sat
[2025-06-02 09:26:46] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 45 ms.
[2025-06-02 09:26:46] [INFO ] Added : 24 causal constraints over 5 iterations in 302 ms. Result :sat
Minimization took 94 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:47] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 09:26:47] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-06-02 09:26:47] [INFO ] [Real]Added 45 Read/Feed constraints in 15 ms returned sat
[2025-06-02 09:26:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 09:26:47] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-06-02 09:26:47] [INFO ] [Nat]Added 45 Read/Feed constraints in 59 ms returned sat
[2025-06-02 09:26:47] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 42 ms.
[2025-06-02 09:26:47] [INFO ] Added : 14 causal constraints over 3 iterations in 200 ms. Result :sat
Minimization took 155 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-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 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 127 transition count 341
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 121 transition count 327
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 121 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 121 transition count 324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 117 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 116 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 115 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 115 transition count 310
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 32 place count 114 transition count 309
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 38 place count 111 transition count 315
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 44 place count 111 transition count 309
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 53 place count 111 transition count 300
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 111 transition count 302
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 57 place count 110 transition count 300
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 59 place count 110 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 109 transition count 297
Applied a total of 60 rules in 349 ms. Remains 109 /127 variables (removed 18) and now considering 297/344 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 109/127 places, 297/344 transitions.
[2025-06-02 09:26:49] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2025-06-02 09:26:49] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57606 resets) in 1752 ms. (570 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (28309 resets) in 979 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 09:26:51] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-06-02 09:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 09:26:51] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-02 09:26:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 09:26:52] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-06-02 09:26:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 09:26:52] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2025-06-02 09:26:52] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:52] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:52] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 5 ms to minimize.
[2025-06-02 09:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2025-06-02 09:26:52] [INFO ] Added : 53 causal constraints over 12 iterations in 671 ms. Result :sat
Minimization took 177 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:53] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 09:26:53] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-06-02 09:26:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 09:26:53] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-06-02 09:26:53] [INFO ] [Nat]Added 41 Read/Feed constraints in 24 ms returned sat
[2025-06-02 09:26:53] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 35 ms.
[2025-06-02 09:26:53] [INFO ] Added : 41 causal constraints over 9 iterations in 275 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 109/109 places, 297/297 transitions.
[2025-06-02 09:26:53] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-06-02 09:26:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (57503 resets) in 1626 ms. (614 steps per ms)
BEST_FIRST walk for 2000002 steps (28019 resets) in 950 ms. (2103 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 09:26:56] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-06-02 09:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 09:26:56] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 09:26:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 09:26:56] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-02 09:26:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 09:26:56] [INFO ] [Nat]Added 41 Read/Feed constraints in 37 ms returned sat
[2025-06-02 09:26:56] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 33 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:57] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:57] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 6 ms to minimize.
[2025-06-02 09:26:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2025-06-02 09:26:57] [INFO ] Added : 53 causal constraints over 12 iterations in 753 ms. Result :sat
Minimization took 189 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 09:26:57] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-02 09:26:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 09:26:58] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-06-02 09:26:58] [INFO ] [Nat]Added 41 Read/Feed constraints in 29 ms returned sat
[2025-06-02 09:26:58] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 30 ms.
[2025-06-02 09:26:58] [INFO ] Added : 41 causal constraints over 9 iterations in 362 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 22 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 13 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-06-02 09:26:58] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-06-02 09:26:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:59] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-02 09:26:59] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-06-02 09:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 09:26:59] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:26:59] [INFO ] Redundant transitions in 35 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 09:26:59] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-06-02 09:26:59] [INFO ] Invariant cache hit.
[2025-06-02 09:26:59] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:02] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:02] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:02] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:02] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:03] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:03] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:04] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/164 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:12] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:13] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:15] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:21] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 1/377 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/377 variables, and 169 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/168 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 295/463 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 464 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60498ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61220 ms. Remains : 109/109 places, 297/297 transitions.
RANDOM walk for 40000 steps (2352 resets) in 1866 ms. (21 steps per ms) remains 4/4 properties
[2025-06-02 09:28:00] [INFO ] Flatten gal took : 169 ms
BEST_FIRST walk for 40004 steps (569 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (579 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
[2025-06-02 09:28:01] [INFO ] Flatten gal took : 145 ms
BEST_FIRST walk for 40003 steps (558 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (590 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
[2025-06-02 09:28:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16488071697424361349.gal : 39 ms
[2025-06-02 09:28:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6818797996415788000.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/ReachabilityCardinality16488071697424361349.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6818797996415788000.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6818797996415788000.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :19 after 31
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :31 after 61
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :61 after 228
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :228 after 1182
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1182 after 5868
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5868 after 34038
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
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,3.51763e+06,0.880935,20084,2,2142,18,58649,6,0,735,54339,0
Total reachable state count : 3517630

Verifying 4 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,4197,0.882135,20084,2,550,18,58649,7,0,738,54339,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,4197,0.883094,20340,2,550,18,58649,8,0,739,54339,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,4197,0.883811,20340,2,550,18,58649,9,0,741,54339,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,4197,0.884457,20340,2,550,18,58649,10,0,742,54339,0
Interrupted probabilistic random walk after 645657 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 4
Probabilistic random walk after 645657 steps, saw 144573 distinct states, run finished after 3008 ms. (steps per millisecond=214 ) properties seen :0
FORMULA FireWire-PT-08-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 86813 ms.

BK_STOP 1748856484164

--------------------
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-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102200301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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