Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16K 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 JoinFreeModules-PT-0005-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774311125

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:38:32] [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-01 10:38:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:38:32] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2025-06-01 10:38:32] [INFO ] Transformed 26 places.
[2025-06-01 10:38:32] [INFO ] Transformed 41 transitions.
[2025-06-01 10:38:32] [INFO ] Parsed PT model containing 26 places and 41 transitions and 117 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0005-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 5, 1, 0, 5, 5, 0, 0, 0, 2, 1, 1, 5, 0] Max Struct:[+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, 1, 5, 1, 0, 5, 5, 0, 0, 0, 2, 1, 1, 5, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 41 rows 25 cols
[2025-06-01 10:38:32] [INFO ] Computed 5 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 5, 1, 0, 5, 5, 0, 0, 0, 2, 1, 1, 5, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 10000 steps (10 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 150014 steps (30 resets) in 122 ms. (1219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 6, 5, 6, 7, 5, 5, 6, 6, 6, 7, 6, 6, 5, 7] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2025-06-01 10:38:32] [INFO ] Invariant cache hit.
[2025-06-01 10:38:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:38:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 10:38:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:38:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:38:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 7 ms to minimize.
[2025-06-01 10:38:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
Minimization took 7 ms.
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:33] [INFO ] Added : 18 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:38:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:38:33] [INFO ] Added : 17 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 13 ms.
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:38:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 3 ms to minimize.
[2025-06-01 10:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-01 10:38:33] [INFO ] Added : 30 causal constraints over 7 iterations in 93 ms. Result :sat
Minimization took 14 ms.
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:38:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2025-06-01 10:38:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:38:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:33] [INFO ] Added : 25 causal constraints over 5 iterations in 95 ms. Result :sat
Minimization took 14 ms.
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 41 ms returned sat
[2025-06-01 10:38:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:34] [INFO ] Added : 19 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 13 ms returned sat
[2025-06-01 10:38:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:34] [INFO ] Added : 18 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 31 ms returned sat
[2025-06-01 10:38:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:34] [INFO ] Added : 20 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 14 ms.
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:38:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:34] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:34] [INFO ] Added : 18 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:38:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2025-06-01 10:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-01 10:38:34] [INFO ] Added : 25 causal constraints over 5 iterations in 135 ms. Result :sat
Minimization took 17 ms.
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:34] [INFO ] Added : 10 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 13 ms.
[2025-06-01 10:38:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:35] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:38:35] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:38:35] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 10:38:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2025-06-01 10:38:35] [INFO ] Added : 21 causal constraints over 5 iterations in 104 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 33 ms returned sat
[2025-06-01 10:38:35] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:35] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 6, 5, 6, 7, 5, 5, 6, 6, 6, 7, 6, 6, 5, 7] Max Struct:[7, 8, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
FORMULA JoinFreeModules-PT-0005-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 5, 6, 5, 5, 6, 6, 6, 7, 6, 6, 5, 7] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Support contains 13 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 41/41 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 1 place count 25 transition count 40
Applied a total of 1 rules in 21 ms. Remains 25 /25 variables (removed 0) and now considering 40/41 (removed 1) transitions.
Running 30 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 25 cols
[2025-06-01 10:38:35] [INFO ] Computed 5 invariants in 2 ms
[2025-06-01 10:38:35] [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
[2025-06-01 10:38:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:38:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:38:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 10:38:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:38:35] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 30 unsolved in 532 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: 5/5 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, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 70 constraints, problems are : Problem set: 0 solved, 30 unsolved in 634 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: 5/5 constraints]
After SMT, in 1200ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 25/25 places, 40/41 transitions.
[2025-06-01 10:38:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 5, 6, 5, 5, 6, 6, 6, 7, 6, 6, 5, 7] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 1000000 steps (904 resets) in 1137 ms. (878 steps per ms)
BEST_FIRST walk for 13000010 steps (26 resets) in 5576 ms. (2331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 5, 6, 5, 5, 6, 6, 6, 7, 6, 6, 5, 7] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2025-06-01 10:38:43] [INFO ] Invariant cache hit.
[2025-06-01 10:38:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:43] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 10:38:43] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:38:43] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:43] [INFO ] Added : 19 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 10:38:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:43] [INFO ] [Nat]Added 5 Read/Feed constraints in 26 ms returned sat
[2025-06-01 10:38:43] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:43] [INFO ] Added : 21 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:38:44] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:44] [INFO ] Added : 22 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:38:44] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2025-06-01 10:38:44] [INFO ] Added : 21 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:38:44] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-01 10:38:44] [INFO ] Added : 29 causal constraints over 6 iterations in 56 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:38:44] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:44] [INFO ] Added : 9 causal constraints over 2 iterations in 54 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:38:44] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:44] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 31 ms returned sat
[2025-06-01 10:38:44] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:44] [INFO ] Added : 20 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2025-06-01 10:38:44] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:44] [INFO ] Added : 12 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:38:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2025-06-01 10:38:45] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:45] [INFO ] Added : 16 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 10:38:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:38:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2025-06-01 10:38:45] [INFO ] Added : 17 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:38:45] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:45] [INFO ] Added : 17 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 10:38:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:45] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:45] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:45] [INFO ] Added : 10 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 5, 6, 5, 5, 6, 6, 6, 7, 6, 6, 5, 7] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 5, 6, 5, 5, 6, 6, 6, 7, 6, 6, 5, 7] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Support contains 13 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 2 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 2 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 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2025-06-01 10:38:45] [INFO ] Invariant cache hit.
[2025-06-01 10:38:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 10:38:45] [INFO ] Invariant cache hit.
[2025-06-01 10:38:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 10:38:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2025-06-01 10:38:45] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-01 10:38:45] [INFO ] Invariant cache hit.
[2025-06-01 10:38:45] [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
[2025-06-01 10:38:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2025-06-01 10:38:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:38:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 10:38:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2025-06-01 10:38:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 30 unsolved in 393 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: 5/5 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, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 70 constraints, problems are : Problem set: 0 solved, 30 unsolved in 452 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: 5/5 constraints]
After SMT, in 857ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 914 ms. Remains : 25/25 places, 40/40 transitions.
[2025-06-01 10:38:46] [INFO ] Flatten gal took : 50 ms
[2025-06-01 10:38:46] [INFO ] Flatten gal took : 14 ms
[2025-06-01 10:38:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9439042653703455217.gal : 13 ms
RANDOM walk for 40000 steps (32 resets) in 1210 ms. (33 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
[2025-06-01 10:38:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13083887635873760131.prop : 5 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9439042653703455217.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13083887635873760131.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties

BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
its-reach command run as :
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
Loading property file /tmp/ReachabilityCardinality13083887635873760131.prop.
SDD proceeding with computation,26 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,26 properties remain. new max is 8
SDD size :8 after 19
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
SDD proceeding with computation,26 properties remain. new max is 16
SDD size :19 after 81
SDD proceeding with computation,26 properties remain. new max is 32
SDD size :81 after 2575
SDD proceeding with computation,26 properties remain. new max is 64
SDD size :2575 after 1.202e+07
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
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.15927e+10,0.022253,3880,2,176,10,2191,32,0,239,1862,0
Total reachable state count : 11592740743

Verifying 26 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.023071,4188,1,0,10,2191,32,0,240,1862,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.023315,4188,1,0,10,2191,32,0,240,1862,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.023495,4188,1,0,10,2191,32,0,240,1862,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.023685,4188,1,0,10,2191,32,0,240,1862,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.023848,4188,1,0,10,2191,32,0,240,1862,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.023999,4188,1,0,10,2191,32,0,240,1862,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.024155,4188,1,0,10,2191,32,0,240,1862,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.02431,4188,1,0,10,2191,32,0,240,1862,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.024497,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN4 is true.

BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
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.024693,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX5 does not hold.
No reachable states exhibit your property : MAX5

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,0,0.024867,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN5 is true.

BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,0,0.025063,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX6 does not hold.
No reachable states exhibit your property : MAX6

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,0,0.025231,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN6 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
MIN6,0,0.02543,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX7 does not hold.
No reachable states exhibit your property : MAX7

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,0,0.025617,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN7 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
MIN7,0,0.025788,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX8 does not hold.
No reachable states exhibit your property : MAX8

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX8,0,0.025969,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN8 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
MIN8,0,0.026153,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX9 does not hold.
No reachable states exhibit your property : MAX9

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX9,0,0.026296,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN9 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
MIN9,0,0.026433,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX10 does not hold.
No reachable states exhibit your property : MAX10

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX10,0,0.026607,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN10 is true.

BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN10,0,0.026808,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX11 does not hold.
No reachable states exhibit your property : MAX11

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX11,0,0.026944,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN11 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
MIN11,0,0.027074,4188,1,0,10,2191,32,0,240,1862,0
Reachability property MAX12 does not hold.
No reachable states exhibit your property : MAX12

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX12,0,0.027206,4188,1,0,10,2191,32,0,240,1862,0
Invariant property MIN12 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
MIN12,0,0.027341,4188,1,0,10,2191,32,0,240,1862,0
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 255158 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 26
Probabilistic random walk after 255158 steps, saw 137353 distinct states, run finished after 3007 ms. (steps per millisecond=84 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-UpperBounds-15 7 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-14 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-13 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-12 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-11 7 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-10 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-09 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-08 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-07 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-05 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-03 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-02 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-01 6 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 13 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 17928 ms.

BK_STOP 1748774330322

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-0005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is JoinFreeModules-PT-0005, 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 r125-tall-174876435700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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