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.r146-tall-177961074100277.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 GPPP-PT-C0001N0000010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.2K Mar 7 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 11:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 7 11:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 10:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 7 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 7 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 7 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000010000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779710005907

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000010000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 11:53:27] [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-25 11:53:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:53:27] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2026-05-25 11:53:27] [INFO ] Transformed 33 places.
[2026-05-25 11:53:27] [INFO ] Transformed 22 transitions.
[2026-05-25 11:53:27] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[10000, 7, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20000, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[10000, 7, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20000, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11311813752715982960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2324084307114985816.kers'
[2026-05-25 11:53:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11311813752715982960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2324084307114985816.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:53:27] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2324084307114985816.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10000, 7, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20000, 0, 1] Max Struct:[10000, 7, 2, 4, 40025, 20000, 20000, 20000, 7, 2, 4, 3, 7, 20000, 20000, 1]
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-13 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-00 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10003 steps (2 resets) in 28 ms. (344 steps per ms)
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (16 resets) in 93 ms. (851 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 48, 7, 7, 1, 2, 1, 7] Max Struct:[40025, 20000, 20000, 20000, 2, 4, 3, 20000]
[2026-05-25 11:53:27] [INFO ] Invariant cache hit.
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 6 ms returned unsat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 11:53:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:53:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 11:53:27] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:53:27] [INFO ] Added : 19 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 168 ms.
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned unsat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 11:53:27] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:53:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:28] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned unsat
[2026-05-25 11:53:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:28] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 11:53:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 11:53:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:53:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 11:53:28] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-25 11:53:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 11:53:28] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 11:53:28] [INFO ] Added : 19 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 11 ms.
[2026-05-25 11:53:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:28] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[14, 48, 7, 7, 1, 2, 1, 7] Max Struct:[14, 20000, 7, 7, 1, 2, 3, 7]
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-04 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19994, 1] Max Struct:[20000, 3]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 15
Applied a total of 12 rules in 39 ms. Remains 26 /33 variables (removed 7) and now considering 15/22 (removed 7) transitions.
Running 14 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12208149808385754253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12557503250136661949.kers'
[2026-05-25 11:53:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12208149808385754253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12557503250136661949.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 15 rows 20 cols 51 entries
Finished phase 1 with 10 SingleSign rule and 4 generalized
[2026-05-25 11:53:45] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12557503250136661949.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 15/41 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 38 constraints, problems are : Problem set: 0 solved, 14 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 15/41 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 52 constraints, problems are : Problem set: 0 solved, 14 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 1128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1187 ms. Remains : 26/33 places, 15/22 transitions.
[2026-05-25 11:53:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19994, 1] Max Struct:[20000, 3]
RANDOM walk for 1000002 steps (2 resets) in 461 ms. (2164 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 792 ms. (2522 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19994, 1] Max Struct:[20000, 3]
[2026-05-25 11:53:47] [INFO ] Invariant cache hit.
[2026-05-25 11:53:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:53:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:53:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:53:47] [INFO ] Computed and/alt/rep : 14/27/14 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:53:47] [INFO ] Added : 14 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 9 ms.
[2026-05-25 11:53:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 11:53:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:53:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 11:53:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:53:47] [INFO ] Computed and/alt/rep : 14/27/14 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:53:47] [INFO ] Added : 13 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19994, 1] Max Struct:[20000, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20000, 1] Max Struct:[20000, 3]
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-05 20000 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 15/15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Applied a total of 3 rules in 5 ms. Remains 24 /26 variables (removed 2) and now considering 14/15 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 24/26 places, 14/15 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13881014453611566527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4171555269468627665.kers'
[2026-05-25 11:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13881014453611566527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4171555269468627665.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 14 rows 19 cols 49 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-25 11:53:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4171555269468627665.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 374 ms. (2666 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 379 ms. (2631 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2026-05-25 11:53:58] [INFO ] Invariant cache hit.
[2026-05-25 11:53:58] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:58] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 11:53:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 11:53:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:53:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 11:53:58] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 11:53:58] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 11:53:58] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:53:58] [INFO ] Added : 13 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2026-05-25 11:53:58] [INFO ] Invariant cache hit.
[2026-05-25 11:53:59] [INFO ] Implicit Places using invariants in 76 ms returned [0, 1, 2, 3, 13]
[2026-05-25 11:53:59] [INFO ] Actually due to overlaps returned [1, 13, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 93 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 14/14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 14 transition count 9
Applied a total of 11 rules in 2 ms. Remains 14 /20 variables (removed 6) and now considering 9/14 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9887643959171077111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15423678112848136919.kers'
[2026-05-25 11:53:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9887643959171077111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15423678112848136919.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 9 rows 11 cols 28 entries
Finished phase 1 with 7 SingleSign rule and 1 generalized
[2026-05-25 11:53:59] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15423678112848136919.kers
Total runtime 0 ms.
[2026-05-25 11:53:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 11:53:59] [INFO ] Invariant cache hit.
[2026-05-25 11:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:53:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 14/24 places, 9/14 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 228 ms. Remains : 14/24 places, 9/14 transitions.
[2026-05-25 11:53:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 271 ms. (3676 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 239 ms. (4166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2026-05-25 11:53:59] [INFO ] Invariant cache hit.
[2026-05-25 11:53:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 11:53:59] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:53:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:53:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:53:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 11:53:59] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:53:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:53:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 11:53:59] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:53:59] [INFO ] Added : 8 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2026-05-25 11:53:59] [INFO ] Invariant cache hit.
[2026-05-25 11:53:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 11:53:59] [INFO ] Invariant cache hit.
[2026-05-25 11:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:53:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2026-05-25 11:53:59] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-25 11:53:59] [INFO ] Invariant cache hit.
[2026-05-25 11:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/23 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 8 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/23 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 14/14 places, 9/9 transitions.
RANDOM walk for 40008 steps (8 resets) in 538 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
Probably explored full state space saw : 37 states, properties seen :0
Probabilistic random walk after 93 steps, saw 37 distinct states, run finished after 8 ms. (steps per millisecond=11 ) properties seen :0
Explored full state space saw : 37 states, properties seen :0
Exhaustive walk after 93 steps, saw 37 distinct states, run finished after 2 ms. (steps per millisecond=46 ) properties seen :0
[2026-05-25 11:54:00] [INFO ] Flatten gal took : 33 ms
[2026-05-25 11:54:00] [INFO ] Flatten gal took : 7 ms
[2026-05-25 11:54:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14420726134040335241.gal : 8 ms
[2026-05-25 11:54:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7114825266741110212.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14420726134040335241.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7114825266741110212.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-11 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 11:54:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 262 ms. (3802 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 34020 ms.

BK_STOP 1779710041093

--------------------
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="GPPP-PT-C0001N0000010000"
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 GPPP-PT-C0001N0000010000, 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 r146-tall-177961074100277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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