Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 7 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 05:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 05:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 91K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-05-UpperBounds-00
FORMULA_NAME FireWire-PT-05-UpperBounds-01
FORMULA_NAME FireWire-PT-05-UpperBounds-02
FORMULA_NAME FireWire-PT-05-UpperBounds-03
FORMULA_NAME FireWire-PT-05-UpperBounds-04
FORMULA_NAME FireWire-PT-05-UpperBounds-05
FORMULA_NAME FireWire-PT-05-UpperBounds-06
FORMULA_NAME FireWire-PT-05-UpperBounds-07
FORMULA_NAME FireWire-PT-05-UpperBounds-08
FORMULA_NAME FireWire-PT-05-UpperBounds-09
FORMULA_NAME FireWire-PT-05-UpperBounds-10
FORMULA_NAME FireWire-PT-05-UpperBounds-11
FORMULA_NAME FireWire-PT-05-UpperBounds-12
FORMULA_NAME FireWire-PT-05-UpperBounds-13
FORMULA_NAME FireWire-PT-05-UpperBounds-14
FORMULA_NAME FireWire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779799623936

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 12:47:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 12:47:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 12:47:06] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2026-05-26 12:47:06] [INFO ] Transformed 114 places.
[2026-05-26 12:47:06] [INFO ] Transformed 373 transitions.
[2026-05-26 12:47:06] [INFO ] Found NUPN structural information;
[2026-05-26 12:47:06] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 57 transitions
Reduce redundant transitions removed 57 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9635494391261272370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14601015520838805888.kers'
[2026-05-26 12:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9635494391261272370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14601015520838805888.kers]
Normalized transition count is 283 out of 316 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 114 cols 967 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 12:47:07] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14601015520838805888.kers
Total runtime 4 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 (550 resets) in 105 ms. (94 steps per ms)
FORMULA FireWire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (742 resets) in 259 ms. (192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-26 12:47:07] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8844214547399607854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13999645735571605549.kers'
[2026-05-26 12:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8844214547399607854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13999645735571605549.kers]
Normalized transition count is 283 out of 284 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 114 cols 967 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 12:47:07] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13999645735571605549.kers
Total runtime 3 ms.
[2026-05-26 12:47:07] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-26 12:47:08] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2026-05-26 12:47:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 12:47:08] [INFO ] [Real]Added 40 Read/Feed constraints in 22 ms returned sat
[2026-05-26 12:47:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:47:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-26 12:47:08] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2026-05-26 12:47:08] [INFO ] [Nat]Added 40 Read/Feed constraints in 29 ms returned sat
[2026-05-26 12:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2026-05-26 12:47:09] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 74 ms.
[2026-05-26 12:47:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2026-05-26 12:47:09] [INFO ] Added : 21 causal constraints over 6 iterations in 646 ms. Result :sat
Minimization took 93 ms.
[2026-05-26 12:47:09] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-26 12:47:09] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-26 12:47:10] [INFO ] [Real]Added 40 Read/Feed constraints in 34 ms returned sat
[2026-05-26 12:47:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:47:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-26 12:47:10] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2026-05-26 12:47:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 32 ms returned sat
[2026-05-26 12:47:10] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 68 ms.
[2026-05-26 12:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2026-05-26 12:47:10] [INFO ] Added : 24 causal constraints over 7 iterations in 602 ms. Result :sat
Minimization took 98 ms.
[2026-05-26 12:47:11] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-26 12:47:11] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2026-05-26 12:47:11] [INFO ] [Real]Added 40 Read/Feed constraints in 19 ms returned sat
[2026-05-26 12:47:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:47:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-26 12:47:11] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2026-05-26 12:47:11] [INFO ] [Nat]Added 40 Read/Feed constraints in 36 ms returned sat
[2026-05-26 12:47:11] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 62 ms.
[2026-05-26 12:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-26 12:47:12] [INFO ] Added : 29 causal constraints over 7 iterations in 467 ms. Result :sat
Minimization took 99 ms.
[2026-05-26 12:47:12] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-26 12:47:12] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2026-05-26 12:47:12] [INFO ] [Real]Added 40 Read/Feed constraints in 45 ms returned sat
[2026-05-26 12:47:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:47:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-26 12:47:12] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2026-05-26 12:47:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 27 ms returned sat
[2026-05-26 12:47:12] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 67 ms.
[2026-05-26 12:47:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2026-05-26 12:47:13] [INFO ] Added : 22 causal constraints over 5 iterations in 541 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 316/316 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 113 transition count 311
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 112 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 110 transition count 307
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 110 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 110 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 107 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 25 place count 107 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 34 place count 107 transition count 296
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 107 transition count 298
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 4 with 3 rules applied. Total rules applied 38 place count 106 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 106 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 105 transition count 293
Applied a total of 41 rules in 250 ms. Remains 105 /114 variables (removed 9) and now considering 293/316 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 105/114 places, 293/316 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17582586169532051658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7162743876094827763.kers'
[2026-05-26 12:47:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17582586169532051658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7162743876094827763.kers]
Normalized transition count is 264 out of 293 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 264 rows 101 cols 883 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 12:47:13] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7162743876094827763.kers
Total runtime 3 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 (64470 resets) in 2007 ms. (498 steps per ms)
FORMULA FireWire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (16219 resets) in 547 ms. (1824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 12:47:16] [INFO ] Flow matrix only has 264 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4365568182780282265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-861501269044256451.kers'
[2026-05-26 12:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4365568182780282265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-861501269044256451.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 264 rows 101 cols 883 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 12:47:16] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-861501269044256451.kers
Total runtime 1 ms.
[2026-05-26 12:47:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-26 12:47:16] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-26 12:47:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 12:47:16] [INFO ] [Real]Added 40 Read/Feed constraints in 15 ms returned sat
[2026-05-26 12:47:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:47:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-26 12:47:16] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-26 12:47:16] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2026-05-26 12:47:16] [INFO ] Computed and/alt/rep : 105/377/105 causal constraints (skipped 157 transitions) in 52 ms.
[2026-05-26 12:47:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2026-05-26 12:47:17] [INFO ] Added : 12 causal constraints over 3 iterations in 446 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 105 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p75) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 291/291 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 103 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 103 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 103 transition count 286
Applied a total of 4 rules in 31 ms. Remains 103 /105 variables (removed 2) and now considering 286/291 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 103/105 places, 286/291 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5845730403886626995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12289383178948416007.kers'
[2026-05-26 12:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5845730403886626995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12289383178948416007.kers]
Normalized transition count is 257 out of 286 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 257 rows 99 cols 856 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-26 12:47:17] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12289383178948416007.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64027 resets) in 1685 ms. (593 steps per ms)
BEST_FIRST walk for 1000001 steps (16141 resets) in 483 ms. (2066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 12:47:19] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13397960569324082745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12429150320742064351.kers'
[2026-05-26 12:47:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13397960569324082745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12429150320742064351.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 257 rows 99 cols 856 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-26 12:47:19] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12429150320742064351.kers
Total runtime 1 ms.
[2026-05-26 12:47:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-26 12:47:19] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-26 12:47:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 12:47:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-26 12:47:19] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-26 12:47:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 12:47:19] [INFO ] [Nat]Added 40 Read/Feed constraints in 32 ms returned sat
[2026-05-26 12:47:19] [INFO ] Computed and/alt/rep : 113/459/113 causal constraints (skipped 142 transitions) in 41 ms.
[2026-05-26 12:47:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 619 ms
[2026-05-26 12:47:21] [INFO ] Added : 44 causal constraints over 10 iterations in 1086 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
FORMULA FireWire-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
All properties solved without resorting to model-checking.
Total runtime 14814 ms.

BK_STOP 1779799641379

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-05"
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-5973"
echo " Executing tool itstools"
echo " Input is FireWire-PT-05, 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 r130-smll-177955809000181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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