About the Execution of 2024-gold for JoinFreeModules-PT-0050
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-174876435700055.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-0050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700055
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 152K 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-0050-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748774344150
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-0050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:39:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 10:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:39:05] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-01 10:39:05] [INFO ] Transformed 251 places.
[2025-06-01 10:39:05] [INFO ] Transformed 401 transitions.
[2025-06-01 10:39:05] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[2, 1, 0, 1, 0, 0, 50, 50, 0, 50, 0, 1, 50, 2, 0, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 1, 0, 1, 0, 0, 50, 50, 0, 50, 0, 1, 50, 2, 0, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 401 rows 250 cols
[2025-06-01 10:39:05] [INFO ] Computed 50 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 1, 0, 1, 0, 0, 50, 50, 0, 50, 0, 1, 50, 2, 0, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 10023 steps (2 resets) in 59 ms. (167 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 497 ms. (321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[28, 51, 49, 51, 49, 49, 50, 50, 25, 50, 49, 51, 50, 27, 49, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2025-06-01 10:39:06] [INFO ] Invariant cache hit.
[2025-06-01 10:39:06] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2025-06-01 10:39:06] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-06-01 10:39:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 10:39:06] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-06-01 10:39:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-01 10:39:07] [INFO ] [Nat]Added 50 Read/Feed constraints in 44 ms returned sat
[2025-06-01 10:39:07] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-01 10:39:07] [INFO ] Added : 100 causal constraints over 23 iterations in 672 ms. Result :sat
Minimization took 147 ms.
[2025-06-01 10:39:07] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:08] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-01 10:39:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:08] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-01 10:39:08] [INFO ] [Nat]Added 50 Read/Feed constraints in 39 ms returned sat
[2025-06-01 10:39:08] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-01 10:39:08] [INFO ] Added : 93 causal constraints over 21 iterations in 568 ms. Result :sat
Minimization took 76 ms.
[2025-06-01 10:39:08] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2025-06-01 10:39:09] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-06-01 10:39:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 10:39:09] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-06-01 10:39:09] [INFO ] [Nat]Added 50 Read/Feed constraints in 14 ms returned sat
[2025-06-01 10:39:09] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-01 10:39:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 8 ms to minimize.
[2025-06-01 10:39:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 10:39:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2025-06-01 10:39:09] [INFO ] Added : 72 causal constraints over 16 iterations in 559 ms. Result :sat
Minimization took 77 ms.
[2025-06-01 10:39:10] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 10:39:10] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-06-01 10:39:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2025-06-01 10:39:10] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-01 10:39:10] [INFO ] [Nat]Added 50 Read/Feed constraints in 43 ms returned sat
[2025-06-01 10:39:10] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-01 10:39:10] [INFO ] Added : 87 causal constraints over 19 iterations in 473 ms. Result :sat
Minimization took 84 ms.
[2025-06-01 10:39:10] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:10] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 10:39:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:11] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-06-01 10:39:11] [INFO ] [Nat]Added 50 Read/Feed constraints in 21 ms returned sat
[2025-06-01 10:39:11] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-01 10:39:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:39:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:39:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:39:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2025-06-01 10:39:11] [INFO ] Added : 57 causal constraints over 13 iterations in 496 ms. Result :sat
Minimization took 73 ms.
[2025-06-01 10:39:11] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:11] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-01 10:39:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:12] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-01 10:39:12] [INFO ] [Nat]Added 50 Read/Feed constraints in 29 ms returned sat
[2025-06-01 10:39:12] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2025-06-01 10:39:12] [INFO ] Added : 55 causal constraints over 13 iterations in 312 ms. Result :sat
Minimization took 73 ms.
[2025-06-01 10:39:12] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:12] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-01 10:39:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:12] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-01 10:39:12] [INFO ] [Nat]Added 50 Read/Feed constraints in 34 ms returned sat
[2025-06-01 10:39:12] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-01 10:39:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 10:39:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:39:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2025-06-01 10:39:13] [INFO ] Added : 84 causal constraints over 20 iterations in 641 ms. Result :sat
Minimization took 71 ms.
[2025-06-01 10:39:13] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:13] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-01 10:39:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:13] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-01 10:39:13] [INFO ] [Nat]Added 50 Read/Feed constraints in 54 ms returned sat
[2025-06-01 10:39:14] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-01 10:39:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-01 10:39:14] [INFO ] Added : 95 causal constraints over 19 iterations in 576 ms. Result :sat
Minimization took 77 ms.
[2025-06-01 10:39:14] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:14] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-06-01 10:39:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:14] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-01 10:39:14] [INFO ] [Nat]Added 50 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:39:14] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-01 10:39:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:39:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-06-01 10:39:15] [INFO ] Added : 74 causal constraints over 18 iterations in 567 ms. Result :sat
Minimization took 170 ms.
[2025-06-01 10:39:15] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:15] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-01 10:39:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:16] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-01 10:39:16] [INFO ] [Nat]Added 50 Read/Feed constraints in 38 ms returned sat
[2025-06-01 10:39:16] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-01 10:39:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:39:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:39:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2025-06-01 10:39:16] [INFO ] Added : 79 causal constraints over 17 iterations in 525 ms. Result :sat
Minimization took 71 ms.
[2025-06-01 10:39:16] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:16] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 10:39:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 10:39:16] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-06-01 10:39:17] [INFO ] [Nat]Added 50 Read/Feed constraints in 35 ms returned sat
[2025-06-01 10:39:17] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2025-06-01 10:39:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2025-06-01 10:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-01 10:39:17] [INFO ] Added : 46 causal constraints over 10 iterations in 306 ms. Result :sat
Minimization took 70 ms.
[2025-06-01 10:39:17] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:17] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-01 10:39:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:17] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-01 10:39:17] [INFO ] [Nat]Added 50 Read/Feed constraints in 44 ms returned sat
[2025-06-01 10:39:17] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-01 10:39:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-01 10:39:18] [INFO ] Added : 85 causal constraints over 18 iterations in 480 ms. Result :sat
Minimization took 73 ms.
[2025-06-01 10:39:18] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:18] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-01 10:39:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:18] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-01 10:39:18] [INFO ] [Nat]Added 50 Read/Feed constraints in 53 ms returned sat
[2025-06-01 10:39:18] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 27 ms.
[2025-06-01 10:39:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-01 10:39:19] [INFO ] Added : 77 causal constraints over 17 iterations in 478 ms. Result :sat
Minimization took 70 ms.
[2025-06-01 10:39:19] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:19] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 10:39:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:19] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-01 10:39:19] [INFO ] [Nat]Added 50 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:39:19] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 20 ms.
[2025-06-01 10:39:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:39:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 10:39:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2025-06-01 10:39:20] [INFO ] Added : 104 causal constraints over 22 iterations in 648 ms. Result :sat
Minimization took 147 ms.
[2025-06-01 10:39:20] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 10:39:20] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-01 10:39:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:20] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-01 10:39:20] [INFO ] [Nat]Added 50 Read/Feed constraints in 34 ms returned sat
[2025-06-01 10:39:20] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 26 ms.
[2025-06-01 10:39:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 10:39:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:39:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2025-06-01 10:39:21] [INFO ] Added : 91 causal constraints over 19 iterations in 607 ms. Result :sat
Minimization took 81 ms.
[2025-06-01 10:39:21] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2025-06-01 10:39:21] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 10:39:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 10:39:21] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-06-01 10:39:21] [INFO ] [Nat]Added 50 Read/Feed constraints in 28 ms returned sat
[2025-06-01 10:39:21] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 27 ms.
[2025-06-01 10:39:22] [INFO ] Added : 68 causal constraints over 14 iterations in 365 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[28, 51, 49, 51, 49, 49, 50, 50, 25, 50, 49, 51, 50, 27, 49, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52, 51, 49, 51, 49, 49, 50, 50, 51, 50, 49, 51, 50, 52, 49, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 16 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 401/401 transitions.
Graph (complete) has 600 edges and 250 vertex of which 60 are kept as prefixes of interest. Removing 190 places using SCC suffix rule.2 ms
Discarding 190 places :
Also discarding 304 output transitions
Drop transitions (Output transitions of discarded places.) removed 304 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 96
Applied a total of 2 rules in 23 ms. Remains 60 /250 variables (removed 190) and now considering 96/401 (removed 305) transitions.
Running 72 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 60 cols
[2025-06-01 10:39:42] [INFO ] Computed 12 invariants in 3 ms
[2025-06-01 10:39:42] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 12/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 84 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 12/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 156 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2803ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2850 ms. Remains : 60/250 places, 96/401 transitions.
[2025-06-01 10:39:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[52, 51, 49, 51, 49, 49, 50, 50, 51, 50, 49, 51, 50, 52, 49, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000006 steps (2 resets) in 1273 ms. (784 steps per ms)
FORMULA JoinFreeModules-PT-0050-UpperBounds-14 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-10 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-05 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-04 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-02 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 11000011 steps (22 resets) in 11576 ms. (950 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52, 51, 51, 50, 50, 51, 50, 51, 50, 52, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2025-06-01 10:39:58] [INFO ] Invariant cache hit.
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:39:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:39:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 10:39:58] [INFO ] [Nat]Added 12 Read/Feed constraints in 50 ms returned sat
[2025-06-01 10:39:58] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:39:58] [INFO ] Added : 49 causal constraints over 11 iterations in 78 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:39:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:39:58] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:39:58] [INFO ] Added : 57 causal constraints over 13 iterations in 85 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:39:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:39:58] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:39:58] [INFO ] Added : 50 causal constraints over 10 iterations in 78 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:39:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:39:58] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:39:58] [INFO ] Added : 54 causal constraints over 12 iterations in 80 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:39:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Added 12 Read/Feed constraints in 28 ms returned sat
[2025-06-01 10:39:59] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:39:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-06-01 10:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-01 10:39:59] [INFO ] Added : 52 causal constraints over 12 iterations in 147 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:39:59] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:39:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:39:59] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:39:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2025-06-01 10:39:59] [INFO ] Added : 54 causal constraints over 12 iterations in 109 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:39:59] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:39:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Added 12 Read/Feed constraints in 29 ms returned sat
[2025-06-01 10:39:59] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:39:59] [INFO ] Added : 45 causal constraints over 12 iterations in 93 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:39:59] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:39:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 10:39:59] [INFO ] [Nat]Added 12 Read/Feed constraints in 31 ms returned sat
[2025-06-01 10:39:59] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:39:59] [INFO ] Added : 52 causal constraints over 11 iterations in 76 ms. Result :sat
Minimization took 28 ms.
[2025-06-01 10:40:00] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:40:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Nat]Added 12 Read/Feed constraints in 64 ms returned sat
[2025-06-01 10:40:00] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:40:00] [INFO ] Added : 45 causal constraints over 11 iterations in 81 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:40:00] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:40:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:40:00] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:40:00] [INFO ] Added : 60 causal constraints over 15 iterations in 94 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:40:00] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:40:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 10:40:00] [INFO ] [Nat]Added 12 Read/Feed constraints in 28 ms returned sat
[2025-06-01 10:40:00] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:40:00] [INFO ] Added : 39 causal constraints over 9 iterations in 69 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[52, 51, 51, 50, 50, 51, 50, 51, 50, 52, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52, 51, 51, 50, 50, 51, 50, 51, 50, 52, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 50 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 6 ms. Remains 50 /60 variables (removed 10) and now considering 80/96 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 50/60 places, 80/96 transitions.
// Phase 1: matrix 80 rows 50 cols
[2025-06-01 10:40:01] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[52, 51, 51, 50, 50, 51, 50, 51, 50, 52, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000005 steps (2 resets) in 962 ms. (1038 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 8731 ms. (1259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52, 51, 51, 50, 50, 51, 50, 51, 50, 52, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2025-06-01 10:40:11] [INFO ] Invariant cache hit.
[2025-06-01 10:40:11] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:40:11] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:40:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:11] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 10:40:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:40:11] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:40:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 10:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-06-01 10:40:11] [INFO ] Added : 38 causal constraints over 9 iterations in 98 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 10:40:11] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:40:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:11] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 155 ms returned sat
[2025-06-01 10:40:12] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:40:12] [INFO ] Added : 34 causal constraints over 7 iterations in 40 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:40:12] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:40:12] [INFO ] Added : 27 causal constraints over 8 iterations in 77 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2025-06-01 10:40:12] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:40:12] [INFO ] Added : 29 causal constraints over 6 iterations in 33 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 81 ms returned sat
[2025-06-01 10:40:12] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:40:12] [INFO ] Added : 23 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 18 ms.
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:40:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:40:12] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:40:12] [INFO ] Added : 36 causal constraints over 9 iterations in 57 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:40:12] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:40:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 99 ms returned sat
[2025-06-01 10:40:13] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:40:13] [INFO ] Added : 21 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:40:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 101 ms returned sat
[2025-06-01 10:40:13] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:40:13] [INFO ] Added : 30 causal constraints over 6 iterations in 40 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2025-06-01 10:40:13] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:40:13] [INFO ] Added : 35 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:40:13] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:40:13] [INFO ] Added : 34 causal constraints over 9 iterations in 49 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:40:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:40:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 55 ms returned sat
[2025-06-01 10:40:13] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:40:14] [INFO ] Added : 23 causal constraints over 6 iterations in 37 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[52, 51, 51, 50, 50, 51, 50, 51, 50, 52, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52, 51, 51, 50, 50, 51, 50, 51, 50, 52, 50] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 11 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/50 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2025-06-01 10:40:14] [INFO ] Invariant cache hit.
[2025-06-01 10:40:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 10:40:14] [INFO ] Invariant cache hit.
[2025-06-01 10:40:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 10:40:14] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2025-06-01 10:40:14] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-01 10:40:14] [INFO ] Invariant cache hit.
[2025-06-01 10:40:14] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 60 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 60/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2025-06-01 10:40:16] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 131 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1448 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 1/1 constraints]
After SMT, in 2206ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2283 ms. Remains : 50/50 places, 80/80 transitions.
[2025-06-01 10:40:17] [INFO ] Flatten gal took : 49 ms
RANDOM walk for 40020 steps (8 resets) in 803 ms. (49 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
[2025-06-01 10:40:17] [INFO ] Flatten gal took : 23 ms
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
[2025-06-01 10:40:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11441123354728238398.gal : 7 ms
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
[2025-06-01 10:40:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14091722613624766308.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11441123354728238398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14091722613624766308.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 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
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
Loading property file /tmp/ReachabilityCardinality14091722613624766308.prop.
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :246 after 761
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :761 after 1340
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :1340 after 75946
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :75946 after 191677
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :191677 after 2.9833e+10
Invariant property MIN5 does not hold.
SDD proceeding with computation,21 properties remain. new max is 1024
SDD size :2.9833e+10 after 2.30771e+16
SDD proceeding with computation,21 properties remain. new max is 2048
SDD size :2.30771e+16 after 1.49114e+22
SDD proceeding with computation,21 properties remain. new max is 4096
SDD size :1.49114e+22 after 5.52632e+38
Interrupted probabilistic random walk after 157167 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 22
Probabilistic random walk after 157167 steps, saw 140431 distinct states, run finished after 3006 ms. (steps per millisecond=52 ) properties seen :0
[2025-06-01 10:40:20] [INFO ] Invariant cache hit.
[2025-06-01 10:40:20] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
[2025-06-01 10:40:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:40:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 5 ms to minimize.
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,8.95107e+55,3.15408,64080,2,3681,18,272269,27,0,444,307707,0
Total reachable state count : 8.95106610221689558409586313755186032795e+55
Verifying 22 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,3.15612,64080,1,0,18,272269,27,0,445,307707,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,3.15775,64080,1,0,18,272269,27,0,445,307707,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,3.16022,64080,1,0,18,272269,27,0,445,307707,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,3.16277,64080,1,0,18,272269,27,0,445,307707,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,3.16468,64080,1,0,18,272269,27,0,445,307707,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,3.16659,64080,1,0,18,272269,27,0,445,307707,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,3.16703,64080,1,0,18,272269,27,0,445,307707,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,3.16742,64080,1,0,18,272269,27,0,445,307707,0
Reachability property MAX4 does not hold.
No reachable states exhibit your property : MAX4
[2025-06-01 10:40:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
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,3.16817,64080,1,0,18,272269,27,0,445,307707,0
Invariant property MIN4 is true.
Problem MAX2 is UNSAT
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,3.16894,64080,1,0,18,272269,27,0,445,307707,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,3.17182,64080,1,0,18,272269,27,0,445,307707,0
Invariant property MIN5 does not hold.
Problem MAX3 is UNSAT
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,3.10031e+11,3.17279,64080,2,779,18,272269,28,0,447,307707,0
Reachability property MAX6 does not hold.
No reachable states exhibit your property : MAX6
Problem MAX4 is UNSAT
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,3.17511,64080,1,0,18,272269,28,0,447,307707,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,3.17753,64080,1,0,18,272269,28,0,447,307707,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,3.18165,64080,1,0,18,272269,28,0,447,307707,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,3.18598,64080,1,0,18,272269,28,0,447,307707,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,3.18935,64080,1,0,18,272269,28,0,447,307707,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,3.19288,64080,1,0,18,272269,28,0,447,307707,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,3.19443,64080,1,0,18,272269,28,0,447,307707,0
Invariant property MIN9 is true.
[2025-06-01 10:40:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem MAX5 is UNSAT
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,3.19598,64080,1,0,18,272269,28,0,447,307707,0
Reachability property MAX10 does not hold.
No reachable states exhibit your property : MAX10
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MIN9 is UNSAT
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,3.20019,64080,1,0,18,272269,28,0,447,307707,0
Invariant property MIN10 is true.
Problem MAX10 is UNSAT
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,3.20486,64080,1,0,18,272269,28,0,447,307707,0
After SMT solving in domain Real declared 50/130 variables, and 22 constraints, problems are : Problem set: 21 solved, 0 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/50 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 12/12 constraints]
After SMT, in 433ms problems are : Problem set: 21 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
FORMULA JoinFreeModules-PT-0050-UpperBounds-15 50 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-13 52 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-12 50 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-11 51 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-09 50 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-07 50 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-06 50 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-03 51 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-01 51 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0050-UpperBounds-00 52 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 10 queries.) : Max Seen:[51] Max Struct:[53]
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[53]
[2025-06-01 10:40:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[53]
RANDOM walk for 10005 steps (2 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[47] Max Struct:[53]
[2025-06-01 10:40:21] [INFO ] Invariant cache hit.
[2025-06-01 10:40:21] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:40:21] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:40:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:21] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:40:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 10:40:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:40:21] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:40:21] [INFO ] Added : 30 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[47] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions (Output transitions of discarded places.) removed 72 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:40:21] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 5/50 places, 8/80 transitions.
[2025-06-01 10:40:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000006 steps (2 resets) in 200 ms. (4975 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 141 ms. (7042 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52] Max Struct:[53]
[2025-06-01 10:40:21] [INFO ] Invariant cache hit.
[2025-06-01 10:40:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:40:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:40:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:40:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:40:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:40:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:40:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Current structural bounds on expressions (after SMT) : Max Seen:[52] Max Struct:[52]
FORMULA JoinFreeModules-PT-0050-UpperBounds-08 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-01 10:40:21] [INFO ] Flatten gal took : 5 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 10:40:21] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:40:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14207489708962118323.gal : 0 ms
[2025-06-01 10:40:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8365629991275429231.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/ReachabilityCardinality14207489708962118323.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8365629991275429231.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8365629991275429231.prop.
ITS runner timed out or was interrupted.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.001629,3512,2,15,5,61,6,0,45,39,0
Total reachable state count : 8
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08 in 866 ms.
[2025-06-01 10:40:21] [INFO ] Flatten gal took : 6 ms
Total runtime 76470 ms.
BK_STOP 1748774422034
--------------------
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-0050"
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-0050, 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-174876435700055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0050.tgz
mv JoinFreeModules-PT-0050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;