About the Execution of ITS-Tools for GPPP-PT-C1000N0000000100
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-177961074100365.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-C1000N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100365
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Mar 7 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 7 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 11:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 3.9K Mar 15 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 10:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 7 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 7 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:34 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-C1000N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779721295311
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-C1000N0000000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 15:01:36] [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 15:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:01:36] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2026-05-25 15:01:36] [INFO ] Transformed 33 places.
[2026-05-25 15:01:36] [INFO ] Transformed 22 transitions.
[2026-05-25 15:01:36] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 200, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 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:[0, 0, 200, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 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-16200668229251308181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5119886130155898855.kers'
[2026-05-25 15:01:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16200668229251308181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5119886130155898855.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 8 generalized
[2026-05-25 15:01:36] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5119886130155898855.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 200, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4500, 6000, 200, 7000, 22400, 7000, 200, 4500, 200, 3000, 2, 200, 6000, 4500, 7000, 9000]
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10082 steps (3 resets) in 18 ms. (530 steps per ms)
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-14 7000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-09 3000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-03 7000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (22 resets) in 108 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4000, 407, 7400, 7, 7, 3, 1, 7, 1, 400, 5] Max Struct:[4500, 6000, 22400, 7000, 200, 4500, 2, 200, 6000, 4500, 9000]
[2026-05-25 15:01:36] [INFO ] Invariant cache hit.
[2026-05-25 15:01:36] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 15:01:36] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 15:01:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:01:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 15:01:37] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 15:01:37] [INFO ] Added : 19 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 28 ms.
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 15:01:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:01:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 182 ms returned sat
[2026-05-25 15:01:37] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-25 15:01:37] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:01:37] [INFO ] Added : 14 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4000, 407, 7400, 7, 7, 3, 1, 7, 1, 400, 5] Max Struct:[4000, 407, 7400, 7, 7, 3, 1, 7, 1, 4500, 9000]
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-04 7400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-01 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-00 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[407, 7] Max Struct:[4500, 9000]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 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 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
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 17
Applied a total of 12 rules in 42 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
Running 16 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-9690062573704976582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11300627587861823319.kers'
[2026-05-25 15:01:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9690062573704976582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11300627587861823319.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 17 rows 21 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 4 generalized
[2026-05-25 15:01:38] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11300627587861823319.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD16 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/43 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 36 constraints, problems are : Problem set: 1 solved, 15 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 43/43 variables, and 36 constraints, problems are : Problem set: 1 solved, 15 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20328ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 20338ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/33 places, 16/22 transitions.
Graph (complete) has 66 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 25 /26 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20407 ms. Remains : 25/33 places, 16/22 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13095545655360007022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10741033187850455301.kers'
[2026-05-25 15:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13095545655360007022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10741033187850455301.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 16 rows 20 cols 51 entries
Finished phase 1 with 11 SingleSign rule and 4 generalized
[2026-05-25 15:01:58] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10741033187850455301.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[407, 7] Max Struct:[4500, 7400]
RANDOM walk for 1000284 steps (784 resets) in 264 ms. (3774 steps per ms)
BEST_FIRST walk for 2000001 steps (486 resets) in 858 ms. (2328 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[407, 7] Max Struct:[4500, 7400]
[2026-05-25 15:01:59] [INFO ] Invariant cache hit.
[2026-05-25 15:01:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:01:59] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned unsat
[2026-05-25 15:01:59] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:01:59] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 15:01:59] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[407, 7] Max Struct:[407, 7]
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-13 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 23443 ms.
BK_STOP 1779721319928
--------------------
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-C1000N0000000100"
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-C1000N0000000100, 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-177961074100365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 '
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 ;