About the Execution of ITS-Tools for JoinFreeModules-PT-0020
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is JoinFreeModules-PT-0020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700173
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.5K Mar 7 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 16:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 16:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 7 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 11:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 61K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779737643481
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:34:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:34:05] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2026-05-25 19:34:05] [INFO ] Transformed 101 places.
[2026-05-25 19:34:05] [INFO ] Transformed 161 transitions.
[2026-05-25 19:34:05] [INFO ] Parsed PT model containing 101 places and 161 transitions and 462 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 2, 2, 0, 2, 0, 1, 20, 2, 2, 0, 0, 20, 20, 2, 20] 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, 2, 2, 0, 2, 0, 1, 20, 2, 2, 0, 0, 20, 20, 2, 20] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13411983960387295856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6464642422943081792.kers'
[2026-05-25 19:34:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13411983960387295856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6464642422943081792.kers]
Normalized transition count is 160 out of 161 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 100 cols 400 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-25 19:34:05] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6464642422943081792.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 2, 0, 2, 0, 1, 20, 2, 2, 0, 0, 20, 20, 2, 20] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
RANDOM walk for 10000 steps (2 resets) in 124 ms. (80 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 575 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 18, 19, 22, 20, 19, 21, 20, 18, 20, 20, 18, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
[2026-05-25 19:34:06] [INFO ] Invariant cache hit.
[2026-05-25 19:34:06] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2026-05-25 19:34:07] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2026-05-25 19:34:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:07] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-25 19:34:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-25 19:34:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 9 ms returned sat
[2026-05-25 19:34:07] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 27 ms.
[2026-05-25 19:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2026-05-25 19:34:08] [INFO ] Added : 77 causal constraints over 17 iterations in 920 ms. Result :sat
Minimization took 124 ms.
[2026-05-25 19:34:08] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2026-05-25 19:34:08] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2026-05-25 19:34:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2026-05-25 19:34:08] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-25 19:34:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 317 ms returned sat
[2026-05-25 19:34:09] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 28 ms.
[2026-05-25 19:34:09] [INFO ] Added : 59 causal constraints over 13 iterations in 278 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 19:34:09] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:09] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-25 19:34:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2026-05-25 19:34:09] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2026-05-25 19:34:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 201 ms returned sat
[2026-05-25 19:34:10] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-25 19:34:10] [INFO ] Added : 53 causal constraints over 13 iterations in 605 ms. Result :sat
Minimization took 92 ms.
[2026-05-25 19:34:10] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2026-05-25 19:34:11] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2026-05-25 19:34:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:11] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-25 19:34:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 430 ms returned sat
[2026-05-25 19:34:11] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 20 ms.
[2026-05-25 19:34:11] [INFO ] Added : 58 causal constraints over 13 iterations in 238 ms. Result :sat
Minimization took 35 ms.
[2026-05-25 19:34:11] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2026-05-25 19:34:12] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-25 19:34:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2026-05-25 19:34:12] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-25 19:34:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 302 ms returned sat
[2026-05-25 19:34:12] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 22 ms.
[2026-05-25 19:34:12] [INFO ] Added : 55 causal constraints over 13 iterations in 298 ms. Result :sat
Minimization took 44 ms.
[2026-05-25 19:34:12] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 19:34:13] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-25 19:34:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 19:34:13] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-25 19:34:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 351 ms returned sat
[2026-05-25 19:34:13] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 18 ms.
[2026-05-25 19:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2026-05-25 19:34:14] [INFO ] Added : 63 causal constraints over 14 iterations in 538 ms. Result :sat
Minimization took 53 ms.
[2026-05-25 19:34:14] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:14] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-25 19:34:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2026-05-25 19:34:14] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-25 19:34:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 381 ms returned sat
[2026-05-25 19:34:14] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 36 ms.
[2026-05-25 19:34:15] [INFO ] Added : 36 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 39 ms.
[2026-05-25 19:34:15] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2026-05-25 19:34:15] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-25 19:34:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:15] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2026-05-25 19:34:15] [INFO ] [Nat]Added 20 Read/Feed constraints in 199 ms returned sat
[2026-05-25 19:34:15] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 19:34:15] [INFO ] Added : 35 causal constraints over 8 iterations in 244 ms. Result :sat
Minimization took 37 ms.
[2026-05-25 19:34:16] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:16] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-25 19:34:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:16] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2026-05-25 19:34:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 304 ms returned sat
[2026-05-25 19:34:16] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-25 19:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 19:34:17] [INFO ] Added : 63 causal constraints over 13 iterations in 300 ms. Result :sat
Minimization took 52 ms.
[2026-05-25 19:34:17] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:17] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-25 19:34:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2026-05-25 19:34:17] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2026-05-25 19:34:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 135 ms returned sat
[2026-05-25 19:34:17] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-25 19:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2026-05-25 19:34:18] [INFO ] Added : 65 causal constraints over 14 iterations in 354 ms. Result :sat
Minimization took 37 ms.
[2026-05-25 19:34:18] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 19:34:18] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-25 19:34:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 19:34:18] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-25 19:34:18] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:34:19] [INFO ] [Nat]Added 20 Read/Feed constraints in 587 ms returned sat
[2026-05-25 19:34:19] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-25 19:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2026-05-25 19:34:19] [INFO ] Added : 73 causal constraints over 16 iterations in 362 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:34:19] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:19] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:34:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:19] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:34:20] [INFO ] [Nat]Added 20 Read/Feed constraints in 354 ms returned sat
[2026-05-25 19:34:20] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-25 19:34:20] [INFO ] Added : 37 causal constraints over 9 iterations in 192 ms. Result :sat
Minimization took 59 ms.
[2026-05-25 19:34:20] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:20] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-25 19:34:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:20] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-25 19:34:20] [INFO ] [Nat]Added 20 Read/Feed constraints in 331 ms returned sat
[2026-05-25 19:34:20] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:34:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2026-05-25 19:34:21] [INFO ] Added : 63 causal constraints over 14 iterations in 493 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 19:34:21] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:21] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:34:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:21] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-25 19:34:22] [INFO ] [Nat]Added 20 Read/Feed constraints in 291 ms returned sat
[2026-05-25 19:34:22] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-25 19:34:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 180 ms
[2026-05-25 19:34:22] [INFO ] Added : 67 causal constraints over 15 iterations in 478 ms. Result :sat
Minimization took 49 ms.
[2026-05-25 19:34:22] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:22] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:34:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:22] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:34:23] [INFO ] [Nat]Added 20 Read/Feed constraints in 226 ms returned sat
[2026-05-25 19:34:23] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-25 19:34:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2026-05-25 19:34:23] [INFO ] Added : 69 causal constraints over 16 iterations in 397 ms. Result :sat
Minimization took 52 ms.
[2026-05-25 19:34:23] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 19:34:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:34:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:23] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2026-05-25 19:34:24] [INFO ] [Nat]Added 20 Read/Feed constraints in 157 ms returned sat
[2026-05-25 19:34:24] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-25 19:34:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 392 ms
[2026-05-25 19:34:25] [INFO ] Added : 71 causal constraints over 16 iterations in 1052 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[18, 18, 19, 22, 20, 19, 21, 20, 18, 20, 20, 18, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
FORMULA JoinFreeModules-PT-0020-UpperBounds-11 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22, 22, 22, 22, 22, 19, 21, 20, 22, 22, 20, 20, 20, 22, 20] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
Support contains 15 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 161/161 transitions.
Graph (complete) has 240 edges and 100 vertex of which 60 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 96
Applied a total of 2 rules in 36 ms. Remains 60 /100 variables (removed 40) and now considering 96/161 (removed 65) transitions.
Running 72 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6056330163878723531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11477529039151967917.kers'
[2026-05-25 19:34:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6056330163878723531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11477529039151967917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 60 cols 240 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-25 19:34:29] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11477529039151967917.kers
Total runtime 1 ms.
[2026-05-25 19:34:29] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 12/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 84 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 12/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 156 constraints, problems are : Problem set: 0 solved, 72 unsolved in 11692 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14785ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 14800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14875 ms. Remains : 60/100 places, 96/161 transitions.
[2026-05-25 19:34:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[22, 22, 22, 22, 22, 19, 21, 20, 22, 22, 20, 20, 20, 22, 20] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
RANDOM walk for 1000002 steps (2 resets) in 2522 ms. (396 steps per ms)
FORMULA JoinFreeModules-PT-0020-UpperBounds-10 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-05 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-03 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 12000012 steps (24 resets) in 13596 ms. (882 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22, 22, 22, 22, 21, 20, 22, 22, 20, 20, 22, 20] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
[2026-05-25 19:34:59] [INFO ] Invariant cache hit.
[2026-05-25 19:34:59] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:35:00] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:35:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:35:00] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:35:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 19:35:00] [INFO ] [Nat]Added 12 Read/Feed constraints in 525 ms returned sat
[2026-05-25 19:35:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2026-05-25 19:35:00] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:35:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:35:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:35:00] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:35:00] [INFO ] [Nat]Added 12 Read/Feed constraints in 75 ms returned sat
[2026-05-25 19:35:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2026-05-25 19:35:00] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:01] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:35:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:35:01] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:35:01] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:35:01] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:35:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 77 ms
Minimization took 31 ms.
[2026-05-25 19:35:01] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:35:01] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:35:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:01] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-25 19:35:01] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:35:01] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2026-05-25 19:35:01] [INFO ] Added : 51 causal constraints over 13 iterations in 195 ms. Result :sat
Minimization took 25 ms.
[2026-05-25 19:35:02] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:35:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-25 19:35:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:35:02] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-25 19:35:02] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:35:02] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2026-05-25 19:35:02] [INFO ] Added : 59 causal constraints over 12 iterations in 260 ms. Result :sat
Minimization took 39 ms.
[2026-05-25 19:35:02] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-25 19:35:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:03] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2026-05-25 19:35:03] [INFO ] [Nat]Added 12 Read/Feed constraints in 143 ms returned sat
[2026-05-25 19:35:03] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:35:03] [INFO ] Added : 35 causal constraints over 8 iterations in 379 ms. Result :sat
Minimization took 29 ms.
[2026-05-25 19:35:03] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:35:03] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:35:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:03] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2026-05-25 19:35:03] [INFO ] [Nat]Added 12 Read/Feed constraints in 213 ms returned sat
[2026-05-25 19:35:03] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:35:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
Minimization took 19 ms.
[2026-05-25 19:35:04] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:04] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:35:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:35:04] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:35:04] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:35:04] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:35:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
Minimization took 17 ms.
[2026-05-25 19:35:04] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:04] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:35:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:04] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:35:05] [INFO ] [Nat]Added 12 Read/Feed constraints in 428 ms returned sat
[2026-05-25 19:35:05] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 19:35:05] [INFO ] Added : 53 causal constraints over 11 iterations in 200 ms. Result :sat
Minimization took 52 ms.
[2026-05-25 19:35:05] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:05] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:35:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:05] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-25 19:35:05] [INFO ] [Nat]Added 12 Read/Feed constraints in 217 ms returned sat
[2026-05-25 19:35:05] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2026-05-25 19:35:05] [INFO ] Added : 40 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 31 ms.
[2026-05-25 19:35:05] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:06] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:35:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:06] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:35:06] [INFO ] [Nat]Added 12 Read/Feed constraints in 427 ms returned sat
[2026-05-25 19:35:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2026-05-25 19:35:06] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:06] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-25 19:35:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:06] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:35:06] [INFO ] [Nat]Added 12 Read/Feed constraints in 218 ms returned sat
[2026-05-25 19:35:07] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:35:07] [INFO ] Added : 32 causal constraints over 8 iterations in 78 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 22, 22, 22, 21, 20, 22, 22, 20, 20, 22, 20] Max Struct:[22, 22, 22, 23, 23, 23, 22, 22, 23, 23, 22, 23]
FORMULA JoinFreeModules-PT-0020-UpperBounds-14 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-09 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-08 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-02 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-01 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-00 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22, 21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23, 23]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 30 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 6 ms. Remains 30 /60 variables (removed 30) and now considering 48/96 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 30/60 places, 48/96 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-534180907789895769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16275077655016194425.kers'
[2026-05-25 19:35:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-534180907789895769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16275077655016194425.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 30 cols 120 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-25 19:35:07] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16275077655016194425.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[22, 21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23, 23]
RANDOM walk for 1000006 steps (2 resets) in 1087 ms. (919 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 4183 ms. (1434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22, 21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23, 23]
[2026-05-25 19:35:12] [INFO ] Invariant cache hit.
[2026-05-25 19:35:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 19:35:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 19:35:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 19:35:12] [INFO ] [Nat]Added 6 Read/Feed constraints in 14 ms returned sat
[2026-05-25 19:35:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2026-05-25 19:35:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-25 19:35:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 19:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2026-05-25 19:35:13] [INFO ] Added : 22 causal constraints over 5 iterations in 98 ms. Result :sat
Minimization took 18 ms.
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 19:35:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 26 ms returned sat
[2026-05-25 19:35:13] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 19:35:13] [INFO ] Added : 11 causal constraints over 4 iterations in 159 ms. Result :sat
Minimization took 23 ms.
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 19:35:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 19:35:13] [INFO ] Added : 17 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 17 ms.
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 19:35:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 16 ms returned sat
[2026-05-25 19:35:13] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 19:35:13] [INFO ] Added : 13 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 15 ms.
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 19:35:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 19:35:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2026-05-25 19:35:13] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:35:13] [INFO ] Added : 10 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 21, 20, 20, 20, 20] Max Struct:[22, 23, 23, 23, 23, 23]
FORMULA JoinFreeModules-PT-0020-UpperBounds-04 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 25 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 25 /30 variables (removed 5) and now considering 40/48 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/30 places, 40/48 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6865063059829197986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15090583519847707189.kers'
[2026-05-25 19:35:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6865063059829197986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15090583519847707189.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 40 rows 25 cols 100 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-25 19:35:14] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15090583519847707189.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23]
RANDOM walk for 1000000 steps (2 resets) in 932 ms. (1071 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 2648 ms. (1887 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23]
[2026-05-25 19:35:17] [INFO ] Invariant cache hit.
[2026-05-25 19:35:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 19:35:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 19:35:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 19:35:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 19:35:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 17 ms returned sat
[2026-05-25 19:35:17] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 19:35:17] [INFO ] Added : 24 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 18 ms.
[2026-05-25 19:35:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 19:35:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:17] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-25 19:35:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 56 ms returned sat
[2026-05-25 19:35:17] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:35:18] [INFO ] Added : 18 causal constraints over 4 iterations in 224 ms. Result :sat
Minimization took 24 ms.
[2026-05-25 19:35:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 19:35:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 17 ms returned sat
[2026-05-25 19:35:18] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 19:35:18] [INFO ] Added : 26 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 30 ms.
[2026-05-25 19:35:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 19:35:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 27 ms returned sat
[2026-05-25 19:35:18] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:35:18] [INFO ] Added : 17 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 24 ms.
[2026-05-25 19:35:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 19:35:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:35:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 19:35:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 48 ms returned sat
[2026-05-25 19:35:18] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:35:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2026-05-25 19:35:18] [INFO ] Added : 15 causal constraints over 4 iterations in 70 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 20, 20, 20, 20] Max Struct:[23, 23, 23, 23, 23]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2026-05-25 19:35:19] [INFO ] Invariant cache hit.
[2026-05-25 19:35:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 19:35:19] [INFO ] Invariant cache hit.
[2026-05-25 19:35:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 19:35:19] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-25 19:35:19] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-25 19:35:19] [INFO ] Invariant cache hit.
[2026-05-25 19:35:19] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 30 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 65 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1466 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2322ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 2323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2405 ms. Remains : 25/25 places, 40/40 transitions.
RANDOM walk for 40012 steps (8 resets) in 1010 ms. (39 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 10/10 properties
[2026-05-25 19:35:22] [INFO ] Flatten gal took : 49 ms
[2026-05-25 19:35:22] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:35:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1675206188614523958.gal : 9 ms
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
[2026-05-25 19:35:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4515529529573368644.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1675206188614523958.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4515529529573368644.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4515529529573368644.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :76 after 182
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :182 after 2071
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :2071 after 8133
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :8133 after 12357
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :12357 after 1.68314e+08
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1.68314e+08 after 4.48365e+15
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,1.42404e+21,0.436075,10296,2,791,14,32681,16,0,224,34977,0
Total reachable state count : 1424037965890850099968
Verifying 10 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.437209,10432,1,0,14,32681,16,0,225,34977,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.438218,10516,1,0,14,32681,16,0,225,34977,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.438649,10516,1,0,14,32681,16,0,225,34977,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.439127,10516,1,0,14,32681,16,0,225,34977,0
Reachability property MAX2 does not hold.
No reachable states exhibit your property : MAX2
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,0,0.439373,10516,1,0,14,32681,16,0,225,34977,0
Invariant property MIN2 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
MIN2,0,0.439663,10516,1,0,14,32681,16,0,225,34977,0
Reachability property MAX3 does not hold.
No reachable states exhibit your property : MAX3
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,0,0.440244,10516,1,0,14,32681,16,0,225,34977,0
Invariant property MIN3 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
MIN3,0,0.440866,10516,1,0,14,32681,16,0,225,34977,0
Reachability property MAX4 does not hold.
No reachable states exhibit your property : MAX4
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,0,0.441573,10516,1,0,14,32681,16,0,225,34977,0
Invariant property MIN4 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
MIN4,0,0.44237,10516,1,0,14,32681,16,0,225,34977,0
Interrupted probabilistic random walk after 176857 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 10
Probabilistic random walk after 176857 steps, saw 145427 distinct states, run finished after 3009 ms. (steps per millisecond=58 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-06 21 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0020-UpperBounds-07 20 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0020-UpperBounds-12 20 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0020-UpperBounds-13 20 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0020-UpperBounds-15 20 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 19:35:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 911 ms. (1096 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 80871 ms.
BK_STOP 1779737726276
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0020, 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 r162-smll-177961107700173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0020.tgz
mv JoinFreeModules-PT-0020 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 ;