About the Execution of ITS-Tools for DoubleExponent-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 814.239 | 126185.00 | 144343.00 | 8221.70 | 1 4 4 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800861.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleExponent-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800861
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 33K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779676230955
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 02:30:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:30:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:30:32] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2026-05-25 02:30:32] [INFO ] Transformed 110 places.
[2026-05-25 02:30:32] [INFO ] Transformed 98 transitions.
[2026-05-25 02:30:32] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-548923579094574464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6066782100398437295.kers'
[2026-05-25 02:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-548923579094574464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6066782100398437295.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 110 cols 276 entries
Finished phase 1 with 89 SingleSign rule and 7 generalized
[2026-05-25 02:30:32] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6066782100398437295.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, +inf, +inf, 22, 1, 1, 1, 3, 1, 3, 1, 1, 3, 1, 1, 1]
RANDOM walk for 10000 steps (328 resets) in 24 ms. (400 steps per ms)
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110000 steps (3177 resets) in 232 ms. (472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 4, 0, 0, 0, 1, 0, 1, 0, 1] Max Struct:[33, +inf, +inf, 22, 1, 1, 3, 1, 3, 1, 3]
[2026-05-25 02:30:32] [INFO ] Invariant cache hit.
[2026-05-25 02:30:32] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 02:30:32] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2026-05-25 02:30:32] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 02:30:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:30:32] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-25 02:30:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2026-05-25 02:30:33] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 02:30:33] [INFO ] Added : 92 causal constraints over 19 iterations in 241 ms. Result :sat
Minimization took 75 ms.
[2026-05-25 02:30:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:33] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:30:33] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 02:30:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:30:33] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:33] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2026-05-25 02:30:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 448 ms
[2026-05-25 02:30:34] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 02:30:34] [INFO ] Added : 89 causal constraints over 18 iterations in 239 ms. Result :sat
Minimization took 79 ms.
[2026-05-25 02:30:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:34] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:34] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-25 02:30:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:34] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:30:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:30:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 181 ms
[2026-05-25 02:30:34] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 02:30:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2026-05-25 02:30:35] [INFO ] Added : 86 causal constraints over 18 iterations in 428 ms. Result :sat
Minimization took 117 ms.
[2026-05-25 02:30:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:30:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:35] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-25 02:30:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:30:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:30:35] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:30:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2026-05-25 02:30:35] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 02:30:35] [INFO ] Added : 95 causal constraints over 20 iterations in 195 ms. Result :sat
Minimization took 100 ms.
[2026-05-25 02:30:36] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-25 02:30:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 02:30:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2026-05-25 02:30:36] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 18 ms.
[2026-05-25 02:30:36] [INFO ] Added : 90 causal constraints over 18 iterations in 183 ms. Result :sat
Minimization took 71 ms.
[2026-05-25 02:30:36] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 02:30:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 12 ms returned sat
[2026-05-25 02:30:36] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:30:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2026-05-25 02:30:36] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 02:30:37] [INFO ] Added : 90 causal constraints over 18 iterations in 159 ms. Result :sat
Minimization took 72 ms.
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned unsat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-25 02:30:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 02:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2026-05-25 02:30:37] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 02:30:37] [INFO ] Added : 85 causal constraints over 17 iterations in 139 ms. Result :sat
Minimization took 69 ms.
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned unsat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-25 02:30:37] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 02:30:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 02:30:37] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:30:38] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 02:30:38] [INFO ] Added : 64 causal constraints over 13 iterations in 108 ms. Result :sat
Minimization took 61 ms.
[2026-05-25 02:30:38] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 02:30:38] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 4, 0, 0, 0, 1, 0, 1, 0, 1] Max Struct:[33, +inf, +inf, 22, 1, 1, 1, 1, 1, 1, 1]
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 4, 0, 0, 0, 0, 0] Max Struct:[33, +inf, +inf, 22, 1, 1, 1, 1]
Support contains 8 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 14 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 92 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 89 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 89 transition count 77
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 43 place count 85 transition count 77
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 81 place count 66 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 64 transition count 58
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 92 place count 64 transition count 51
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 99 place count 57 transition count 51
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 108 place count 57 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 56 transition count 50
Applied a total of 109 rules in 1669 ms. Remains 56 /110 variables (removed 54) and now considering 50/98 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1678 ms. Remains : 56/110 places, 50/98 transitions.
findPositiveTsemiflow completed in 128 ms - Found solution {1=1, 2=1, 3=1, 17=1, 18=1, 19=1, 30=1, 31=1, 44=1, 46=1} and attempted to minimize in 0 ms success -> {1=1, 2=1, 3=1, 17=1, 18=1, 19=1, 30=1, 31=1, 44=1, 46=1}
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8949490434314762548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2292239239580850045.kers'
[2026-05-25 02:30:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8949490434314762548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2292239239580850045.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 50 rows 54 cols 192 entries
Finished phase 1 with 36 SingleSign rule and 9 generalized
[2026-05-25 02:30:50] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2292239239580850045.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
RANDOM walk for 1000000 steps (112551 resets) in 824 ms. (1212 steps per ms)
BEST_FIRST walk for 4000000 steps (310621 resets) in 1916 ms. (2086 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
[2026-05-25 02:30:53] [INFO ] Invariant cache hit.
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:30:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:30:53] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] Computed and/alt/rep : 49/182/49 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 02:30:53] [INFO ] Added : 41 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 22 ms.
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] Computed and/alt/rep : 49/182/49 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 02:30:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] Computed and/alt/rep : 49/182/49 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 02:30:53] [INFO ] Added : 46 causal constraints over 10 iterations in 69 ms. Result :sat
Minimization took 23 ms.
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:30:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2026-05-25 02:30:53] [INFO ] Computed and/alt/rep : 49/182/49 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 02:30:53] [INFO ] Added : 14 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 29 ms.
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:30:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:30:53] [INFO ] Computed and/alt/rep : 49/182/49 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 02:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2026-05-25 02:30:53] [INFO ] Added : 43 causal constraints over 9 iterations in 114 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 50/50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 56 transition count 47
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 53 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 52 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 51 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 51 transition count 46
Applied a total of 11 rules in 8 ms. Remains 51 /56 variables (removed 5) and now considering 46/50 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 51/56 places, 46/50 transitions.
findPositiveTsemiflow completed in 49 ms - Found solution {1=1, 2=1, 3=1, 12=1, 13=1, 14=1, 23=1, 24=1, 35=1, 37=1} and attempted to minimize in 0 ms success -> {1=1, 2=1, 3=1, 12=1, 13=1, 14=1, 23=1, 24=1, 35=1, 37=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13463398430112041602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-877771413747050106.kers'
[2026-05-25 02:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13463398430112041602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-877771413747050106.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 46 rows 49 cols 190 entries
Finished phase 1 with 31 SingleSign rule and 9 generalized
[2026-05-25 02:31:04] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-877771413747050106.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
RANDOM walk for 1000000 steps (112939 resets) in 616 ms. (1620 steps per ms)
BEST_FIRST walk for 4000003 steps (311142 resets) in 1909 ms. (2094 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
[2026-05-25 02:31:06] [INFO ] Invariant cache hit.
[2026-05-25 02:31:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 02:31:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 02:31:06] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:31:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:06] [INFO ] Computed and/alt/rep : 45/205/45 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 02:31:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2026-05-25 02:31:06] [INFO ] Added : 32 causal constraints over 7 iterations in 162 ms. Result :sat
Minimization took 22 ms.
[2026-05-25 02:31:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-25 02:31:06] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:06] [INFO ] Computed and/alt/rep : 45/205/45 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 02:31:07] [INFO ] Added : 33 causal constraints over 8 iterations in 52 ms. Result :sat
Minimization took 20 ms.
[2026-05-25 02:31:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 02:31:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2026-05-25 02:31:07] [INFO ] Computed and/alt/rep : 45/205/45 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 02:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 02:31:07] [INFO ] Added : 14 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 23 ms.
[2026-05-25 02:31:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 02:31:07] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:07] [INFO ] Computed and/alt/rep : 45/205/45 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 02:31:07] [INFO ] Added : 43 causal constraints over 10 iterations in 73 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 51/51 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-05-25 02:31:07] [INFO ] Invariant cache hit.
[2026-05-25 02:31:07] [INFO ] Implicit Places using invariants in 51 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/51 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 44
Applied a total of 2 rules in 3 ms. Remains 49 /50 variables (removed 1) and now considering 44/46 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17699257836272438224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9084151588091987355.kers'
[2026-05-25 02:31:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17699257836272438224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9084151588091987355.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 47 cols 178 entries
Finished phase 1 with 30 SingleSign rule and 9 generalized
[2026-05-25 02:31:07] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9084151588091987355.kers
Total runtime 1 ms.
[2026-05-25 02:31:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 02:31:07] [INFO ] Invariant cache hit.
[2026-05-25 02:31:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:31:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [16, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 113 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 47/51 places, 44/46 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 43
Applied a total of 2 rules in 5 ms. Remains 46 /47 variables (removed 1) and now considering 43/44 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7607349417154892189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14650445753764416373.kers'
[2026-05-25 02:31:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7607349417154892189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14650445753764416373.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 43 rows 44 cols 164 entries
Finished phase 1 with 36 SingleSign rule and 2 generalized
[2026-05-25 02:31:07] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14650445753764416373.kers
Total runtime 1 ms.
[2026-05-25 02:31:07] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 02:31:07] [INFO ] Invariant cache hit.
[2026-05-25 02:31:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:31:07] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 46/51 places, 43/46 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 279 ms. Remains : 46/51 places, 43/46 transitions.
findPositiveTsemiflow completed in 52 ms - Found solution {1=1, 2=1, 5=1, 6=1, 11=1, 12=1, 20=1, 21=1, 32=1, 34=1, 38=1, 41=1} and attempted to minimize in 0 ms success -> {1=1, 2=1, 11=1, 12=1, 20=1, 21=1, 32=1, 34=1, 41=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
[2026-05-25 02:31:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
RANDOM walk for 1000000 steps (125246 resets) in 574 ms. (1739 steps per ms)
BEST_FIRST walk for 4000000 steps (333433 resets) in 1746 ms. (2289 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
[2026-05-25 02:31:20] [INFO ] Invariant cache hit.
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 02:31:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:31:20] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] Computed and/alt/rep : 42/176/42 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 02:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2026-05-25 02:31:20] [INFO ] Added : 34 causal constraints over 7 iterations in 99 ms. Result :sat
Minimization took 21 ms.
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] Computed and/alt/rep : 42/176/42 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:20] [INFO ] Computed and/alt/rep : 42/176/42 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 02:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2026-05-25 02:31:20] [INFO ] Added : 37 causal constraints over 8 iterations in 95 ms. Result :sat
Minimization took 23 ms.
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2026-05-25 02:31:20] [INFO ] Computed and/alt/rep : 42/176/42 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 02:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2026-05-25 02:31:20] [INFO ] Added : 21 causal constraints over 5 iterations in 117 ms. Result :sat
Minimization took 27 ms.
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 02:31:20] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:21] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 02:31:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:31:21] [INFO ] Computed and/alt/rep : 42/176/42 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 02:31:21] [INFO ] Added : 39 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 46/46 places, 43/43 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2026-05-25 02:31:21] [INFO ] Invariant cache hit.
[2026-05-25 02:31:21] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 02:31:21] [INFO ] Invariant cache hit.
[2026-05-25 02:31:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:31:21] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2026-05-25 02:31:21] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-25 02:31:21] [INFO ] Invariant cache hit.
[2026-05-25 02:31:21] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/88 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 59 constraints, problems are : Problem set: 0 solved, 42 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/88 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 102 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2763 ms. Remains : 46/46 places, 43/43 transitions.
findPositiveTsemiflow completed in 52 ms - Found solution {1=1, 2=1, 5=1, 6=1, 11=1, 12=1, 20=1, 21=1, 32=1, 34=1, 38=1, 41=1} and attempted to minimize in 0 ms success -> {1=1, 2=1, 11=1, 12=1, 20=1, 21=1, 32=1, 34=1, 41=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 4, 0] Max Struct:[33, +inf, +inf, 22]
RANDOM walk for 40000 steps (4990 resets) in 836 ms. (47 steps per ms) remains 6/6 properties
[2026-05-25 02:31:34] [INFO ] Flatten gal took : 42 ms
[2026-05-25 02:31:34] [INFO ] Flatten gal took : 16 ms
[2026-05-25 02:31:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6984751980262304346.gal : 12 ms
[2026-05-25 02:31:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8033785909147020528.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6984751980262304346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8033785909147020528.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8033785909147020528.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 7
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :7 after 15
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :27 after 49
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :49 after 159
Invariant property MIN3 does not hold.
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :288 after 518
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :856 after 948
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,1199,0.0436,5320,2,912,19,5821,9,0,233,5106,0
Total reachable state count : 1199
Verifying 6 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.04409,5416,1,0,19,5821,9,0,234,5106,0
Invariant property MIN0 does not hold.
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,225,0.044522,5584,2,455,19,5821,10,0,236,5106,0
Invariant property MIN1 does not hold.
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,104,0.044751,5584,2,335,19,5821,11,0,238,5106,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.044976,5584,1,0,19,5821,11,0,238,5106,0
Reachability property MAX3 does not hold.
No reachable states exhibit your property : MAX3
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,0,0.045179,5584,1,0,19,5821,11,0,238,5106,0
Invariant property MIN3 does not hold.
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,104,0.04546,5584,2,335,19,5821,12,0,240,5106,0
BEST_FIRST walk for 40001 steps (3343 resets) in 742 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3347 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3392 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3323 resets) in 112 ms. (353 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3339 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3294 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
Probably explored full state space saw : 1199 states, properties seen :3
Probabilistic random walk after 2397 steps, saw 1199 distinct states, run finished after 51 ms. (steps per millisecond=47 ) properties seen :3
Explored full state space saw : 1199 states, properties seen :0
Exhaustive walk after 2397 steps, saw 1199 distinct states, run finished after 17 ms. (steps per millisecond=141 ) properties seen :0
FORMULA DoubleExponent-PT-002-UpperBounds-02 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 2, 1] Max Struct:[32, +inf, 21]
[2026-05-25 02:31:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 1] Max Struct:[32, +inf, 21]
RANDOM walk for 1000000 steps (124963 resets) in 574 ms. (1739 steps per ms)
BEST_FIRST walk for 3000000 steps (249670 resets) in 1309 ms. (2290 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1] Max Struct:[32, +inf, 21]
[2026-05-25 02:31:36] [INFO ] Invariant cache hit.
[2026-05-25 02:31:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:36] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:36] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2026-05-25 02:31:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:36] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 02:31:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 02:31:36] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:36] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 02:31:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:36] [INFO ] Computed and/alt/rep : 42/176/42 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 02:31:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 02:31:36] [INFO ] Added : 37 causal constraints over 8 iterations in 107 ms. Result :sat
Minimization took 21 ms.
[2026-05-25 02:31:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:37] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 02:31:37] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1] Max Struct:[1, +inf, 1]
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 43/43 transitions.
Graph (complete) has 146 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 44 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 43 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 43 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 42 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 41 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 41 transition count 39
Applied a total of 10 rules in 6 ms. Remains 41 /46 variables (removed 5) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 41/46 places, 39/43 transitions.
findPositiveTsemiflow completed in 47 ms - Found solution {1=1, 2=1, 3=2, 8=1, 15=1, 23=1, 25=1, 27=1, 28=2, 31=1, 35=1} and attempted to minimize in 0 ms success -> {1=1, 2=1, 8=1, 15=1, 23=1, 25=1, 31=1, 35=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4125603036307402313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9497727870615507498.kers'
[2026-05-25 02:31:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4125603036307402313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9497727870615507498.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 39 rows 39 cols 159 entries
Finished phase 1 with 28 SingleSign rule and 5 generalized
[2026-05-25 02:31:47] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9497727870615507498.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (156336 resets) in 581 ms. (1718 steps per ms)
BEST_FIRST walk for 1000000 steps (96241 resets) in 417 ms. (2392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2026-05-25 02:31:48] [INFO ] Invariant cache hit.
[2026-05-25 02:31:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:48] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-25 02:31:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 02:31:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:31:48] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:48] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 02:31:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2026-05-25 02:31:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2026-05-25 02:31:48] [INFO ] Computed and/alt/rep : 38/193/38 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 02:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2026-05-25 02:31:48] [INFO ] Added : 34 causal constraints over 8 iterations in 120 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 02:31:48] [INFO ] Invariant cache hit.
[2026-05-25 02:31:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 02:31:48] [INFO ] Invariant cache hit.
[2026-05-25 02:31:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:31:48] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 40/41 places, 39/39 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 38 transition count 37
Applied a total of 4 rules in 7 ms. Remains 38 /40 variables (removed 2) and now considering 37/39 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17018108045997775775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13223480642261895027.kers'
[2026-05-25 02:31:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17018108045997775775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13223480642261895027.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 37 rows 36 cols 152 entries
Finished phase 1 with 28 SingleSign rule and 3 generalized
[2026-05-25 02:31:48] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13223480642261895027.kers
Total runtime 0 ms.
[2026-05-25 02:31:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 02:31:48] [INFO ] Invariant cache hit.
[2026-05-25 02:31:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:31:48] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 38/41 places, 37/39 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 276 ms. Remains : 38/41 places, 37/39 transitions.
findPositiveTsemiflow completed in 50 ms - Found solution {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1} and attempted to minimize in 1 ms success -> {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2026-05-25 02:31:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (155984 resets) in 574 ms. (1739 steps per ms)
BEST_FIRST walk for 1000001 steps (96015 resets) in 433 ms. (2304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2026-05-25 02:31:59] [INFO ] Invariant cache hit.
[2026-05-25 02:31:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:31:59] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 02:31:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 02:31:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:31:59] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:31:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:31:59] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:31:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 02:31:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:31:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2026-05-25 02:31:59] [INFO ] Computed and/alt/rep : 35/179/35 causal constraints (skipped 1 transitions) in 2 ms.
[2026-05-25 02:32:00] [INFO ] Added : 28 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 38/38 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2026-05-25 02:32:00] [INFO ] Invariant cache hit.
[2026-05-25 02:32:00] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 02:32:00] [INFO ] Invariant cache hit.
[2026-05-25 02:32:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:32:00] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2026-05-25 02:32:00] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2026-05-25 02:32:00] [INFO ] Invariant cache hit.
[2026-05-25 02:32:00] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 37/75 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/75 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 56 constraints, problems are : Problem set: 0 solved, 36 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 37/75 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 97 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1809 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2713ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2842 ms. Remains : 38/38 places, 37/37 transitions.
findPositiveTsemiflow completed in 51 ms - Found solution {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1} and attempted to minimize in 0 ms success -> {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2026-05-25 02:32:12] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 40000 steps (6210 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2026-05-25 02:32:13] [INFO ] Flatten gal took : 15 ms
[2026-05-25 02:32:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16203645978541308017.gal : 2 ms
[2026-05-25 02:32:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3070789727911185576.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16203645978541308017.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3070789727911185576.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40000 steps (3791 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 825 steps, run visited all 1 properties in 5 ms. (steps per millisecond=165 )
Probabilistic random walk after 825 steps, saw 423 distinct states, run finished after 10 ms. (steps per millisecond=82 ) properties seen :1
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3070789727911185576.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :55 after 64
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :64 after 192
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,539,0.022671,4904,2,738,15,3643,6,0,192,2832,0
Total reachable state count : 539
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
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,1,0.02294,4932,2,39,15,3643,7,0,195,2832,0
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[3] Max Struct:[+inf]
[2026-05-25 02:32:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (156066 resets) in 584 ms. (1709 steps per ms)
BEST_FIRST walk for 1000000 steps (96138 resets) in 419 ms. (2380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2026-05-25 02:32:14] [INFO ] Invariant cache hit.
[2026-05-25 02:32:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:32:14] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 02:32:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 02:32:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:32:14] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:32:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:32:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:32:14] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 02:32:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 02:32:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:32:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 159 ms
[2026-05-25 02:32:14] [INFO ] Computed and/alt/rep : 35/179/35 causal constraints (skipped 1 transitions) in 4 ms.
[2026-05-25 02:32:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2026-05-25 02:32:14] [INFO ] Added : 34 causal constraints over 8 iterations in 169 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2026-05-25 02:32:14] [INFO ] Invariant cache hit.
[2026-05-25 02:32:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 02:32:14] [INFO ] Invariant cache hit.
[2026-05-25 02:32:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:32:14] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2026-05-25 02:32:14] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 38/38 places, 37/37 transitions.
findPositiveTsemiflow completed in 62 ms - Found solution {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1} and attempted to minimize in 1 ms success -> {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2026-05-25 02:32:24] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:32:24] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:32:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5884291402510424243.gal : 1 ms
[2026-05-25 02:32:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3028331128883257228.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5884291402510424243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3028331128883257228.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (6250 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3028331128883257228.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :55 after 64
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :64 after 192
BEST_FIRST walk for 40001 steps (3841 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :293 after 539
Finished probabilistic random walk after 1282 steps, run visited all 1 properties in 9 ms. (steps per millisecond=142 )
Probabilistic random walk after 1282 steps, saw 655 distinct states, run finished after 9 ms. (steps per millisecond=142 ) properties seen :1
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[4] Max Struct:[+inf]
[2026-05-25 02:32:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (156251 resets) in 586 ms. (1703 steps per ms)
BEST_FIRST walk for 1000000 steps (95556 resets) in 419 ms. (2380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2026-05-25 02:32:25] [INFO ] Invariant cache hit.
[2026-05-25 02:32:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:32:25] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 02:32:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 02:32:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:32:25] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:32:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:32:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 02:32:25] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 02:32:25] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 02:32:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-05-25 02:32:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 156 ms
[2026-05-25 02:32:26] [INFO ] Computed and/alt/rep : 35/179/35 causal constraints (skipped 1 transitions) in 6 ms.
[2026-05-25 02:32:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2026-05-25 02:32:26] [INFO ] Added : 34 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 38/38 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2026-05-25 02:32:26] [INFO ] Invariant cache hit.
[2026-05-25 02:32:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 02:32:26] [INFO ] Invariant cache hit.
[2026-05-25 02:32:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-25 02:32:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-05-25 02:32:26] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 38/38 places, 37/37 transitions.
findPositiveTsemiflow completed in 48 ms - Found solution {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1} and attempted to minimize in 0 ms success -> {1=1, 2=1, 7=1, 13=1, 19=1, 21=1, 27=1, 31=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40000 steps (6302 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3875 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1160 states, properties seen :0
Probabilistic random walk after 2319 steps, saw 1160 distinct states, run finished after 7 ms. (steps per millisecond=331 ) properties seen :0
Explored full state space saw : 1160 states, properties seen :0
Exhaustive walk after 2319 steps, saw 1160 distinct states, run finished after 3 ms. (steps per millisecond=773 ) properties seen :0
[2026-05-25 02:32:36] [INFO ] Flatten gal took : 33 ms
[2026-05-25 02:32:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:32:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7906161478077024136.gal : 1 ms
[2026-05-25 02:32:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8640331034623263227.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7906161478077024136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8640331034623263227.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8640331034623263227.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.007176,4344,2,44,5,119,6,0,192,44,0
Total reachable state count : 2
ITS runner timed out or was interrupted.
FORMULA DoubleExponent-PT-002-UpperBounds-01 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 02:32:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (156571 resets) in 558 ms. (1788 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 125010 ms.
BK_STOP 1779676357140
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-002, 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 r098-tall-177955695800861"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 ;