Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876813100701.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-PT-D02N005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876813100701
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 57K 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 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K 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_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.6K 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-PT-D02N005-UpperBounds-00
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-01
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-02
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-03
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-04
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-05
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-06
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-07
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-08
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-09
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-10
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-11
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-12
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-13
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-14
FORMULA_NAME PGCD-PT-D02N005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748975128891

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D02N005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-03 18:25:29] [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 18:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:25:30] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2025-06-03 18:25:30] [INFO ] Transformed 9 places.
[2025-06-03 18:25:30] [INFO ] Transformed 9 transitions.
[2025-06-03 18:25:30] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 6
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 5, 1, 1, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 5, 1, 1, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 9 rows 9 cols
[2025-06-03 18:25:30] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 5, 1, 1, 5] Max Struct:[18, 18, 18, 18, 18, 18]
RANDOM walk for 10000 steps (2 resets) in 22 ms. (434 steps per ms)
FORMULA PGCD-PT-D02N005-UpperBounds-06 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-11 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-00 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (10 resets) in 49 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 16, 14, 14, 12] Max Struct:[18, 18, 18, 18, 18]
[2025-06-03 18:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 18:25:30] [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 18:25:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 18:25:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 18:25:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 18:25:30] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 18:25:30] [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 18:25:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 8 ms to minimize.
[2025-06-03 18:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-03 18:25:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 18:25:30] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 18:25:30] [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 18:25:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 18:25:30] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 18:25:30] [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 18:25:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 18:25:30] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 18:25:30] [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 18:25:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 18:25:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2025-06-03 18:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2025-06-03 18:25:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 18:25:30] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 16, 14, 14, 12] Max Struct:[18, 18, 18, 18, 18]
FORMULA PGCD-PT-D02N005-UpperBounds-14 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-09 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-04 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-05 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-07 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-08 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D02N005-UpperBounds-03 18 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[18, 16, 16] Max Struct:[18, 18, 18]
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 18:25:30] [INFO ] Invariant cache hit.
[2025-06-03 18:25:30] [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 93 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 55 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 163ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 9/9 places, 9/9 transitions.
[2025-06-03 18:25:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[18, 16, 16] Max Struct:[18, 18, 18]
FORMULA PGCD-PT-D02N005-UpperBounds-01 18 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (7 resets) in 370 ms. (2695 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 582 ms. (3430 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 16] Max Struct:[18, 18]
[2025-06-03 18:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 18:25:32] [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 18:25:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 18:25:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 18:25:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
[2025-06-03 18:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2025-06-03 18:25:32] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 18:25:32] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 18:25:32] [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 18:25:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
[2025-06-03 18:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-03 18:25:32] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 18:25:32] [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:[16, 16] Max Struct:[18, 18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 16] Max Struct:[18, 18]
Support contains 2 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 0 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 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2025-06-03 18:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:25:32] [INFO ] Implicit Places using invariants in 31 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 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 35 ms. Remains : 6/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 18:25:32] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16, 16] Max Struct:[18, 18]
RANDOM walk for 1000004 steps (7 resets) in 227 ms. (4385 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 364 ms. (5479 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 16] Max Struct:[18, 18]
[2025-06-03 18:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 18:25:32] [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 18:25:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 18:25:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 18:25:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 18:25:32] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 18:25:32] [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 18:25:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 18:25:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
[2025-06-03 18:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-03 18:25:32] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 18:25:32] [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:[16, 16] Max Struct:[18, 18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 16] Max Struct:[18, 18]
Support contains 2 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 0 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 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2025-06-03 18:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:25:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 18:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:25:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 18:25:33] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:25:33] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 18:25:33] [INFO ] Invariant cache hit.
[2025-06-03 18:25:33] [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 56 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 43 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 105ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40013 steps (8 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
[2025-06-03 18:25:33] [INFO ] Flatten gal took : 18 ms
[2025-06-03 18:25:33] [INFO ] Flatten gal took : 7 ms
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
[2025-06-03 18:25:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6981805576131418658.gal : 5 ms
[2025-06-03 18:25:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3580911782659294699.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/ReachabilityCardinality6981805576131418658.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3580911782659294699.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties

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 ...328
Loading property file /tmp/ReachabilityCardinality3580911782659294699.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 65
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :421 after 429
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1842 after 1974
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :6666 after 6725
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8484,0.030315,4500,2,134,13,3739,10,0,49,3598,0
Total reachable state count : 8484

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.030546,4500,1,0,13,3739,10,0,50,3598,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.030791,4756,1,0,13,3739,10,0,50,3598,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.030886,4756,1,0,13,3739,10,0,50,3598,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.030973,4756,1,0,13,3739,10,0,50,3598,0
Probably explored full state space saw : 8484 states, properties seen :0
Probabilistic random walk after 51828 steps, saw 8484 distinct states, run finished after 162 ms. (steps per millisecond=319 ) properties seen :0
Explored full state space saw : 8484 states, properties seen :0
Exhaustive walk after 51828 steps, saw 8484 distinct states, run finished after 100 ms. (steps per millisecond=518 ) properties seen :0
FORMULA PGCD-PT-D02N005-UpperBounds-10 16 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N005-UpperBounds-12 16 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N005-UpperBounds-13 16 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N005-UpperBounds-15 16 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N005-UpperBounds-02 16 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3753 ms.

BK_STOP 1748975133781

--------------------
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-PT-D02N005"
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-PT-D02N005, 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-174876813100701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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