fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r142-tall-174876813000661
Last Updated
June 24, 2025

About the Execution of ITS-Tools for PGCD-COL-D02N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 7143.00 0.00 0.00 303 303 303 301 303 301 303 303 303 303 303 303 301 303 303 303 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876813000661.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is PGCD-COL-D02N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876813000661
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 11K May 29 14:32 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-D02N100-UpperBounds-00
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-01
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-02
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-03
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-04
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-05
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-06
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-07
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-08
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-09
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-10
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-11
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-12
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-13
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-14
FORMULA_NAME PGCD-COL-D02N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748963252277

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-D02N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-03 15:07:33] [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]
[2025-06-03 15:07:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:07:33] [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.
[2025-06-03 15:07:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 15:07:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 491 ms
[2025-06-03 15:07:34] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 3
[2025-06-03 15:07:34] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 3 ms.
[2025-06-03 15:07:34] [INFO ] Skeletonized 3 HLPN properties in 0 ms.
// Phase 1: matrix 3 rows 3 cols
[2025-06-03 15:07:34] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[3, 3, 300] Max Struct:[303, 303, 303]
[2025-06-03 15:07:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 15:07:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 15:07:34] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 15:07:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 15:07:34] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 15:07:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 15:07:34] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[3, 3, 300] Max Struct:[303, 303, 303]
Arc [1:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2025-06-03 15:07:34] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 20 ms.
[2025-06-03 15:07:34] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[3, 3, 300] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3, 3, 300] Max Struct:[303, 303, 303]
Current structural bounds on expressions (Before main loop) : Max Seen:[3, 3, 300] Max Struct:[303, 303, 303]
// Phase 1: matrix 9 rows 9 cols
[2025-06-03 15:07:34] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 300] Max Struct:[303, 303, 303]
RANDOM walk for 10042 steps (2 resets) in 10 ms. (912 steps per ms)
FORMULA PGCD-COL-D02N100-UpperBounds-07 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-09 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-10 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-14 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-02 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-01 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-04 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-06 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-08 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-11 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-13 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-15 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N100-UpperBounds-00 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[301] Max Struct:[303]
[2025-06-03 15:07:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 15:07:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 15:07:34] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 15:07:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 15:07:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 15:07:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 15:07:34] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 15:07:34] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[301] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[301] Max Struct:[303]
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 7 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2025-06-03 15:07:34] [INFO ] Invariant cache hit.
[2025-06-03 15:07:34] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/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 82 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 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
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/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 83 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 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 180ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 9/9 places, 9/9 transitions.
[2025-06-03 15:07:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[301] Max Struct:[303]
RANDOM walk for 1000098 steps (2 resets) in 221 ms. (4504 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 288 ms. (3460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[301] Max Struct:[303]
[2025-06-03 15:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 15:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 15:07:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 15:07:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 15:07:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 15:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 15:07:35] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 15:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[301] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[301] Max Struct:[303]
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 0 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 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2025-06-03 15:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:07:35] [INFO ] Implicit Places using invariants in 32 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 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 38 ms. Remains : 6/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 15:07:35] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[301] Max Struct:[303]
RANDOM walk for 1000012 steps (2 resets) in 119 ms. (8333 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 203 ms. (4901 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[301] Max Struct:[303]
[2025-06-03 15:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 15:07:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 15:07:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 15:07:35] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-03 15:07:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 15:07:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 15:07:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 15:07:35] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 15:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[301] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[301] Max Struct:[303]
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.
[2025-06-03 15:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:07:35] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-03 15:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:07:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 15:07:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:07:35] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 15:07:35] [INFO ] Invariant cache hit.
[2025-06-03 15:07:35] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 57 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 58 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 119ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40247 steps (8 resets) in 101 ms. (394 steps per ms) remains 2/2 properties
[2025-06-03 15:07:36] [INFO ] Flatten gal took : 25 ms
[2025-06-03 15:07:36] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:07:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7173290300604072277.gal : 3 ms
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
[2025-06-03 15:07:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17131700853809716864.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7173290300604072277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17131700853809716864.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17131700853809716864.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 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 64974
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :64974 after 348281
Interrupted probabilistic random walk after 1431808 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 2
Probabilistic random walk after 1431808 steps, saw 729881 distinct states, run finished after 3005 ms. (steps per millisecond=476 ) properties seen :0
[2025-06-03 15:07:39] [INFO ] Invariant cache hit.
[2025-06-03 15:07:39] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 15:07:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 1 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 15/15 variables, and 12 constraints, problems are : Problem set: 2 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms 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-D02N100-UpperBounds-05 301 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N100-UpperBounds-12 301 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N100-UpperBounds-03 301 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5866 ms.

BK_STOP 1748963259420

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-D02N100"
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-5832"
echo " Executing tool itstools"
echo " Input is PGCD-COL-D02N100, 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 r142-tall-174876813000661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N100.tgz
mv PGCD-COL-D02N100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;