About the Execution of ITS-Tools for PGCD-COL-D04N025
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-177969914300781.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-D04N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300781
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Mar 8 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 8 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 8 14:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 14:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 17 06:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 17 06:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 17 06:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 17 06:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 8 14:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Mar 8 14:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 8 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 8 14:40 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-D04N025-UpperBounds-00
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-01
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-02
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-03
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-04
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-05
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-06
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-07
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-08
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-09
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-10
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-11
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-12
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-13
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-14
FORMULA_NAME PGCD-COL-D04N025-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779833228173
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-D04N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-26 22:07:09] [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 22:07:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 22:07:09] [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 22:07:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 22:07:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 484 ms
[2026-05-26 22:07:09] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 15 PT places and 15.0 transition bindings in 15 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 22:07:09] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2026-05-26 22:07:09] [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-13242170598556447978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8181730906552656735.kers'
[2026-05-26 22:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13242170598556447978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8181730906552656735.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 22:07:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8181730906552656735.kers
Total runtime 0 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[125, 5, 5] Max Struct:[130, 130, 130]
[2026-05-26 22:07:09] [INFO ] Invariant cache hit.
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 22:07:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 22:07:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-26 22:07:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2026-05-26 22:07:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 22:07:10] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 2 ms.
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 22:07:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 22:07:10] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 22:07:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 22:07:10] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[125, 5, 5] Max Struct:[130, 130, 130]
Arc [1:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2026-05-26 22:07:10] [INFO ] Unfolded HLPN to a Petri net with 15 places and 15 transitions 70 arcs in 12 ms.
[2026-05-26 22:07:10] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[125, 5, 5] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[125, 5, 5] Max Struct:[130, 130, 130]
Current structural bounds on expressions (Before main loop) : Max Seen:[125, 5, 5] Max Struct:[130, 130, 130]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11802503949001283308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16046482743635242759.kers'
[2026-05-26 22:07:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11802503949001283308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16046482743635242759.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 15 rows 10 cols 40 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-26 22:07:10] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16046482743635242759.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[125, 5, 5] Max Struct:[130, 130, 130]
RANDOM walk for 10010 steps (2 resets) in 12 ms. (770 steps per ms)
FORMULA PGCD-COL-D04N025-UpperBounds-15 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-10 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-05 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-06 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-09 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-12 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-13 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D04N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (6 resets) in 29 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2026-05-26 22:07:10] [INFO ] Invariant cache hit.
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-26 22:07:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 22:07:10] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 22:07:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 22:07:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-26 22:07:10] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 22:07:10] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 8 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-26 22:07:10] [INFO ] Invariant cache hit.
[2026-05-26 22:07:10] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 5 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 244ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 15/15 places, 15/15 transitions.
[2026-05-26 22:07:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000003 steps (2 resets) in 311 ms. (3205 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 334 ms. (2985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2026-05-26 22:07:11] [INFO ] Invariant cache hit.
[2026-05-26 22:07:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:11] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-26 22:07:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-26 22:07:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 22:07:11] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-26 22:07:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 22:07:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:11] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 22:07:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 22:07:11] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-26 22:07:11] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 22:07:11] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-26 22:07:11] [INFO ] Invariant cache hit.
[2026-05-26 22:07:11] [INFO ] Implicit Places using invariants in 52 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 57 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60 ms. Remains : 10/15 places, 15/15 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5905983913297086136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9111903782044170154.kers'
[2026-05-26 22:07:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5905983913297086136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9111903782044170154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 10 cols 40 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-26 22:07:11] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9111903782044170154.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000016 steps (2 resets) in 161 ms. (6172 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 253 ms. (3937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2026-05-26 22:07:11] [INFO ] Invariant cache hit.
[2026-05-26 22:07:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 22:07:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 22:07:12] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-26 22:07:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 22:07:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 22:07:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 22:07:12] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-26 22:07:12] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 22:07:12] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-26 22:07:12] [INFO ] Invariant cache hit.
[2026-05-26 22:07:12] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-26 22:07:12] [INFO ] Invariant cache hit.
[2026-05-26 22:07:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 22:07:12] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-26 22:07:12] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-26 22:07:12] [INFO ] Invariant cache hit.
[2026-05-26 22:07:12] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 197ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40070 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
[2026-05-26 22:07:12] [INFO ] Flatten gal took : 36 ms
[2026-05-26 22:07:12] [INFO ] Flatten gal took : 7 ms
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2026-05-26 22:07:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7548810910678456411.gal : 87 ms
[2026-05-26 22:07:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6173554847350795255.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/ReachabilityCardinality7548810910678456411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6173554847350795255.prop' '--nowitness' '--gen-order' 'FOLLOW'
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 ...328
Loading property file /tmp/ReachabilityCardinality6173554847350795255.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 1651
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
Interrupted probabilistic random walk after 812715 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 2
Probabilistic random walk after 812715 steps, saw 470555 distinct states, run finished after 3005 ms. (steps per millisecond=270 ) properties seen :0
[2026-05-26 22:07:15] [INFO ] Invariant cache hit.
[2026-05-26 22:07:15] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 2 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PGCD-COL-D04N025-UpperBounds-01 128 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D04N025-UpperBounds-02 128 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D04N025-UpperBounds-04 128 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D04N025-UpperBounds-07 128 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D04N025-UpperBounds-08 128 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D04N025-UpperBounds-14 128 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D04N025-UpperBounds-00 128 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-26 22:07:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000010 steps (2 resets) in 172 ms. (5780 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 6550 ms.
BK_STOP 1779833235852
--------------------
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="PGCD-COL-D04N025"
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-D04N025, 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-177969914300781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D04N025.tgz
mv PGCD-COL-D04N025 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 ;