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.r210-smll-177969942000237.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 PhilosophersDyn-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942000237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 11K Mar 5 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 5 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 5 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 16 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 16 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 16 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 16 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 5 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 5 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 5 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 16 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 16 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 87K 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 PhilosophersDyn-PT-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779976895077

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-28 14:01: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]
[2026-05-28 14:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 14:01:37] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2026-05-28 14:01:37] [INFO ] Transformed 30 places.
[2026-05-28 14:01:37] [INFO ] Transformed 84 transitions.
[2026-05-28 14:01:37] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 13
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[+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-2633909711212997317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8711874402971610017.kers'
[2026-05-28 14:01:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2633909711212997317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8711874402971610017.kers]
Normalized transition count is 57 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 30 cols 264 entries
Finished phase 1 with 15 SingleSign rule and 4 generalized
[2026-05-28 14:01:37] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8711874402971610017.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (1424 resets) in 70 ms. (140 steps per ms)
FORMULA PhilosophersDyn-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (292 resets) in 35 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-28 14:01:38] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4317385286619908495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5445743719605818243.kers'
[2026-05-28 14:01:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4317385286619908495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5445743719605818243.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 30 cols 264 entries
Finished phase 1 with 15 SingleSign rule and 4 generalized
[2026-05-28 14:01:38] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5445743719605818243.kers
Total runtime 1 ms.
[2026-05-28 14:01:38] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-28 14:01:38] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 5 ms returned sat
[2026-05-28 14:01:38] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-28 14:01:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-28 14:01:38] [INFO ] [Real]Added 36 Read/Feed constraints in 23 ms returned sat
[2026-05-28 14:01:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 14:01:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-28 14:01:38] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-28 14:01:38] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-28 14:01:38] [INFO ] [Nat]Added 36 Read/Feed constraints in 23 ms returned sat
[2026-05-28 14:01:38] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 39 ms.
[2026-05-28 14:01:38] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 78
Applied a total of 6 rules in 50 ms. Remains 27 /30 variables (removed 3) and now considering 78/81 (removed 3) transitions.
Running 75 sub problems to find dead transitions.
[2026-05-28 14:01:38] [INFO ] Flow matrix only has 54 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16041014370656655301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8709183563168646050.kers'
[2026-05-28 14:01:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16041014370656655301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8709183563168646050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 27 cols 249 entries
Finished phase 1 with 12 SingleSign rule and 4 generalized
[2026-05-28 14:01:38] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8709183563168646050.kers
Total runtime 1 ms.
[2026-05-28 14:01:38] [INFO ] State equation strengthened by 36 read => feed constraints.
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 12 solved, 63 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 54/81 variables, 27/38 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 36/74 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/74 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/81 variables, 1/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 75 constraints, problems are : Problem set: 30 solved, 45 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/12 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 54/81 variables, 27/39 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 36/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 45/120 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/120 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/120 constraints. Problems are: Problem set: 30 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 120 constraints, problems are : Problem set: 30 solved, 45 unsolved in 2844 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 45/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5387ms problems are : Problem set: 30 solved, 45 unsolved
Search for dead transitions found 30 dead transitions in 5403ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/30 places, 48/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5504 ms. Remains : 27/30 places, 48/81 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1064951297708649180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7132226799316594116.kers'
[2026-05-28 14:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1064951297708649180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7132226799316594116.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 27 cols 228 entries
Finished phase 1 with 9 SingleSign rule and 7 generalized
[2026-05-28 14:01:44] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7132226799316594116.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (146528 resets) in 2194 ms. (455 steps per ms)
BEST_FIRST walk for 1000001 steps (45447 resets) in 653 ms. (1529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-28 14:01:47] [INFO ] Invariant cache hit.
[2026-05-28 14:01:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-28 14:01:47] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-28 14:01:47] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-28 14:01:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:01:47] [INFO ] [Real]Added 30 Read/Feed constraints in 8 ms returned sat
[2026-05-28 14:01:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 14:01:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-28 14:01:47] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-28 14:01:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-28 14:01:47] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2026-05-28 14:01:47] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 7 ms.
[2026-05-28 14:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-28 14:01:47] [INFO ] Added : 4 causal constraints over 1 iterations in 75 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2026-05-28 14:01:47] [INFO ] Invariant cache hit.
[2026-05-28 14:01:47] [INFO ] Implicit Places using invariants in 70 ms returned [1, 18, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 72 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 7 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16537589545252128996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11250153848787122825.kers'
[2026-05-28 14:01:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16537589545252128996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11250153848787122825.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 45 rows 21 cols 210 entries
Finished phase 1 with 6 SingleSign rule and 7 generalized
[2026-05-28 14:01:47] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11250153848787122825.kers
Total runtime 0 ms.
[2026-05-28 14:01:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-28 14:01:47] [INFO ] Invariant cache hit.
[2026-05-28 14:01:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:01:47] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/27 places, 45/48 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 253 ms. Remains : 21/27 places, 45/48 transitions.
[2026-05-28 14:01:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (203661 resets) in 1634 ms. (611 steps per ms)
BEST_FIRST walk for 1000001 steps (66666 resets) in 557 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-28 14:01:49] [INFO ] Invariant cache hit.
[2026-05-28 14:01:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-28 14:01:49] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-28 14:01:49] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-28 14:01:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:01:49] [INFO ] [Real]Added 30 Read/Feed constraints in 10 ms returned sat
[2026-05-28 14:01:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 14:01:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-28 14:01:49] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-28 14:01:50] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-28 14:01:50] [INFO ] [Nat]Added 30 Read/Feed constraints in 10 ms returned sat
[2026-05-28 14:01:50] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 6 ms.
[2026-05-28 14:01:50] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2026-05-28 14:01:50] [INFO ] Invariant cache hit.
[2026-05-28 14:01:50] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-28 14:01:50] [INFO ] Invariant cache hit.
[2026-05-28 14:01:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:01:50] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-05-28 14:01:50] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-28 14:01:50] [INFO ] Invariant cache hit.
[2026-05-28 14:01:50] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 45/66 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 61 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 21/21 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 45/66 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 103 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1917 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 21/21 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3384ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 3385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3606 ms. Remains : 21/21 places, 45/45 transitions.
RANDOM walk for 40000 steps (8158 resets) in 1073 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2664 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2664 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
Probably explored full state space saw : 58 states, properties seen :0
[2026-05-28 14:01:54] [INFO ] Flatten gal took : 59 ms
Probabilistic random walk after 154 steps, saw 58 distinct states, run finished after 26 ms. (steps per millisecond=5 ) properties seen :0
Explored full state space saw : 58 states, properties seen :0
Exhaustive walk after 154 steps, saw 58 distinct states, run finished after 9 ms. (steps per millisecond=17 ) properties seen :0
[2026-05-28 14:01:54] [INFO ] Flatten gal took : 24 ms
[2026-05-28 14:01:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality509454932210711493.gal : 11 ms
[2026-05-28 14:01:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2218057919397202393.prop : 0 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/ReachabilityCardinality509454932210711493.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2218057919397202393.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-28 14:01:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (203491 resets) in 1645 ms. (607 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 18612 ms.

BK_STOP 1779976916092

--------------------
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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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 r210-smll-177969942000237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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