About the Execution of ITS-Tools for PGCD-COL-D02N006
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.r194-tall-177969914300757.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 PGCD-COL-D02N006, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300757
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 4.9K Mar 8 14:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 8 14:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 8 14:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 8 14:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 17 06:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 17 06:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 17 06:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 17 06:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 8 14:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 8 14:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 8 14:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 8 14:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 06:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 17 06:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 11K 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 PGCD-COL-D02N006-UpperBounds-00
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-01
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-02
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-03
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-04
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-05
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-06
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-07
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-08
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-09
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-10
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-11
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-12
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-13
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-14
FORMULA_NAME PGCD-COL-D02N006-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779829735239
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D02N006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-26 21:08:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 21:08:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 21:08:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 21:08:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 21:08:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2026-05-26 21:08:57] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 3
[2026-05-26 21:08:57] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 3 ms.
[2026-05-26 21:08:57] [INFO ] Skeletonized 3 HLPN properties in 0 ms.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14887864253161028857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1150250401093927911.kers'
[2026-05-26 21:08:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14887864253161028857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1150250401093927911.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-26 21:08:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1150250401093927911.kers
Total runtime 1 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[3, 3, 18] Max Struct:[21, 21, 21]
[2026-05-26 21:08:57] [INFO ] Invariant cache hit.
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 21:08:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 21:08:57] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 21:08:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 21:08:57] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Minimization took 2 ms.
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 21:08:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:08:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-26 21:08:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2026-05-26 21:08:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 21:08:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[3, 3, 18] Max Struct:[21, 21, 21]
Arc [1:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2026-05-26 21:08:57] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 11 ms.
[2026-05-26 21:08:57] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[3, 3, 18] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3, 3, 18] Max Struct:[21, 21, 21]
Current structural bounds on expressions (Before main loop) : Max Seen:[3, 3, 18] Max Struct:[21, 21, 21]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3861157301696769809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-438273873622094027.kers'
[2026-05-26 21:08:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3861157301696769809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-438273873622094027.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 9 rows 6 cols 24 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-26 21:08:57] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-438273873622094027.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 18] Max Struct:[21, 21, 21]
RANDOM walk for 10002 steps (2 resets) in 27 ms. (357 steps per ms)
FORMULA PGCD-COL-D02N006-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-06 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-09 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-10 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-12 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-14 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-15 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-08 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N006-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[21]
[2026-05-26 21:08:57] [INFO ] Invariant cache hit.
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 21:08:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 21:08:57] [INFO ] [Real]Added 3 Read/Feed constraints in 10 ms returned sat
[2026-05-26 21:08:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:08:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 21:08:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2026-05-26 21:08:57] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 21:08:57] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[21]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 9 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2026-05-26 21:08:57] [INFO ] Invariant cache hit.
[2026-05-26 21:08:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 9/9 places, 9/9 transitions.
[2026-05-26 21:08:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[21]
RANDOM walk for 1000001 steps (2 resets) in 426 ms. (2341 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 306 ms. (3257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[21]
[2026-05-26 21:08:58] [INFO ] Invariant cache hit.
[2026-05-26 21:08:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 21:08:58] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-26 21:08:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-26 21:08:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 21:08:58] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 21:08:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 21:08:58] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 21:08:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 21:08:58] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 21:08:58] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 21:08:58] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[21]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2026-05-26 21:08:58] [INFO ] Invariant cache hit.
[2026-05-26 21:08:58] [INFO ] Implicit Places using invariants in 48 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54 ms. Remains : 6/9 places, 9/9 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15227970136937412390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1645818004971253457.kers'
[2026-05-26 21:08:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15227970136937412390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1645818004971253457.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 6 cols 24 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-26 21:08:58] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1645818004971253457.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[21]
RANDOM walk for 1000001 steps (2 resets) in 318 ms. (3134 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 202 ms. (4926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[21]
[2026-05-26 21:08:59] [INFO ] Invariant cache hit.
[2026-05-26 21:08:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 21:08:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 21:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 21:08:59] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 21:08:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 21:08:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 21:08:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 21:08:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2026-05-26 21:08:59] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 21:08:59] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[21]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2026-05-26 21:08:59] [INFO ] Invariant cache hit.
[2026-05-26 21:08:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 21:08:59] [INFO ] Invariant cache hit.
[2026-05-26 21:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 21:08:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2026-05-26 21:08:59] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-26 21:08:59] [INFO ] Invariant cache hit.
[2026-05-26 21:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40006 steps (8 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2026-05-26 21:09:00] [INFO ] Flatten gal took : 33 ms
[2026-05-26 21:09:00] [INFO ] Flatten gal took : 2 ms
[2026-05-26 21:09:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14820617900226814290.gal : 16 ms
[2026-05-26 21:09:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14148935727610507568.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/ReachabilityCardinality14820617900226814290.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14148935727610507568.prop' '--nowitness' '--gen-order' 'FOLLOW'
Probably explored full state space saw : 15670 states, properties seen :0
Probabilistic random walk after 101911 steps, saw 15670 distinct states, run finished after 347 ms. (steps per millisecond=293 ) properties seen :0
Explored full state space saw : 15670 states, properties seen :0
Exhaustive walk after 101911 steps, saw 15670 distinct states, run finished after 107 ms. (steps per millisecond=952 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PGCD-COL-D02N006-UpperBounds-03 19 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N006-UpperBounds-07 19 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N006-UpperBounds-11 19 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N006-UpperBounds-13 19 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N006-UpperBounds-02 19 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-26 21:09:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000010 steps (2 resets) in 204 ms. (4878 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 4210 ms.
BK_STOP 1779829741742
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="PGCD-COL-D02N006"
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 PGCD-COL-D02N006, 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 r194-tall-177969914300757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N006.tgz
mv PGCD-COL-D02N006 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 ;