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-174876435700050.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-0003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 9.4K 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-0003-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774286123

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-0003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:38:07] [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:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:38:07] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2025-06-01 10:38:07] [INFO ] Transformed 16 places.
[2025-06-01 10:38:07] [INFO ] Transformed 25 transitions.
[2025-06-01 10:38:07] [INFO ] Parsed PT model containing 16 places and 25 transitions and 71 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 9
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 3, 3, 0, 2, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 3, 3, 0, 2, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 25 rows 15 cols
[2025-06-01 10:38:07] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 3, 3, 0, 2, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 80006 steps (16 resets) in 66 ms. (1194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5, 4, 3, 3, 4, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6]
[2025-06-01 10:38:07] [INFO ] Invariant cache hit.
[2025-06-01 10:38:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:38:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:38:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:07] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:38:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 10:38:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:07] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:07] [INFO ] Added : 6 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:38:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:38:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:38:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 1004 ms. Result :unknown
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:38:09] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:09] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 78 ms to minimize.
[2025-06-01 10:38:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 10:38:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2025-06-01 10:38:09] [INFO ] Added : 11 causal constraints over 3 iterations in 204 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:09] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:38:09] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:09] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:38:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2025-06-01 10:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2025-06-01 10:38:09] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:09] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:38:09] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:09] [INFO ] Added : 11 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:38:09] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:09] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5, 4, 3, 3, 4, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5, 4, 3, 3, 4, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6]
Support contains 8 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 25/25 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 15 transition count 24
Applied a total of 1 rules in 21 ms. Remains 15 /15 variables (removed 0) and now considering 24/25 (removed 1) transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 15 cols
[2025-06-01 10:38:09] [INFO ] Computed 3 invariants in 3 ms
[2025-06-01 10:38:09] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-01 10:38:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:38:10] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2025-06-01 10:38:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 15/15 places, 24/25 transitions.
[2025-06-01 10:38:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 5, 4, 3, 3, 4, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 925 ms. (1079 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 2335 ms. (3424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5, 4, 3, 3, 4, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6]
[2025-06-01 10:38:13] [INFO ] Invariant cache hit.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 10:38:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:13] [INFO ] Added : 10 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:38:14] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:14] [INFO ] Added : 10 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:38:14] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:14] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:14] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:14] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:38:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:38:14] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:14] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2025-06-01 10:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2025-06-01 10:38:14] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:14] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:38:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:38:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2025-06-01 10:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2025-06-01 10:38:14] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2025-06-01 10:38:14] [INFO ] Added : 15 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5, 4, 3, 3, 4, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 5, 6]
FORMULA JoinFreeModules-PT-0003-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5, 4, 3, 3, 4, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6]
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 24/24 transitions.
[2025-06-01 10:38:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 5, 4, 3, 3, 4, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 847 ms. (1179 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 1987 ms. (3521 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5, 4, 3, 3, 4, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6]
[2025-06-01 10:38:17] [INFO ] Invariant cache hit.
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 10:38:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:17] [INFO ] Added : 10 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:38:17] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:17] [INFO ] Added : 10 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:17] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:17] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:17] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:17] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:38:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:38:17] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:17] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:18] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:38:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:38:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 10:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-01 10:38:18] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:38:18] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2025-06-01 10:38:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:18] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:38:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:38:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 10:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-01 10:38:18] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2025-06-01 10:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-01 10:38:18] [INFO ] Added : 15 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5, 4, 3, 3, 4, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5, 4, 3, 3, 4, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6]
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 6 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 15/15 places, 24/24 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2025-06-01 10:38:18] [INFO ] Invariant cache hit.
[2025-06-01 10:38:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-01 10:38:18] [INFO ] Invariant cache hit.
[2025-06-01 10:38:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 10:38:18] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2025-06-01 10:38:18] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-01 10:38:18] [INFO ] Invariant cache hit.
[2025-06-01 10:38:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-01 10:38:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 10:38:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:38:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 561ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 15/15 places, 24/24 transitions.
RANDOM walk for 40000 steps (8 resets) in 900 ms. (44 steps per ms) remains 14/14 properties
[2025-06-01 10:38:19] [INFO ] Flatten gal took : 59 ms
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 14/14 properties
[2025-06-01 10:38:19] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:38:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11228911938202631927.gal : 4 ms
[2025-06-01 10:38:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10824682199616684759.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11228911938202631927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10824682199616684759.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 14/14 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10824682199616684759.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :7 after 13
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :13 after 297
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :297 after 14157
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,35937,0.017789,3788,2,64,9,599,20,0,143,471,0
Total reachable state count : 35937

Verifying 14 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.018313,3788,1,0,9,599,20,0,144,471,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.018534,3788,1,0,9,599,20,0,144,471,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.018654,3788,1,0,9,599,20,0,144,471,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.018753,3788,1,0,9,599,20,0,144,471,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.018844,3788,1,0,9,599,20,0,144,471,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.019028,3788,1,0,9,599,20,0,144,471,0
Reachability property MAX3 does not hold.
No reachable states exhibit your property : MAX3

BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 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
MAX3,0,0.019293,3788,1,0,9,599,20,0,144,471,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.01982,3788,1,0,9,599,20,0,144,471,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.020046,3788,1,0,9,599,20,0,144,471,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.02016,3788,1,0,9,599,20,0,144,471,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.020265,3788,1,0,9,599,20,0,144,471,0
Invariant property MIN5 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
MIN5,0,0.020372,3788,1,0,9,599,20,0,144,471,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.021604,3788,1,0,9,599,20,0,144,471,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.021981,3788,1,0,9,599,20,0,144,471,0
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 14/14 properties
Probably explored full state space saw : 35937 states, properties seen :0
Probabilistic random walk after 261360 steps, saw 35937 distinct states, run finished after 919 ms. (steps per millisecond=284 ) properties seen :0
Explored full state space saw : 35937 states, properties seen :0
Exhaustive walk after 261360 steps, saw 35937 distinct states, run finished after 812 ms. (steps per millisecond=321 ) properties seen :0
FORMULA JoinFreeModules-PT-0003-UpperBounds-13 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-06 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-05 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-07 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-04 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-03 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-14 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-02 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-08 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-10 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-12 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-01 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-00 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 14247 ms.

BK_STOP 1748774301648

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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-0003"
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-0003, 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-174876435700050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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