About the Execution of ITS-Tools for ClientsAndServers-PT-N2000P0
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853814200589.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 ClientsAndServers-PT-N2000P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853814200589
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 9.2K 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 ClientsAndServers-PT-N2000P0-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749036047984
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N2000P0
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 11:20:50] [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-04 11:20:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 11:20:50] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2025-06-04 11:20:50] [INFO ] Transformed 25 places.
[2025-06-04 11:20:50] [INFO ] Transformed 18 transitions.
[2025-06-04 11:20:50] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 8000, 0, 16000, 6000, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 8000, 0, 16000, 6000, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 18 rows 25 cols
[2025-06-04 11:20:50] [INFO ] Computed 8 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 8000, 0, 16000, 6000, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4000, 4000, 4000, 4000, 4000, 8000, 16000, 16000, 6000, 4000, 4000, 4000, 16000, 16000, 4000, 8000]
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-08 6000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-07 16000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-05 8000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 16001 steps (0 resets) in 13 ms. (1142 steps per ms)
BEST_FIRST walk for 130013 steps (26 resets) in 172 ms. (751 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 17, 252, 25, 25, 11, 11, 59, 252, 1112, 1112, 477, 44] Max Struct:[4000, 4000, 4000, 4000, 4000, 16000, 4000, 4000, 4000, 16000, 16000, 4000, 8000]
[2025-06-04 11:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:50] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2025-06-04 11:20:50] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-04 11:20:50] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-04 11:20:50] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-04 11:20:50] [INFO ] Added : 15 causal constraints over 3 iterations in 57 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-04 11:20:51] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:51] [INFO ] Added : 16 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 9 ms.
[2025-06-04 11:20:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:51] [INFO ] Added : 16 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:51] [INFO ] Added : 13 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 15 ms.
[2025-06-04 11:20:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:51] [INFO ] Added : 13 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-04 11:20:51] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:51] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-04 11:20:51] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-04 11:20:52] [INFO ] Added : 14 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-04 11:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-04 11:20:52] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-04 11:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 20 ms.
[2025-06-04 11:20:52] [INFO ] Added : 16 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 30 ms.
[2025-06-04 11:20:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-04 11:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-04 11:20:52] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-04 11:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-04 11:20:52] [INFO ] Added : 6 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 8 ms.
[2025-06-04 11:20:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-04 11:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:52] [INFO ] Added : 6 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-04 11:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-04 11:20:52] [INFO ] Added : 7 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 8 ms.
[2025-06-04 11:20:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 11:20:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-04 11:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:52] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 12 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:53] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:53] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-04 11:20:53] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-04 11:20:53] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 25 ms.
[2025-06-04 11:20:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:53] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 11:20:53] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-04 11:20:53] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-04 11:20:53] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 11:20:53] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-04 11:20:53] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 11:20:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-04 11:20:53] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-04 11:20:53] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 17, 252, 25, 25, 11, 11, 59, 252, 1112, 1112, 477, 44] Max Struct:[4000, 4000, 4000, 4000, 4000, 16000, 4000, 4000, 4000, 16000, 16000, 4000, 8000]
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-15 8000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-14 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-11 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-10 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-02 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-13 16000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-12 16000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-09 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-04 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-03 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-01 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-06 16000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4000] Max Struct:[4000]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 10 transition count 4
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 6 transition count 4
Applied a total of 33 rules in 48 ms. Remains 6 /25 variables (removed 19) and now considering 4/18 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 6/25 places, 4/18 transitions.
// Phase 1: matrix 4 rows 6 cols
[2025-06-04 11:22:06] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4000] Max Struct:[4000]
FORMULA ClientsAndServers-PT-N2000P0-UpperBounds-00 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000235 steps (2 resets) in 180 ms. (5526 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:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 11:22:06] [INFO ] Flatten gal took : 24 ms
[2025-06-04 11:22:06] [INFO ] Flatten gal took : 3 ms
[2025-06-04 11:22:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4975782207710703180.gal : 5 ms
[2025-06-04 11:22:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality192680479958921061.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/ReachabilityCardinality4975782207710703180.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality192680479958921061.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
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 ...327
Loading property file /tmp/ReachabilityCardinality192680479958921061.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,5,0.019939,3724,2,15,5,59,6,0,31,35,0
Total reachable state count : 5
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 77029 ms.
BK_STOP 1749036127190
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ClientsAndServers-PT-N2000P0"
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 ClientsAndServers-PT-N2000P0, 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 r030-smll-174853814200589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 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 ;